Advertisement

Mapping und Lastverteilung in parallelen Systemen

  • Burkhard Monien
  • Reinhard Lüling
Part of the Informatik aktuell book series (INFORMAT)

Abstrakt

Dieser Artikel gibt einen Überblick über die zur Abbildung eines verteilten Algorithmus auf ein paralleles System entwickelten Methoden. Wir stellen dazu eine Reihe von Ergebnissen aus den Bereichen Mapping und dynamischer Lastverteilung vor. Die Ergebnisse im Bereich dynamischer Lastverteilungsverfahren werden anhand eines Beispiels motiviert.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literatur

  1. 1.
    L. V. Kale: Comparing the Performance of two Dynamic Load Distribution Methods, Parallel Processing, vol. 1, pp. 8–12, 1988Google Scholar
  2. 2.
    F. C. H. Lin, R. M. Keller: The Gradient Model Load Balancing Method, IEEE Trans, on Software Engineering 13, pp. 32–38, 1987CrossRefGoogle Scholar
  3. 3.
    R. Feldmann, W. Unger: The Cube Connected Cycle is a subgraph of the Butterfly network, to be published in Parallel Processing LettersGoogle Scholar
  4. 4.
    D. Ferguson, Y. Yemini, C. Nikolaou: Microeconomic Algorithms for Load Balancing in Distributed Computer Systems, IEEE 8th Int. Conf. on Distributed Computing Systems, pp. 491–499, 1988Google Scholar
  5. 5.
    R. Heckmann, R. Klasing, B. Monien, W. Unger: Optimal embedding of complete binary trees into lines and grids, Prod, of 17th Int. Workshop on Graph Theoretic Concepts in Computer Science (WG 91), LNCS 570, pp. 25–31, 1991Google Scholar
  6. 6.
    H. Kuchen, A. Wagener: Lastverteilungsstrategien auf Multicomputern, Transputer Anwender Treffen 1990, Abstraktband pp. 3–6Google Scholar
  7. 7.
    R. Klasing, R. Lüling, B. Monien Compressing Cube Connected Cycles and Butterfly networks, Proc. 2nd IEEE Symposium on Parallel and Distributed Processing, pp. 858–865, 1990Google Scholar
  8. 8.
    F. T. Leighton: Introduction to Parallel Algorithms and Architectures, Arrays, Trees, Hxjpercubes, Morgan Kaufmann Publishers, 1992Google Scholar
  9. 9.
    R. Lüling, B. Monien: Ttuo Strategies for solving the Vertex Cover Problem on a Transputer Network, Int Workshop on Distributed Algorithms 1989, pp. 160–170Google Scholar
  10. 10.
    R. Lüling, B. Monien: Load Balancing for distributed Branch & Bound Algorithms, Int. Parallel Processing Symposium 1992, pp. 543–549Google Scholar
  11. 11.
    B. Monien: Simulating binary trees on X-trees, Proc. of 3rd ACM Symposium on Parallel Algorithms and Architectures (SPAA 91), pp. 147–158, 1991Google Scholar
  12. 12.
    B. Monien, I. H. Sudborough: Embedding one Interconnection Network in Another, Computing Suppl. 7 (1990), pp. 257–282MathSciNetCrossRefGoogle Scholar
  13. 13.
    L. M. Ni, C. W. Xu, T. B. Gendreau: Drafting Algorithm — A Dxjnamic Process Migration Protocol For Distributed Systems, IEEE 5th Int. Conf. on Distributed Computing Systems, pp. 539–546, 1985Google Scholar
  14. 14.
    M. Räcke, S. Tschöke, B. Monien, R. Lüling: Efficient Parallelization of a Branch & Bound Algorithm for the Symmetric Traveling Salesman Problem, European Workshop on Parallel Computing 1992Google Scholar
  15. 15.
    F. Ramme, R. Lüling, B. Monien: Load Balancing in Large Networks: A Comparative Study, IEEE Symposium on Parallel and Distributed Processing 1991, pp. 686–689Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Burkhard Monien
    • 1
  • Reinhard Lüling
    • 1
  1. 1.Universität-GH PaderbornDeutschland

Personalised recommendations