Dynamic Critical Path Scheduling Parallel Programs onto Multiprocessors

Author

Hakem, Mourad ; Butelle, Franck

Author_Institution

LIPN, CNRS, Villetaneuse, France

fYear

2005

fDate

04-08 April 2005

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.

Keywords

computational complexity; directed graphs; multiprocessing programs; parallel programming; processor scheduling; compile-time scheduling; computational complexity; directed acyclic graphs; distributed computing; distributed memory; dynamic critical path scheduling; parallel processing; precedence task graph; processors consumption; Clustering algorithms; Computational complexity; Concurrent computing; Cost function; Distributed computing; Dynamic scheduling; Multiprocessing systems; Parallel processing; Processor scheduling; Scheduling algorithm; clustering; directed acyclic graphs DAGs; distributed computing; parallel scheduling; precedence task graphs; scheduling;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel and Distributed Processing Symposium, 2005. Proceedings. 19th IEEE International

Print_ISBN

0-7695-2312-9

Type

conf

DOI

10.1109/IPDPS.2005.175

Filename

1420102