A Numerical Comparative Analysis of Partitioning Heuristics for Scheduling Tak Graphs on Multiprocessors

Many algorithms for scheduling DAGs on multiprocessors have been proposed, but there has been little work done to determine their effectiveness. Since multiprocessor scheduling is an NP-hard problem, no exact tractable algorithm exists, and no baseline is available from which to compare the resulting schedules. Furthermore, performance guarantees have been found for only a few simple DAGs. This paper is an attempt to quantify the differences in a few of the heuristics. New classification criteria are defined for the DAGs, and the differences between the heuristics are noted for various criteria. The comparison is made between a graph based method, and two critical path methods. The empirical performance of the three heuristics is compared when they are applied to the randomly generated DAGs.

[1]  Hesham El-Rewini,et al.  Scheduling Parallel Program Tasks onto Arbitrary Target Machines , 1990, J. Parallel Distributed Comput..

[2]  Frank D. Anger,et al.  Scheduling with Sufficient Loosely Coupled Processors , 1990, J. Parallel Distributed Comput..

[3]  Edward G. Coffman,et al.  Computer and job-shop scheduling theory , 1976 .

[4]  Daniel Gajski,et al.  Hypertool: A Programming Aid for Message-Passing Systems , 1990, IEEE Trans. Parallel Distributed Syst..

[5]  Jing-Jang Hwang,et al.  Multiprocessor scheduling with interprocessor communication delays , 1988 .

[6]  T. C. Hu.  Parallel Sequencing and Assembly Line Problems , 1961 .

[7]  M. Cosnard,et al.  Clustering Task Graphs for Message Passing Architectures , 1990 .

[8]  Zhen Liu,et al.  A Note on Graham's Bound , 1990, Inf. Process. Lett..

[9]  James C. Browne,et al.  General approach to mapping of parallel computations upon multiprocessor architectures , 1988 .

[10]  Carolyn McCreary,et al.  Efficient Exploitation of Concurrency Using Graph Decomposition , 1990, ICPP.

[11]  Wang Ho Yu,et al.  Lu decomposition on a multiprocessing system with communications delay , 1984 .

[12]  Tzong-Jer Yang,et al.  A comparison of clustering heuristics for scheduling dags on multiprocessors , 1990 .

[13]  Carolyn McCreary,et al.  Automatic determination of grain size for efficient parallel processing , 1989, CSC '89.

[14]  Frank D. Anger,et al.  Scheduling Precedence Graphs in Systems with Interprocessor Communication Times , 1989, SIAM J. Comput..

[15]  Vivek Sarkar,et al.  Partitioning and scheduling parallel programs for execution on multiprocessors , 1987 .

[16]  J. J. Thompson,et al.  Partitioning and Scheduling Using Graph Decomposition , 1993 .

[17]  Boontee Kruatrachue,et al.  Grain size determination for parallel processing , 1988, IEEE Software.

[18]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .