Skip to Main content Skip to Navigation
Conference papers

Efficient Critical Task Scheduling Parallel Programs on a Bounded Number of Processors

Abstract : In this paper, we present an efffficient algorithm for compile time scheduling of parallel programs on a bounded num ber of processors system with distributed memory. Our algorithm (CTS Critical Task Scheduling) is a greedy list scheduling heuristics based on attribute priority called Task Criticalness wich provides a good measure of the task im portance. CTS has a time complexity of O(ep + v log v) which is better than all the others scheduling algorithms to our knowledge. Experimental results also demonstrate the superiority of CTS over the other algorithms in terms of speed and solution quality.
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00082769
Contributor : Mourad Hakem <>
Submitted on : Wednesday, June 28, 2006 - 4:16:57 PM
Last modification on : Saturday, February 15, 2020 - 2:06:27 AM

Identifiers

  • HAL Id : hal-00082769, version 1

Collections

Citation

Mourad Hakem, Franck Butelle. Efficient Critical Task Scheduling Parallel Programs on a Bounded Number of Processors. International Conference on Parallel and Distributed Computing Systems, 2005, Phoenix, United States. pp.139-144. ⟨hal-00082769⟩

Share

Metrics

Record views

249