On Parallelization of Static Scheduling

@inproceedings{WuDepartment1997OnPO,
  title={On Parallelization of Static Scheduling},
  author={AlgorithmsMin-You WuDepartment},
  year={1997}
}
  • AlgorithmsMin-You WuDepartment
  • Published 1997
| Most static scheduling algorithms that schedule parallel programs represented by directed acyclic graphs (DAGs) are sequential. This paper discusses the essential issues of par-allelization of static scheduling and presents two eecient parallel scheduling algorithms. The proposed algorithms have been implemented on an Intel Paragon machine, and their performance has been evaluated. These algorithms produce high-quality scheduling and are much faster than existing sequential and parallel… CONTINUE READING