On parallelization of static scheduling algorithms
Abbreviated Journal Title
IEEE Trans. Softw. Eng.
static scheduling; parallel scheduling algorithm; macro dataflow graph; modified critical-path algorithm; SYSTEMS; Computer Science, Software Engineering; Engineering, Electrical &; Electronic
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 Inter Paragon machine and their performances have been evaluated. These algorithms produce high-quality scheduling and are much faster than existing sequential and parallel algorithms.
Ieee Transactions on Software Engineering
"On parallelization of static scheduling algorithms" (1997). Faculty Bibliography 1990s. 2136.