Skip to main content
SpringerLink
Log in

Dynamo — A portable tool for dynamic load balancing on distributed memory multicomputers

  • Conference paper
  • First Online:
Book cover Parallel Processing: CONPAR 92—VAPP V (VAPP 1992, CONPAR 1992)

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

Abstract

Dynamic load balancing is an important technique when developing applications with unpredictable load distribution on distributed memory multicomputers. A tool, Dynamo, that can be used to utilize dynamic load balancing is presented. This tool separates the application from the load balancer and thus makes it possible to easily exchange the load balancer of a given application and experiment with different load balancing strategies.

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. Eriksson. Parallel global optimization using interval analysis. Technical Report UMINF-91.17, Inst. of Information Proc, University of Umeå, S-901 87 UMEÅ, 1991.

    Google Scholar 

  2. M. R. Garey and D. S. Johnson. Computers and Intractability: A guide to the theory of NP-Completeness. Freeman New York, 1979.

    Google Scholar 

  3. G. A. Geist, M. T. Heath, B. E. Peyton, and P. H. Worley. PICL — A Portable Instrumented Communication Library. Oak Ridge Nat. Lab., Oak Ridge, TN 37831, 1990.

    Google Scholar 

  4. R. V. Hanxleden and L. R. Scott. Load balancing on message passing architectures. Journal of Parallel and Distributed Computing, 13:312–324, 1991.

    Google Scholar 

  5. M. T. Heath and J. A. Etheridge. Visualizing performance of parallel programs. Technical Report ORNL/TM-11813, Oak Ridge Nat. Lab., Oak Ridge, TN, May 1991.

    Google Scholar 

  6. J. M. Jansen and F. W. Sijstermans. Parallel branch-and-bound. Future Generation Computer Systems, 4:271–279, 1989.

    Google Scholar 

  7. T-H. Lai and S. Sahni. Anomalies in parallel branch-and-bound algortithms. Comm. ACM, 27:594–602.

    Google Scholar 

  8. J. Lin and J. A. Storer. Processor-efficient hypercube algorithms for the knapsack problem. Journal of Parallel and Distributed Computing, 11:332–337, 1991.

    Google Scholar 

  9. S. Martello and P. Toth. Knapsack Problems: Algorithms and computer implementations. John Wiley & Sons, 1990.

    Google Scholar 

  10. E. Tärnvik. A parallel branch-and-bound algorithm for the 0–1 knapsack problem, (in preparation), University of Umeå, 1992.

    Google Scholar 

  11. Erik Tärnvik. Dynamo — a portable dynamic load balancing tool. Technical report, University of Umeå, 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Information Processing, Department of Computing Science, University of Umeå, S-901 87, Umeå, Sweden

    Erik Tärnvik

Authors
  1. Erik Tärnvik
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Luc Bougé Michel Cosnard Yves Robert Denis Trystram

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tärnvik, E. (1992). Dynamo — A portable tool for dynamic load balancing on distributed memory multicomputers. In: Bougé, L., Cosnard, M., Robert, Y., Trystram, D. (eds) Parallel Processing: CONPAR 92—VAPP V. VAPP CONPAR 1992 1992. Lecture Notes in Computer Science, vol 634. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55895-0_446

Download citation

  • DOI: https://doi.org/10.1007/3-540-55895-0_446

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55895-8

  • Online ISBN: 978-3-540-47306-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation