On parallelizing the multiprocessor scheduling problem

IEEE Transactions on Parallel and Distributed Systems

Volumn 10, Issue 4, 1999, Pages 414-432

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

^a IEEE   (Hong Kong)

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

^c UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

PROCESSOR ALLOCATION; RESOURCE MANAGEMENT; TASK GRAPHS;

GRAPH THEORY; HEURISTIC METHODS; PARALLEL ALGORITHMS; RESOURCE ALLOCATION; SCHEDULING;

PARALLEL PROCESSING SYSTEMS;

EID: 0032665048     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.762819     Document Type: Article

References (29)

1. T.L. Adam, K.M. Chandy, and J. Dickson, "A Comparison of List Scheduling for Parallel Processing Systems," Comm. ACM, vol. 17, pp. 685-690, Dec. 1974.
2. I. Ahmad and Y.-K. Kwok, "On Exploiting Task Duplication in Parallel Program Scheduling," IEEE Trans. Parallel and Distributed Systems, vol. 9, no. 9, pp. 872-892, Sept. 1998.
3. H.H. Ali and H. El-Rewini, "The Time Complexity of Scheduling Interval Orders with Communication is Polynomial," Parallel Processing Letters, vol. 3, no. 1, pp. 53-58, 1993.
4. J. Baxter and J.H. Patel, "The LAST Algorithm: A Heuristic-Based Static Task Allocation Algorithm," Proc. 1989 Int'l Conf. Parallel Processing, vol. II, pp. 217-222, Aug. 1989.
5. T.L. Casavant and J.G. Kuhl, "A Taxonomy of Scheduling in General-Purpose Distributed Computing Systems," IEEE Trans. Software Eng., vol. 14, no. 2, pp. 141-154, Feb. 1988.
6. Y.C. Chung and S. Ranka, "Application and Performance Analysis of A Compile-Time Optimization Approach for List Scheduling Algorithms on Distributed-Memory Multiprocessors," Proc. Supercomputing '92, pp. 512-521, Nov. 1992.
7. H. Chen, B. Shirazi, and J. Marquis, "Performance Evaluation of A Novel Scheduling Method: Linear Clustering with Task Duplication," Proc. Int'l Conf. Parallel and Distributed Systems, pp. 270-275, Dec. 1993.
8. J.Y. Colin and P. Chretienne, "C.P.M. Scheduling with Small Computation Delays and Task Duplication," Operations Research, pp. 680-684, 1991.
9. I. De Falco, R. Del Balio, and E. Tarantino, "An Analysis of Parallel Heuristics for Task Allocation in Multicomputers," Computing: Archiv für Informatik und Numerik, vol. 59, no. 3 pp. 259-275, 1997.
10. 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.
11. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company 1979.
12. 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.
13. S.J. Kim and J.C. Browne, "A General Approach to Mapping of Parallel Computation upon Multiprocessor Architectures," Proceedings of the 1988 International Conference on Parallel Processing, vol. II, pp. 1-8, Aug. 1988.
14. D. Kim and E.G. Yi, "A Two-Pass Scheduling Algorithm for Parallel Programs," Parallel Computing, vol. 20, pp. 869-885, 1994.
15. B. Kruatrachue and T.G. Lewis, "Grain Size Determination for Parallel Processing," IEEE Software, pp. 23-32, Jan. 1988.
16. Y.-K. Kwok and I. Ahmad, "Dynamic Critical-Path Scheduling: An Effective Technique for Allocating Task Graphs onto Multiprocessors" IEEE Trans. Parallel and Distributed Systems, vol. 7, no. 5, pp. 506-521, May 1996.
17. Y.-K. Kwok and I. Ahmad, "Efficient Scheduling of Arbitrary Task Graphs to Multiprocessors Using A Parallel Genetic Algorithm," J. Parallel and Distributed Computing, vol. 47, no. 1, pp. 58-77, Nov. 1997.
18. 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.
19. C. McCreary and H. Gill, "Automatic Determination of Grain Size of Efficient Parallel Processing," Comm. ACM, vol. 32, no. 9 pp. 1,073-1,078, Sept. 1989.
20. N. Mehdiratta and K. Ghose, "A Bottom-Up Approach to Task Scheduling on Distributed Memory Multiprocessor," Proc. 1994 Int'l Conf. Parallel Processing, vol. II, pp. 151-154, Aug. 1994.
21. M.A. Palis, J.-C. Lieu, and D.S.L. Wei, "Task Clustering and Scheduling for Distributed Memory Parallel Architectures," IEEE Trans. Parallel and Distributed Systems, vol. 7, no. 1, pp. 46-55, Jan. 1996.
22. C.H. Papadimitriou and M. Yannakakis, "Towards An Architecture-Independent Analysis of Parallel Algorithms," SIAM J. Computing, vol. 19, no. 2, pp. 322-328, Apr. 1990.
23. I. Pramanick and J.G. Kuhl, "An Inherently Parallel Method for Heuristic Problem-Solving: Part I - General Framework," IEEE Trans. Parallel and Distributed Systems, vol. 6, no. 10, pp. 1,006-1,015, Oct. 1995.
24. C.V. Ramamoorthy, K.M. Chandy, and M.J. Gonzalez, "Optimal Scheduling Strategies in a Multiprocessor System," "IEEE Trans. Computers," vol. 21, pp. 137-146, Feb. 1972.
25. V. Sarkar, Partitioning and Scheduling Parallel Programs for Multiprocessors. Cambridge, Mass.: MIT Press, 1989.
26. 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.
27. 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-87, Feb. 1993.
28. 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.
29. T. Yang and A. Gerasoulis, "DSC: Scheduling Parallel Tasks on An Unbounded Number of Processors," IEEE Transactions on Parallel and Distributed Systems, vol. 5, no. 9, pp. 951-967, Sept. 1994.