A heuristic algorithm for mapping parallel applications on computational grids

Authors:
Panu Phinjaroenphan;Savitri Bevinakoppa;Panlop Zeephongsekul
Affiliations:
School of Computer Science and Information Technology, RMIT University, Melbourne, Australia;School of Computer Science and Information Technology, RMIT University, Melbourne, Australia;School of Mathematical and Geospatial Sciences, RMIT University, Melbourne, Australia
Venue:
EGC'05 Proceedings of the 2005 European conference on Advances in Grid Computing
Year:
2005

Citing 8
Cited 2

Static scheduling algorithms for allocating directed task graphs to multiprocessors

ACM Computing Surveys (CSUR)
A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems

Journal of Parallel and Distributed Computing
Graph Partitioning for Parallel Applications in Heterogeneous Grid Environments

IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Design and Evaluation of a Resource Selection Framework for Grid Applications

HPDC '02 Proceedings of the 11th IEEE International Symposium on High Performance Distributed Computing
The Anatomy of the Grid: Enabling Scalable Virtual Organizations

International Journal of High Performance Computing Applications
On the Mapping Problem

IEEE Transactions on Computers
NP-complete scheduling problems

Journal of Computer and System Sciences
A method for estimating the execution time of a parallel task on a grid node

EGC'05 Proceedings of the 2005 European conference on Advances in Grid Computing

Process Mapping for MPI Collective Communications

Euro-Par '09 Proceedings of the 15th International Euro-Par Conference on Parallel Processing
Graph partitioning algorithms for optimizing software deployment in mobile cloud computing

Future Generation Computer Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The mapping problem has been studied extensively. However, algorithms which were designed to map a parallel application on a computational grid, such as MiniMax, FastMap and genetic algorithms have shortcomings. In this paper, a new algorithm, Quick-quality Map (QM), is presented. Experimental results show that QM performs better than the other algorithms. For instance, QM can map a 10000-task parallel application on a testbed of 2992 nodes in 6.35 seconds, and gives the lowest execution time whereas MiniMax and a genetic algorithm, respectively, take approximately 1700 and 660 seconds, but produce 1.34 and 6.60 times greater execution times than QM's.