Skip to main content
SpringerLink
Log in

A fast distributed mapping algorithm

  • Load Balancing And The Mapping Problem
  • Conference paper
  • First Online:
CONPAR 90 — VAPP IV (VAPP 1990, CONPAR 1990)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 457))

Abstract

Generating an efficient program for a parallel computer requires that the distribution of the processes on the processors comprising the parallel computer is most optimal. This paper presents a new method for a load balanced and communication optimized process distribution onto an arbitrary processor (network) topology. As opposed to many other approaches for this problem, the presented algorithm is fully distributed and based on a purely local method. It has shown to be much faster compared to the classical methods like simulated annealing, heuristic search, etc.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J.E. Boillat, P.G. Kropf, D.Chr. Meier, and A. Wespi. An analysis and reconfiguration tool for mapping parallel programs onto transputer networks. In T. Muntean, editor, OPPT, Grenoble, 1987.

    Google Scholar 

  2. J.E. Boillat, P.G. Kropf, and K. Wyler. Evolutionäre Algorithmen. Technical Report IAM-PR-88205, University of Bern, Informatics, 1988.

    Google Scholar 

  3. J.E. Boillat. Load balancing and poisson equation in a graph. To appear in Concurrency: Practice and Experience.

    Google Scholar 

  4. S.H. Bokhari. On the mapping problem. IEEE Transactions on Computers, C-30(3):550–557, 1981.

    Google Scholar 

  5. J.G. Donnet, M Starkey, and D.B. Skillicorn. Effective algorithms for partitioning distributed programs. In Proceedings of the 7th Ann. Int. Phoenix Conf. on Computers and Communications, IEE, 1988.

    Google Scholar 

  6. G. Fox, A. Kolawa, and R. Williams. The implementation of a dynamic load balancer. In M.T. Heath, editor, Hypercube Multiprocessors, page 114, SIAM, 1987.

    Google Scholar 

  7. C.A.R. Hoare. Communicating Sequential Processes. Prentice-Hall, Englewood Cliffs, 1985.

    Google Scholar 

  8. INMOS. OCCAM 2 Reference Manual. Prentice-Hall, Englewood Cliffs, 1988.

    Google Scholar 

  9. INMOS. Transputer Reference Manual. Prentice-Hall, Englewood Cliffs, 1988.

    Google Scholar 

  10. H. Mühlenbein, M. Gorges-Schleuter, and O. Krämer. New solutions to the mapping problem of parallel systems: the evolution approach. Parallel Computing, 4:269–279, 1987.

    Article  Google Scholar 

  11. Perihelion. The Helios Operating System. Prentice-Hall, Englewood Cliffs, 1989.

    Google Scholar 

  12. H. Shen. Self-adjusting mapping: a heuristic mapping algorithm for mapping parallel programs onto transputer networks. In J. Wexler, editor, Developing Transputer Applications, IOS, Amsterdam, 1988.

    Google Scholar 

  13. TNT — PFY Reference Manual. TNT — Parallel Computing Support, Bern, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Informatics and Applied Mathematics, University of Berne, Länggassstrasse 51, CH-3012, Berne

    Jacques E. Boillat & Peter G. Kropf

Authors
  1. Jacques E. Boillat
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Peter G. Kropf
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Helmar Burkhart

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Boillat, J.E., Kropf, P.G. (1990). A fast distributed mapping algorithm. In: Burkhart, H. (eds) CONPAR 90 — VAPP IV. VAPP CONPAR 1990 1990. Lecture Notes in Computer Science, vol 457. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53065-7_119

Download citation

  • DOI: https://doi.org/10.1007/3-540-53065-7_119

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53065-7

  • Online ISBN: 978-3-540-46597-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation