DocumentCode
2370650
Title
An efficient parallel scheduling algorithm
Author
Wu, Min-You
Author_Institution
Dept. of Comput. Sci., State Univ. of New York, Buffalo, NY, USA
fYear
1996
fDate
23-26 Oct 1996
Firstpage
258
Lastpage
261
Abstract
Most static scheduling algorithms that schedule parallel programs represented by directed acyclic graphs (DAGs) are sequential. This paper discusses the essential issues on parallelization of static scheduling algorithms. An efficient parallel scheduling algorithm, the HPMCP algorithm, is proposed. It produces high-quality scheduling and is much faster than existing algorithms
Keywords
computational complexity; directed graphs; parallel algorithms; parallel programming; processor scheduling; HPMCP algorithm; directed acyclic graphs; parallel programs scheduling; parallel scheduling algorithm; static scheduling algorithms; Algorithm design and analysis; Computer science; Concurrent computing; Delay effects; Joining processes; NP-complete problem; Processor scheduling; Scalability; Scheduling algorithm;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel and Distributed Processing, 1996., Eighth IEEE Symposium on
Conference_Location
New Orleans, LA
Print_ISBN
0-8186-7683-3
Type
conf
DOI
10.1109/SPDP.1996.570342
Filename
570342
Link To Document