Load balancing by changing the graph connectivity on heterogeneous clusters

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Munasinghe, K., & Wait, R. (2005). Load balancing by changing the graph connectivity on heterogeneous clusters. In Lecture Notes in Computer Science (Vol. 3470, pp. 1040–1047). Springer Verlag. https://doi.org/10.1007/11508380_106

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free