Dynamic critical-path scheduling: An effective technique for allocating task graphs to multiprocessors

IEEE Transactions on Parallel and Distributed Systems

Volumn 7, Issue 5, 1996, Pages 506-521

  Kwok, Yu Kwong ^a,b   Ahmad, Ishfaq ^a,b  

^a IEEE

^b HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

Algorithms; Clustering; List scheduling; Multiprocessors; Parallel scheduling; Processor allocation; Task graphs

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CRITICAL PATH ANALYSIS; GRAPH THEORY; SCHEDULING;

DYNAMIC CRITICAL PATH SCHEDULING ALGORITHM; LIST SCHEDULING; PARALLEL SCHEDULING; PROCESSOR ALLOCATION; TASK GRAPH ALLOCATION;

MULTIPROCESSING SYSTEMS;

EID: 0030142084     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.503776     Document Type: Article

References (37)

1. T.L. Adam, K. Chandy and J. Dickson, "A Comparison of List Scheduling for Parallel Processing Systems," Comm. ACM, vol. 17, no. 12, pp.685-690, Dec. 1974.
2. V.A.F. Almeida, I.M. Vasconcelos, J.N.C. Arabe and D.A. Menasce, "Using Random Task Graphs to Investigate the Potential Benefits of Heterogeneity in Parallel Systems," Proc. Supercomputing, pp. 683-691, 1992.
3. M.A. Al-Mouhamed, "Lower Bound on the Number of Processors and Time for Scheduling Precedence Graphs with Communication Costs," IEEE Trans. Software Engineering, vol. 16, no. 12, pp. 1,390-1,401, 1990.
4. F.D. Anger, J.J. Hwang, and Y.C. Chow, "Scheduling with Sufficient Loosely Coupled Processors," J. Parallel and Distributed Computing, vol. 9, pp. 87-92, 1990.
5. A.F. Bashir, V. Susarla, and K. Vairavan, "A Statistical Study of the Performance of a Task Scheduling Algorithm," IEEE Trans. Computers, vol. 32, no. 12, pp. 774-777, Dec. 1975.
6. S. Bokhari, "A Shortest Tree Algorithm for Optimal Assignments Across Space and Time in Distributed Processor Systems," IEEE Trans. Software Engineering, vol. 7, no. 6, Nov. 1981.
7. J. Bruno, E.G. Coffman, and R. Sethi, "Scheduling Independent Tasks to Reduce Mean Finishing Time," Comm. ACM, vol. 17, no. 7, pp. 382-387, July 1974.
8. V. Chaudhary and J.K. Aggarwal, "A Generalized Scheme for Mapping Parallel Algorithms," IEEE Trans. Parallel and Distributed Systems, vol. 4, no. 3, pp. 328-346, Mar. 1993.
9. E.G. Coffman, Computer and Job-Shop Scheduling Theory. New York: Wiley, 1976.
10. M. Cosnard, M. Marrakchi, Y. Robert, and D. Trystram, "Parallel Gaussian Elimination on an MIMD Computer," Parallel Computing, vol. 6, pp. 275-296, 1988.
11. E.B. Fernadez and B. Bussell, "Bounds on the Number of Processors and Time for Multiprocessor Optimal Schedules," ICEE Trans. Computers, vol. 22, no. 8, pp. 745-751, Aug. 1973.
12. M.R. Gary and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Co., 1979.
13. A. Gerasoulis and T. Yang, "A Comparison of Clustering Heuristics for Scheduling DAG's on Multiprocessors," J. Parallel and Distributed Computing, vol. 16, no. 4, pp. 276-291, Dec. 1992.
14. M.J. Gonzalez, 'Deterministic Processor Scheduling," ACM Computing Surveys, vol. 9, no. 3, pp. 173-204, Sept. 1977.
15. R.L. Graham, E.L. Lawler, J.K. Lenstra, and A.H.G. Rinnoy Kan, "Optimization and Approximation in Deterministic Sequencing and Scheduling: A Survey," Annals of Discrete Mathematics, no. 5, pp. 287-326, 1979.
16. 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.
17. D.S. Hochbaum and D.B. Shmoys, "Using Dual Approximation Algorithms for Scheduling Problems: Theoretical and Practical Results," J. ACM, vol. 34, no. 1, pp. 144-162, Jan. 1987.
18. T.C. Hu, "Parallel Sequencing and Assembly Line Problems," Oper. Research, vol. 19, no. 6, pp. 841-848, Nov. 1961.
19. H. Kasahara and S. Narita, "Practical Multiprocessor Scheduling Algorithms for Efficient Parallel Processing," IEEE Trans. on Computers, vol. 33, no. 11, pp. 1,023-1,029, Nov. 1984.
20. S.J. Kim and J.C. Browne, "A General Approach to Mapping of Parallel Computation upon Multiprocesor Architectures," Proc. Int'l Conf. Parallel Processing, pp. 1-8, 1988.
21. W.H. Kohler and K. Steiglitz, "Characterization and Theoretical Comparison of Branch-and-Bound Algorithms for Permutation Problems," J. ACM, vol. 21, no. 1, pp. 140-156, Jan. 1974.
22. W.H. Kohler, "A Preliminary Evaluation of the Critical Path Method for Scheduling Tasks on MultiProcessor Systems," IEEE Trans. Computers, vol. 24, no. 12, pp. 1,235-1,238, Dec. 1975.
23. B. Lee, A.R. Hurson, and T.Y. Feng, "A Vertically Layered Allocation Scheme for Data Flow Systems,'' J. Parallel and Distributed Computing, vol. 11, pp. 175-187, 1991.
24. S.Y. Lee and J.K. Aggarvval, "A Mapping Strategy for Parallel Processing," IEEE Trans. Computer, vol. 36, no. 4, pp. 433-442, Apr. 1987.
25. T.G. Lewis and H. El-Rewini, Introduction to Parallel Computing, New York: Prentice Hall, 1992.
26. R.E. Lord, J.S. Kowalik, and S.P. Kumar, "Solving Linear Algebraic Equations on an MIMD Computer," J. ACM, vol. 30, no. 1, pp. 103-117, Jan. 1983.
27. C. McCreary and H. Gill, "Automatic Determination of Grain Size for Efficient Parallel Processing," Comm. ACM, vol. 32, pp. 1,073-1,078, Sept. 1989.
28. J.M. Ortega, Introduction to Parallel and Vector Solution of Linear Systems, New York: Plenum, 1988.
29. C. Papadimitriou and M. Yannakakis, "Toward an Architecture Independent Analysis of Parallel Algorithms," SIAM J. Computing, vol. 19, pp. 322-328, 1990.
30. C.V. Ramamoorthy, K.M. Chandy, and M.J. Gonzalez, "Optimal Scheduling Strategies in a Multiprocessor System," IEEE Trans. Computers, vol. 21, no. 2, pp. 137-146, Feb. 1972.
31. H. El-Rewini and T.G. Lewis, "Scheduling Parallel Programs onto Arbitrary Target Machines," J. Parallel and Distributed Computing, vol. 9, no. 2, pp. 138-153, June 1990.
32. V. Sarkar, Partitioning and Scheduling Parallel Programs for Multiprocessors, Cambridge, Mass: MIT Press, 1989.
33. R. Sethi, "Scheduling Graphs on Two Processors," SIAM J. Computing, vol. 5, no.1, pp. 73-82, Mar. 1976.
34. B. Shirazi, M. Wang, and G. Pathak, "Analysis and Evaluation of Heuristic Methods for Static Scheduling," J. Parallel and Distributed Computing, no. 10, pp. 222-232, 1990.
35. 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. 75-187, Feb. 1993.
36. T. Yang and A. Gerasoulis, "DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors," IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 9, Sept. 1994.
37. M.Y. Wu and D.D. Gajski, "Hypertool: A Programming Aid for Message-Passing Systems," IEEE Trans. Parallel and Distributed Systems, vol. 1, no. 3, pp. 330-343, July 1990.