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.
Diese Arbeit wurde durch das Bundesministerium für Forschung und Technologie (BMFT) im Rahmen des PARAWAN Projektes (413-5839-ITR 9007 BO) unterstützt
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Literatur
L. V. Kale: Comparing the Performance of two Dynamic Load Distribution Methods, Parallel Processing, vol. 1, pp. 8–12, 1988
F. C. H. Lin, R. M. Keller: The Gradient Model Load Balancing Method, IEEE Trans, on Software Engineering 13, pp. 32–38, 1987
R. Feldmann, W. Unger: The Cube Connected Cycle is a subgraph of the Butterfly network, to be published in Parallel Processing Letters
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, 1988
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, 1991
H. Kuchen, A. Wagener: Lastverteilungsstrategien auf Multicomputern, Transputer Anwender Treffen 1990, Abstraktband pp. 3–6
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, 1990
F. T. Leighton: Introduction to Parallel Algorithms and Architectures, Arrays, Trees, Hxjpercubes, Morgan Kaufmann Publishers, 1992
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–170
R. Lüling, B. Monien: Load Balancing for distributed Branch & Bound Algorithms, Int. Parallel Processing Symposium 1992, pp. 543–549
B. Monien: Simulating binary trees on X-trees, Proc. of 3rd ACM Symposium on Parallel Algorithms and Architectures (SPAA 91), pp. 147–158, 1991
B. Monien, I. H. Sudborough: Embedding one Interconnection Network in Another, Computing Suppl. 7 (1990), pp. 257–282
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, 1985
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 1992
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–689
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Monien, B., Lüling, R. (1993). Mapping und Lastverteilung in parallelen Systemen. In: Baumann, M., Grebe, R. (eds) Parallele Datenverarbeitung mit dem Transputer. Informatik aktuell. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-78123-0_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-78123-0_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56534-5
Online ISBN: 978-3-642-78123-0
eBook Packages: Springer Book Archive