Advertisement

Load Balancing by Changing the Graph Connectivity on Heterogeneous Clusters

  • Kalyani Munasinghe
  • Richard Wait
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3470)

Abstract

This paper examines the problem of adapting parallel applications on a cluster of workstations. The cluster is assumed to be a heterogeneous, multi-user computing environment so that efficient load balancing within the application must take external factors into account. At any time the users of the network are competing for resources. Performance of a particular processor, as a component in the parallel (message passing) computation, depends on both static factors, such as the processor hardware, and dynamic factors, such as the system load and the activities of other users. For each processor, the external factors can be condensed into a single parameter, the load index, which is a normalised measure of the current spare capacity of the processor available to the application.

Numerical experiments show the efficiency of the load balancing strategies on a finite element application with a domain decomposition and the effect on overall computation time.

Keywords

Load Balance Graph Connectivity Parallel Application Load Imbalance Processor Speed 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
  2. 2.
  3. 3.
    Bevilacqua, A.: A dynamic load balancing method on a heterogeneous cluster of workstations. Informatica 23(1), 49–56 (1999)Google Scholar
  4. 4.
    Cybenko, G.: Dynamic load balancing for distributed memory multiprocessors. Parallel and Distributed Computing 7, 279–301 (1989)CrossRefGoogle Scholar
  5. 5.
    Lan, Z., Taylor, V.E.: Dynamic load balancing of SAMR applications on distributed systems. Scientific Programming 10(21), 319–328 (2002)Google Scholar
  6. 6.
    Lee, C.K., Hamdi, M.: Parallel image processing application on a network of distributed workstations. Parallel Computing 26, 137–160 (1995)CrossRefGoogle Scholar
  7. 7.
    Lin, J., Saletore, V.A.: Self scheduling on distributed memory machines. SuperComputing, 814–823 (1993)Google Scholar
  8. 8.
    Oliker, L., Biswas, R.: Plum: Parallel load balancing for adaptive structured meshes. Parallel and Distributed Computing 52(2), 150–177 (1998)zbMATHCrossRefGoogle Scholar
  9. 9.
    Schloegel, K., Karypis, G., Kumar, V.: Multilevel diffusion schemes for repartitioning of adaptive meshes. Journal of Parallel and Distributed Computing 47(2), 109–124 (1997)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Kalyani Munasinghe
    • 1
    • 2
  • Richard Wait
    • 2
  1. 1.Dept. of Computer ScienceUniversity of RuhunaSri Lanka
  2. 2.Dept. of Information TechnologyUppsala UniversitySweden

Personalised recommendations