From nobody Tue Oct 31 14:05 EST 1995 Date: Tue, 31 Oct 1995 14:00:59 -0500 (EST) From: uid no body To: techreps@cs.buffalo.edu Subject: techrep: POST request Content-Type: text Content-Length: 436 ContactPerson: wu@cs.buffalo.edu Remote host: ruby.cs.buffalo.edu Remote ident: wu ### Begin Citation ### Do not delete this line ### %R 95-49A %U trans.ps %A Wu, Min-You %T On Parallelization of Static Scheduling Algorithms %D October 31, 1995 %I Department of Computer Science, SUNY Buffalo %K Static scheduling, parallelization, scheduling quality, complexity, speedup %X 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.