Load Balancing by Changing the Graph Connectivity on Heterogeneous Clusters
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.
KeywordsLoad Balance Graph Connectivity Parallel Application Load Imbalance Processor Speed
Unable to display preview. Download preview PDF.
- 3.Bevilacqua, A.: A dynamic load balancing method on a heterogeneous cluster of workstations. Informatica 23(1), 49–56 (1999)Google Scholar
- 5.Lan, Z., Taylor, V.E.: Dynamic load balancing of SAMR applications on distributed systems. Scientific Programming 10(21), 319–328 (2002)Google Scholar
- 7.Lin, J., Saletore, V.A.: Self scheduling on distributed memory machines. SuperComputing, 814–823 (1993)Google Scholar