TY - JOUR
T1 - A multilevel partitioning approach for efficient tasks allocation in heterogeneous distributed systems
AU - Arafeh, Bassel
AU - Day, Khalid
AU - Touzene, Abderezak
N1 - Funding Information:
We gratefully acknowledge the support provided by Sultan Qaboos University through the internal research Grant No. IG/SCI/COMP/04/02 in facilitating and encouraging an environment conducive to research and academic excellence in the Sultanate of Oman.
PY - 2008/5
Y1 - 2008/5
N2 - This work addresses the problem of allocating parallel application tasks to heterogeneous distributed computing resources, such as multiclusters or Grid environments. The proposed allocation scheme is based on a multilevel graph partitioning and mapping approach. The objective is to find an efficient allocation that minimizes the application completion time, subject to the specified constraints pertinent to the application and system environment. The allocation scheme consists of three phases; the clustering phase, the initial mapping phase and the refinement and remapping phase. The scheme introduces an efficient heuristic in the clustering phase for contracting (coarsening) large size application graphs to the number of processors, called the VHEM method. An initial mapping technique based on a tabu-search approach has been introduced as a basis for the process of refinement and remapping phase. The simulation study shows that the VHEM coarsening heuristic can achieve optimal or near-optimal communication, compared to the HEM method, when the ratio of the number of tasks to the number of processors exceeds a threshold value. The simulation study shows that those optimal or near-optimal VHEM-coarsened graphs have an effect of generating very efficient mappings, when they are compared to the HEM-coarsened graphs.
AB - This work addresses the problem of allocating parallel application tasks to heterogeneous distributed computing resources, such as multiclusters or Grid environments. The proposed allocation scheme is based on a multilevel graph partitioning and mapping approach. The objective is to find an efficient allocation that minimizes the application completion time, subject to the specified constraints pertinent to the application and system environment. The allocation scheme consists of three phases; the clustering phase, the initial mapping phase and the refinement and remapping phase. The scheme introduces an efficient heuristic in the clustering phase for contracting (coarsening) large size application graphs to the number of processors, called the VHEM method. An initial mapping technique based on a tabu-search approach has been introduced as a basis for the process of refinement and remapping phase. The simulation study shows that the VHEM coarsening heuristic can achieve optimal or near-optimal communication, compared to the HEM method, when the ratio of the number of tasks to the number of processors exceeds a threshold value. The simulation study shows that those optimal or near-optimal VHEM-coarsened graphs have an effect of generating very efficient mappings, when they are compared to the HEM-coarsened graphs.
KW - Heterogeneous computing systems
KW - Mapping problem
KW - Multilevel graph partitioning
KW - Task allocation/assignment
UR - http://www.scopus.com/inward/record.url?scp=43649091365&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=43649091365&partnerID=8YFLogxK
U2 - 10.1016/j.sysarc.2007.10.001
DO - 10.1016/j.sysarc.2007.10.001
M3 - Article
AN - SCOPUS:43649091365
SN - 1383-7621
VL - 54
SP - 530
EP - 548
JO - Journal of Systems Architecture
JF - Journal of Systems Architecture
IS - 5
ER -