Loadbalancing auf Parallelrechnern mit Hilfe endlicher Dimension ...

Literaturverzeichnis[ALO02]Götz Alefeld, Ingrid Lenhardt und Holger Obermaier. Parallele numerischeVerfahren. Springer, Berlin, 2002.[Arj82] Eshrat Arjomandi. An Efficient Algorithm for Colouring the Edges of aGraph with ∆ + 1 Colours. INFOR, 20(2):82–101, Mai 1982.[CDS95][Cro97][CW85][Cyb89][Dav79]Dragoš M. Cvetković, Michael Doob und Horst Sachs. Spectra of Graphs:Theory and Applications. Johann Ambrosius Barth Verlag, Heidelberg, Leipzig,3. Auflage, 1995.Thomas W. Crockett. An introduction to parallel rendering. Parallel Computing,23:819–843, 1997.Jane K. Cullum und Ralph A. Willoughby. Lanczos Algorithms for LargeSymmetric Eigenvalue Computations Vol. I Theory. Progress in ScientificComputing Vol. 3. Birkhäuser, Boston, Basel, Stuttgart, 1985.George Cybenko. Dynamic Load Balancing for Distributed Memory Multiprocessors.Journal of Parallel and Distributed Computing, 7:279–301, 1989.Philip J. Davis. Circulant Matrices. Pure and Applied Mathematics. JohnWiley & Sons, New York, Chichester, Brisbane, Toronto, 1979.[DDNR96] Ralf Diekmann, Uwe Dralle, Friedhelm Neugebauer und Thomas Römke.PadFEM: A Portable Parallel FEM-Tool. In HPCN Europe 96, Brüssel,April 1996.[DFM98][DFM99][DMP99]Ralf Diekmann, Andreas Frommer und Burkhard Monien. Nearest NeighborLoad Balancing on Graphs. In G. Bilardi, G. Italiano, A. Piertracaprina undG. Pucci, Hrsg., 6th European Symposium on Algorithms (ESA ’98), LectureNotes in Computer Science, No. 1461, Seiten 429–440. Springer-Verlag, 1998.Ralf Diekmann, Andreas Frommer und Burkhard Monien. Efficient schemesfor nearest neighbor load balancing. Parallel Computing, 25:789–812, 1999.Ralf Diekmann, Burkhard Monien und Robert Preis. Load Balancing Strategiesfor Distributed Memory Machines. In B.H.V. Topping, Hrsg., Paralleland Distributed Processing for Computational Mechanics: Systems and Tools,Seiten 124–157. Saxe-Coburg Publications, 1999.131