loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 8
Dynamic Critical Path Scheduling Parallel Programs onto Multiprocessors
Denver, Colorado
April 04-April 08
ISBN: 0-7695-2312-9
ASCII Text
x 
 
Mourad Hakem, Franck Butelle, "Dynamic Critical Path Scheduling Parallel Programs onto Multiprocessors," Parallel and Distributed Processing Symposium, International, vol. 9, pp. 203b, 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 8, 2005.
 
 
BibTex
x
 
@article{ 10.1109/IPDPS.2005.175,
author = {Mourad Hakem and Franck Butelle},
title = {Dynamic Critical Path Scheduling Parallel Programs onto Multiprocessors},
journal ={Parallel and Distributed Processing Symposium, International},
volume = {9},
year = {2005},
issn = {1530-2075},
pages = {203b},
doi = {http://doi.ieeecomputersociety.org/10.1109/IPDPS.2005.175},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Parallel and Distributed Processing Symposium, International
TI - Dynamic Critical Path Scheduling Parallel Programs onto Multiprocessors
SN - 1530-2075
SP
EP
A1 - Mourad Hakem,
A1 - Franck Butelle,
PY - 2005
KW - scheduling
KW - clustering
KW - distributed computing
KW - precedence task graphs
KW - directed acyclic graphs DAGs
KW - parallel scheduling
VL - 9
JA - Parallel and Distributed Processing Symposium, International
ER -
 
Mourad Hakem, LIPN, France
Franck Butelle, LIPN, France
In this paper we present an efficient algorithm for compile-time scheduling and clustering of parallel programs onto parallel processing systems with distributed memory, which is called The Dynamic Critical Path Scheduling DCPS. The DCPS is superior to several other algorithms from the literature in terms of computational complexity, processors consumption and solution quality. DCPS has a time complexity of O(e + v log v), as opposed to DSC algorithm O((e + v) log v) which is the best known algorithm.
Index Terms:
scheduling, clustering, distributed computing, precedence task graphs, directed acyclic graphs DAGs, parallel scheduling
Citation:
Mourad Hakem, Franck Butelle, "Dynamic Critical Path Scheduling Parallel Programs onto Multiprocessors," ipdps, vol. 9, pp.203b, 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 8, 2005
Usage of this product signifies your acceptance of the Terms of Use.