DocumentCode
1558242
Title
On parallelization of static scheduling algorithms
Author
Wu, Min-You ; Shu, Wei
Author_Institution
Dept. of Electr. & Comput. Eng., Central Florida Univ., Orlando, FL, USA
Volume
23
Issue
8
fYear
1997
fDate
8/1/1997 12:00:00 AM
Firstpage
517
Lastpage
528
Abstract
Most static algorithms that schedule parallel programs represented by macro dataflow graphs are sequential. This paper discusses the essential issues pertaining to parallelization of static scheduling and presents two efficient parallel scheduling algorithms. The proposed algorithms have been implemented on an Intel Paragon machine and their performances have been evaluated. These algorithms produce high-quality scheduling and are much faster than existing sequential and parallel algorithms
Keywords
data flow graphs; parallel algorithms; parallel programming; processor scheduling; software performance evaluation; Intel Paragon machine; algorithm parallelization; macro dataflow graphs; modified critical-path algorithm; parallel program scheduling; parallel scheduling algorithms; performance evaluation; static scheduling algorithms; Computational efficiency; Concurrent computing; Costs; NP-complete problem; Parallel algorithms; Performance evaluation; Processor scheduling; Scalability; Scheduling algorithm;
fLanguage
English
Journal_Title
Software Engineering, IEEE Transactions on
Publisher
ieee
ISSN
0098-5589
Type
jour
DOI
10.1109/32.624307
Filename
624307
Link To Document