A heuristic algorithm for mapping parallel applications on computational grids

Phinjaroenphan, P, Bevinakoppa, S and Zeephongsekul, P 2005, 'A heuristic algorithm for mapping parallel applications on computational grids', Lecture Notes in Computer Science, vol. 3470, pp. 1086-1096.


Document type: Journal Article
Collection: Journal Articles

Title A heuristic algorithm for mapping parallel applications on computational grids
Author(s) Phinjaroenphan, P
Bevinakoppa, S
Zeephongsekul, P
Year 2005
Journal name Lecture Notes in Computer Science
Volume number 3470
Start page 1086
End page 1096
Total pages 10
Publisher Springer
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.
Subject Stochastic Analysis and Modelling
Keyword(s) parallel tasks
grid computing
DOI - identifier 10.1007/11508380_111
Copyright notice © Springer-Verlag Berlin Heidelberg 2005
ISSN 0302-9743
Versions
Version Filter Type
Citation counts: Scopus Citation Count Cited 7 times in Scopus Article | Citations
Altmetric details:
Access Statistics: 231 Abstract Views  -  Detailed Statistics
Created: Wed, 18 Feb 2009, 09:53:18 EST by Catalyst Administrator
© 2014 RMIT Research Repository • Powered by Fez SoftwareContact us