This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On Parallelization of Static Scheduling Algorithms
August 1997 (vol. 23 no. 8)
pp. 517-528

Abstract—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 Intel Paragon machine and their performances have been evaluated. These algorithms produce high-quality scheduling and are much faster than existing sequential and parallel algorithms.

[1] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness.New York: W.H. Freeman, 1979.
[2] V. Sarkar,Partitioning and Scheduling Parallel Programs for Execution on Multiprocessors.Cambridge, Mass.: MIT Press, 1989.
[3] M.Y. Wu and D.D. Gajski,"Hypertool: A programming aid for message-passing systems," IEEE Transactions on Parallel and Distributed Systems, vol. 1, no. 3, pp. 330-343, July 1990.
[4] H.E. Rewini and T.G. Lewis,"Scheduling parallel program tasks onto arbitrary target machines," J. Parallel and Distributed Computing, vol. 9, pp. 138-153, 1990.
[5] T. Yang and A. Gerasoulis, “DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors,” IEEE Trans. Parallel and Distributed Systems, vol. 5, pp. 951-967, 1994.
[6] G.C. Sih and E.A. Lee, “A Compile-Time Scheduling Heuristic for Interconnection-Constrained Heterogeneous Processor Architectures,” IEEE Trans. Parallel and Distributed Systems, vol. 4, no. 2, pp. 175-186, Feb. 1993.
[7] Y.-C. Chung and S. Ranka,"Applications and performance analysis of a compile-time optimization approach for list scheduling algorithms on distributed memory multiprocessors," Proc. Supercomputing '92, pp. 512-521, 1992.
[8] A. Khan, C. McCreary, and M. Jones, "A Comparison of Multiprocessor Scheduling Heuristics," Proc. Int'l Conf. Parallel Processing, vol. 2, pp. 243-250, Aug. 1994.
[9] T.C. Hu, "Parallel Sequencing and Assembly Line Problems," Operations Research, vol. 9, no. 6, pp. 841-848, 1961.
[10] T.L. Adam, K.M. Chandy, and J.R. Dickson, “A Comparison of List Schedules for Parallel Processing Systems,” Comm. ACM, vol. 17, no. 12, pp. 685-690, Dec. 1974.
[11] B. Kruatrachue and T. Lewis,"Grain size determination for parallel processing," IEEE Software, pp. 23-32, Jan. 1988.
[12] H. El-Rewini, T.G. Lewis, and H.H. Ali, Task Scheduling in Parallel and Distributed Systems. Prentice Hall, 1994.
[13] B. Kruatrachue,“Static taskscheduling and grain packing in parallel processing systems,”Ph.D. dissertation, Comput. Sci. Dep., Oregon State Univ., 1987.
[14] J.J. Hwang,Y.C. Chow,F.D. Anger, and C.Y. Lee,"Scheduling precedence graphs in systems with interprocessor communication times," SIAM J. Computing, vol. 18, no. 2, pp. 244-257, Apr. 1989.
[15] J. Baxter and J.H. Patel, "The LAST Algorithm: A Heuristics-Based Static Task Allocation Algorithm," Proc. Int'l Conf. Parallel Processing, vol. 2, pp. 217-222, Aug. 1989.
[16] I. Ahmad, Y. Kwok, and M. Wu, "Performance Comparison of Algorithms for Static Scheduling of DAGs to Multiprocessors," Second Australasian Conf. Parallel and Real-time Systems, Sept. 1995.
[17] I. Ahmad and Y.K. Kwok, "A Parallel Approach for Multiprocessor Scheduling," Proc. Int'l Parallel Processing Symp., pp. 289-293, Apr. 1995.

Index Terms:
Static scheduling, parallel scheduling algorithm, macro dataflow graph, modified critical-path algorithm.
Citation:
Min-You Wu, Wei Shu, "On Parallelization of Static Scheduling Algorithms," IEEE Transactions on Software Engineering, vol. 23, no. 8, pp. 517-528, Aug. 1997, doi:10.1109/32.624307
Usage of this product signifies your acceptance of the Terms of Use.