Dynamic partitioning of loop iterations on heterogeneous PC clusters
Author(s) -
ChaoTung Yang,
WenChung Shih,
ShianShyong Tseng
Publication year - 2007
Publication title -
the journal of supercomputing
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.445
H-Index - 61
eISSN - 1573-0484
pISSN - 0920-8542
DOI - 10.1007/s11227-007-0146-0
Subject(s) - computer science , testbed , distributed computing , loop (graph theory) , cluster (spacecraft) , parallel computing , scheduling (production processes) , loop tiling , computer cluster , operating system , compiler , mathematical optimization , computer network , mathematics , combinatorics
Loop partitioning on parallel and distributed systems has been a critical problem. Furthermore, it becomes more difficult to deal with on the emerging heterogeneous PC cluster environments. In the past, some loop self-scheduling schemes have been proposed to be applicable to heterogeneous cluster environments. In this paper, we propose a performance-based approach, which partitions loop iterations according to the performance ratio of cluster nodes. To verify the proposed approach, a heterogeneous cluster is built, and three types of application programs are implemented to be executed in this testbed. Experimental results show that the proposed approach performs better than traditional schemes.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom