Skip to Main content Skip to Navigation
Journal articles

Critical Path Scheduling Parallel Programs on an Unbounded Number of Processors

Abstract : 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. Experimental results demonstrate the superiority of DCPS over the DSC algorithm.
Document type :
Journal articles
Complete list of metadatas

Cited literature [18 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00082670
Contributor : Franck Butelle <>
Submitted on : Wednesday, June 28, 2006 - 1:52:19 PM
Last modification on : Saturday, February 15, 2020 - 2:07:09 AM
Long-term archiving on: : Monday, April 5, 2010 - 11:31:47 PM

Identifiers

  • HAL Id : hal-00082670, version 1

Collections

Citation

Mourad Hakem, Franck Butelle. Critical Path Scheduling Parallel Programs on an Unbounded Number of Processors. International Journal of Foundations of Computer Science, World Scientific Publishing, 2006, 17, pp.287--301. ⟨hal-00082670⟩

Share

Metrics

Record views

322

Files downloads

997