loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2003 International Conference on Parallel Processing Workshops (ICPPW'03)
Load Balancing on PC Clusters with the Super-Programming Model
Kaohsiung, Taiwan
October 06-October 09
ISBN: 0-7695-2018-9
Dejiang Jin, New Jersey Institute of Technology
Sotirios G. Ziavras, New Jersey Institute of Technology
Recent work in high-performance computing has shifted attention to PC cluster. For PC-clusters, member nodes are independent computers connected by general-purpose networks. The latency of data communications is long and load balancing among the nodes becomes a critical issue. We introduce a new model for program development on PC clusters, namely the Super-Programming Model (SPM) to address this issue. In SPM PC clusters are modeled as a single virtual machine with PC as their processing units. The workload is modeled as a collection of Super-Instructions (SIs). Each SIs can achieve a limited workload. Application programs are coded using SIs. SIs are dynamically assigned to available PC at run time. For limited workload, no SIs overloads any PC. Therefore, dynamic load balancing becomes an easier task. We apply SPM to mining association rules. Our experiments show that under normal conditions the workload is balanced very well. A performance model is also developed to describe the scalable behavior of SPM.
Citation:
Dejiang Jin, Sotirios G. Ziavras, "Load Balancing on PC Clusters with the Super-Programming Model," icppw, pp.63, 2003 International Conference on Parallel Processing Workshops (ICPPW'03), 2003
Usage of this product signifies your acceptance of the Terms of Use.