Using On-line Job Monitoring for Dynamic Load Balancing of Parallel Applications.
Bettina Schnor, Stefan Petri · 1999
While the significance of the communication costs for the performance of parallel applications is well known, these costs are hardly considered in the known resource management systems for workstation clusters. In this paper we present the Cluster Search Algorithm (CSA) for dynamic remapping of parallel applications in clusters. The novelty of our approach is that the communication behavior of the application does not have to be known a priori. The decisions are made dynamically at run time according to the actually observed communication behavior of the application and available resources. We present first simulation results and an overview over an actual implementation. Keywords: Dynamic load balancing; Communication cost sensitive remapping; Process migration; 1 Introduction With the rising performance of desktop-class computers, clusters of workstations become increasingly attractive as cheap yet powerful platforms for resource intensive parallel and distributed applications, es...