A Preliminary Evaluation of the Critical Path Method for Scheduling Tasks on Multiprocessor Systems

The problem of scheduling tasks on a system of independent identical processors is discussed and the performance of a suboptimal method is evaluated. The computation is modeled by an acyclic directed graph G(T,<), where node set T represents the set of tasks to be completed and edge set < defines the precedence between tasks. The objective is to minimize the finishing time of the computation graph. Known theoretical results are reviewed and a general branch-and-bound algorithm for finding optimal solutions is presented. The schedules produced by a simple critical path priority method are shown to be near optimal for randomly generated computation graphs.

[1]  Eduardo B. Fernández,et al.  Bounds on the Number of Processors and Time for Multiprocessor Optimal Schedules , 1973, IEEE Transactions on Computers.

[2]  Edward G. Coffman,et al.  Optimal Preemptive Scheduling on Two-Processor Systems , 1969, IEEE Transactions on Computers.

[3]  C. V. Ramamoorthy,et al.  Optimal Scheduling Strategies in a Multiprocessor System , 1972, IEEE Transactions on Computers.

[4]  Kenneth Steiglitz,et al.  Characterization and Theoretical Comparison of Branch-and-Bound Algorithms for Permutation Problems , 1974, JACM.

[5]  Ronald L. Graham,et al.  Bounds on scheduling with limited resources , 1973, SOSP '73.

[6]  Jeffrey D. Ullman,et al.  Polynomial complete scheduling problems , 1973, SOSP '73.

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

[8]  Edward K. Bowdon.  Priority Assignment in a Network of Computers , 1969, IEEE Transactions on Computers.

[9]  Jean-Loup Baer,et al.  A Survey of Some Theoretical Aspects of Multiprocessing , 1973, CSUR.

[10]  Glenn K. Manacher,et al.  Production and Stabilization of Real-Time Task Schedules , 1967, JACM.

[11]  Linus Schrage,et al.  Solving Resource-Constrained Network Problems by Implicit Enumeration - Nonpreemptive Case , 1970, Oper. Res..

[12]  K. Mani Chandy,et al.  A comparison of list schedules for parallel processing systems , 1974, Commun. ACM.

[13]  M. T. Kaufman,et al.  An Almost-Optimal Algorithm for the Assembly Line Scheduling Problem , 1974, IEEE Transactions on Computers.

[14]  Peter J. Denning,et al.  A note on sub-expression ordering in the execution of arithmetic expressions , 1973, CACM.

[15]  Ronald L. Graham,et al.  Bounds for certain multiprocessing anomalies , 1966 .

[16]  Ronald L. Graham,et al.  Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.

[17]  Edward G. Coffman,et al.  Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems , 1970, JACM.

[18]  Kenneth Steiglitz,et al.  Exact, Approximate, and Guaranteed Accuracy Algorithms for the Flow-Shop Problem n/2/F/ F , 1975, JACM.