Skip to main content
SpringerLink
Log in

Heterogeneous Dynamic Load Balancing with a Scheme Based on the Laplacian Polynomial

  • Conference paper
  • First Online:
Parallel Processing and Applied Mathematics (PPAM 2001)

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

  • 507 Accesses

Abstract

The problem of dynamic load balancing was extensively studied in the last decade, mainly in homogeneous systems. Significant progress was achieved in the context of applications based on unstructured meshes. If the problem can be considered reasonably solved in homogeneous environments, this is not the case of the heterogeneous systems. In this paper an improved algorithm is proposed. The algorithm is useful in the context of adaptive parallel applications with irregular communication patterns. Our work has been carried out within a heterogeneous model in which different processing capacities are associated with the processors and different costs with the communication links. Experiments were conducted in a heterogeneous cluster of workstations.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Boillat, J. E.: Load Balancing and Poisson Equation in a Graph. Concurrency: Practice and Experience, 2(4):289–313, 1990.

    Article  Google Scholar 

  2. Diekmann, R., Frommer, A., Monien, B.: Efficient Schemes for Nearest Neighbor Load Balancing. In G. Bilardi et al. (eds.), editor, Proc. European Symp. on Algorithms (ESA’98), volume 1461 of Lecture Notes in Computer Science, pages 429–440. Springer, 1998.

    Google Scholar 

  3. Diekmann, R., Muthukrishnan, S., Nayakkankuppam, M. V.: Engineering Diffusive Load Balancing Algorithms Using Experiments. In G. Bilardi, A. Ferreira, R. Lueling, and J. Rolim, editors, Solving Irregulary Structured Problems in Parallel (IRREGULAR’ 97), volume 1253 of Lecture Notes in Computer Science, pages 111–122. Springer, 1997.

    Chapter  Google Scholar 

  4. Elsässer, R., Monien B., Preis, R.: Diffusive load balancing schemes on heterogeneous networks. In G. Bilardi et al. (eds.), editor, 12th ACM Symposium on Parallel Algorithms and Architectures (SPAA), Vol. 1461, pages 30–38, 2000.

    Google Scholar 

  5. Hendrickson, B., Devine, K.: Dynamic Load Balancing in Computational Mechanics. Comp. Meth. Applied Mechanics & Engineering. 184(2-4):485–500, 2000.

    Article  MATH  Google Scholar 

  6. Hu, Y. F., Blake, R. J.: Load Balancing for Unstructured Mesh Applications. To appear in Parallel and Distributed Computing Practice.

    Google Scholar 

  7. Hu, Y. F., Blake, R. J.: The Optimal Property of Polynomial Based Diffusion-like Algorithms in Dynamic Load Balancing. In K. D. Papailiou and D. Tsahalis and J. Périaux and D. Knörzer, eds., John Wiley & Son, Computational Dynamics’98, Chichester, 1998.

    Google Scholar 

  8. Hu, Y. F., Blake, R. J.: An Improved Difusion Algorithm for Dynamic Load Balancing. Parallel Computing, 25:417–444, 1999.

    Article  MathSciNet  MATH  Google Scholar 

  9. Hui C.-C., Chanson, S. T.: Hydrodynamic Load Balancing. IEEE Transactions on Parallel and Distributed Systems, volume 10, no. 11, November 1999, 1118–1137.

    Article  Google Scholar 

  10. Jájá, J.: An Introduction to Parallel Algorithms. Addison-Wesley, 1992.

    Google Scholar 

  11. Karypis, G., Kumar., V.: Parallel Multilevel k-Way Partitioning Scheme for Irregular Graphs. Technical Report 96-036, Department of Computer Science and Engineering, University of Minnesota, 1996.

    Google Scholar 

  12. Kelmans, A., Pak, I., Postnikov, A.: Tree and Forest Volumes of Graphs. DIMACS Technical Report, 2000–03, January 2000.

    Google Scholar 

  13. Rotaru, T., Nägeli, H.-H.: The Generalized Diffusion Algorithm. Techn. Rep. RT-2000/06-1, Institut d’Informatique, Université de Neuchâtel, June 2000.

    Google Scholar 

  14. Rotaru, T., Nägeli, H.-H.: Minimal Flow Generated by Heterogeneous Diffusion Schemes. In Interntional Conference On Parallel and Distributed Computing and Systems, Anaheim, USA, August 21–24 2001.

    Google Scholar 

  15. Willebeeck-LeMair, M.H., Reeves, A.P.: Strategies For Dynamic Load Balancing on Highly Parallel Computers. IEEE Transactions on Parallel and Distributed Systems, 4(9):1305–1336, 1993.

    Google Scholar 

  16. C. Xu and F. Lau.: Load Balancing in Parallel Computers Theory and Practice. The Kluwer International Series in Engineering and Computer Science. Kluwer Academic Publishers, 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut of Computer Science, University of de Neuchâtel, Émile-Argand 11, CH-2007, Neuchâtel, Switzerland

    Tiberiu Rotaru & Hans-Heinrich Nägeli

Authors
  1. Tiberiu Rotaru
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hans-Heinrich Nägeli
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Mathematics and Computer Science, Technical University of Czestochowa, Dabrowskiego 73, 42-200, Czestochowa, Poland

    Roman Wyrzykowski

  2. Computer Science Department, University of Tennessee, 122 Volunteer Blvd, Knoxville, TN, 37996-3450, USA

    Jack Dongarra

  3. Computer Science Department, Oklahoma State University, 700 N. Greenwood Ave., Tulsa, OK, 74106, USA

    Marcin Paprzycki

  4. DTU, UNI-C, Danish Computing Centre for Research and Education, Bldg. 304, 2800, Lyngby, Denmark

    Jerzy Waśniewski

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rotaru, T., Nägeli, HH. (2002). Heterogeneous Dynamic Load Balancing with a Scheme Based on the Laplacian Polynomial. In: Wyrzykowski, R., Dongarra, J., Paprzycki, M., Waśniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2001. Lecture Notes in Computer Science, vol 2328. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48086-2_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-48086-2_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43792-5

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation