Literaturverzeichnis[EFMP99] Robert Elsässer, Andreas Frommer, Burkhard Monien und Robert Preis.Optimal and Alternating-Direction <strong>Loadbalancing</strong> Schemes. In P. Amestoy,P. Berger, M. Daydé, I. Duff, V. Frayssé, L. Giraud und D. Ruiz, Hrsg.,Euro-Par’99 Parallel Processing, Lecture Notes in Computer Science, No.1685, Seiten 280–290. Springer-Verlag, 1999.[Els02]Robert Elsässer. Spectral Methods for Efficient Load Balancing Strategies.Dissertation, Universität Paderborn, Fachbereich Mathematik / Informatik,Februar 2002.[EMP00] Robert Elsässer, Burkhard Monien und Robert Preis. Diffusive Load BalancingSchemes on Heterogeneous Networks. In 12th ACM Symposium onParallel Algorithms and Architectures (SPAA) 2000, Seiten 30–38, 2000.[Fel97][FM98]Rainer Feldmann. Computer Chess: Algorithms and Heuristics for a DeepLook into the Future. In F. Plasil und K. G. Jeffrey, Hrsg., SOFSEM’97:Theory and Practice of Informatics, Lecture Notes in Computer Science, No.1338, Seiten 1–18. Springer-Verlag, 1997.Rainer Feldmann und Burkhard Monien. Selective Game Tree Search on aCray T3E. Technical report, University of Paderborn, November 1998.[FW78] Stanley Fiorini und Robin J. Wilson. Edge-Colorings of Graphs. In Lowell W.Beineke und Robin J. Wilson, Hrsg., Selected Topics in Graph Theory, Kapitel5, Seiten 103–126. Academic Press, London, 1978.[GL96][HB95][HB99][HJ85][HJ91]Gene H. Golub und Charles F. Van Loan. Matrix Computations. The JohnHopkins University Press, Baltimore, London, 3. Auflage, 1996.Y. F. Hu und R. J. Blake. An Optimal Dynamic Load Balancing Algorithm.Daresbury Laboratory Report DLP 95010, Daresbury Laboratory, 1995.Y. F. Hu und R. J. Blake. An improved diffusion algorithm for dynamic loadbalancing. Parallel Computing, 25:417–444, 1999.Roger A. Horn und Charles R. Johnson. Matrix Analysis. Cambridge UniversityPress, 1985.Roger A. Horn und Charles R. Johnson. Topics in Matrix Analysis. CambridgeUniversity Press, 1991.[HLM + 90] Seyed H. Hosseini, Bruce Litow, Mohammad I. Malkawi, Joseph McPhersonund K. Vairavan. Analysis of a Graph Coloring Based Distributed LoadBalancing Algorithm. Journal of Parallel and Distributed Computing, 10:160–166, 1990.[Iji65]Yuji Ijiri. On the Generalized Inverse of an Incidence Matrix. Journal of theSociety for Industrial and Applied Mathematics, 13(3):827–836, September1965.132
Literaturverzeichnis[LM92] Reinhard Lüling und Burkhard Monien. Load Balancing for DistributedBranch & Bound Algorithms. In Proceedings of the 6th International ProcessingSymposium (IPPS ’92), Seiten 543–549, 1992.[MGS96][Pad]S. Muthukrishnan, Bhaskar Ghosh und Martin H. Schultz. First and secondorder diffusive methods for rapid, coarse, distributed load balancing. In SPAA’96. Proceedings of the 8th annual ACM symposium on Parallel algorithmsand architectures, Seiten 72–81, 1996.PadFEM: Parallel Adaptive FEM. www.upb.de/pc2/projects/padfem.[Rei91] Lothar Reichel. The Application of Leja Points to Richardson Iterationand Polynomial Preconditioning. Linear Algebra and its Applications, 154–156:389–414, 1991.[SR99][vdSD02][XL92][XL95]Olaf Schmidt und Ludger Reeker. New Dynamic Load Balancing Strategyfor Efficient Data-Parallel Radiosity Calculations. In H. R. Arabnia, Hrsg.,Proceedings of the 1999 International Conference on Parallel and DistributedProcessing Techniques and Applications (PDPTA’99), Seiten 532–538.CSREA Press, 1999.Aad J. van der Steen und Jack J. Dongarra. Overview of Recent Supercomputers,2002. www.top500.org/ORSC/2002.Chengzhong Xu und Francis C. M. Lau. Analysis of the Generalized <strong>Dimension</strong>Exchange Method for Dynamic Load Balancing. Journal of Parallel andDistributed Computing, 16(4):385–393, Dezember 1992.Chengzhong Xu und Francis C. M. Lau. The Generalized <strong>Dimension</strong> ExchangeMethod for Load Balancing in k-ary n-cubes and Variants. Journalof Parallel and Distributed Computing, 24(1):72–85, Januar 1995.133