Parallelization of scheduling algorithms
Min‐You Wu, Wei Shu · 2002
Most static scheduling algorithms that schedule parallel programs represented by directed acyclic graphs (DAGs) are sequential. Parallelization of scheduling algorithms is a new research area. This paper discusses the essential issues of parallel static scheduling and presents an efficient parallel scheduling algorithm, the HPMCP algorithm. The proposed algorithm has been implemented on an Intel Paragon machine. It produces high-quality scheduling and is much faster than existing sequential and parallel algorithms.