A dynamic partitioning self-scheduling scheme for parallel loops on heterogeneous clusters

Authors:
Chao-Tung Yang;Wen-Chung Shih;Shian-Shyong Tseng
Affiliations:
High-Performance Computing Laboratory, Department of Computer Science and Information Engineering, Tunghai University, Taichung, Taiwan, R.O.C.;Department of Computer and Information Science, National Chiao Tung University, Hsinchu, Taiwan, R.O.C.;Department of Computer and Information Science, National Chiao Tung University, Hsinchu, Taiwan, R.O.C.
Venue:
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part I
Year:
2006

Citing 3
Cited 2

Guided self-scheduling: A practical scheduling scheme for parallel supercomputers

IEEE Transactions on Computers
Cluster computing: the commodity supercomputer

Software—Practice & Experience
A Class of Loop Self-Scheduling for Heterogeneous Clusters

CLUSTER '01 Proceedings of the 3rd IEEE International Conference on Cluster Computing

Metropolitan-scale grid environment: the implementation and applications of TIGER grid

ISPA'06 Proceedings of the 2006 international conference on Frontiers of High Performance Computing and Networking
Using analytical models to load balancing in a heterogeneous network of computers

PaCT'07 Proceedings of the 9th international conference on Parallel Computing Technologies

Quantified Score

Hi-index	0.00

Visualization

Abstract

Loop partitioning on parallel and distributed systems has been an important problem. Furthermore, it becomes more difficult to deal with on the emerging heterogeneous PC cluster environments. In this paper, we propose a performance-based scheme, which dynamically partitions loop iterations according to the performance ratio of cluster nodes. To verify our approach, a heterogeneous cluster is built, and two kinds of application programs are implemented to be executed in this testbed. Experimental results show that our approach performs better than traditional schemes.