Multilevel k-way partitioning scheme for irregular graphs
Journal of Parallel and Distributed Computing
The grid: blueprint for a new computing infrastructure
The grid: blueprint for a new computing infrastructure
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
SIAM Journal on Scientific Computing
Optimal task allocation in distributed systems by graph matching and state space search
Journal of Systems and Software
A new heuristic for the process-processor mapping problem
Distributed and parallel systems
Graph partitioning models for parallel computing
Parallel Computing - Special issue on graph partioning and parallel computing
Tabu Search
A taxonomy and survey of grid resource management systems for distributed computing
Software—Practice & Experience
Mesh Partitioning: A Multilevel Balancing and Refinement Algorithm
SIAM Journal on Scientific Computing
Graph Partitioning for Parallel Applications in Heterogeneous Grid Environments
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Adaptive Computing on the Grid Using AppLeS
IEEE Transactions on Parallel and Distributed Systems
Clustering and reassignment-based mapping strategy for message-passing architectures
Journal of Systems Architecture: the EUROMICRO Journal
A Heuristic Algorithm for Mapping Communicating Tasks on Heterogeneous Resources
HCW '00 Proceedings of the 9th Heterogeneous Computing Workshop
A linear-time heuristic for improving network partitions
DAC '82 Proceedings of the 19th Design Automation Conference
On the development of a communication-aware task mapping technique
Journal of Systems Architecture: the EUROMICRO Journal
Branch-and-bound task allocation with task clustering-based pruning
Journal of Parallel and Distributed Computing
Task assignment in heterogeneous computing systems
Journal of Parallel and Distributed Computing
IEEE Transactions on Computers
Journal of Parallel and Distributed Computing
Hi-index | 0.00 |
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.