Most static scheduling algorithms that schedule parallel programs
represented by directed acyclic graphs (DAGs) are sequential.
This paper discusses the essential issues of parallelization
of static scheduling and presents two efficient 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 algorithms.