On exploiting task duplication in parallel program scheduling

IEEE Transactions on Parallel and Distributed Systems

Volumn 9, Issue 9, 1998, Pages 872-892

  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

Algorithms; Distributed systems; Duplication based scheduling; Multiprocessors; Parallel scheduling; Task graphs

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; GRAPH THEORY; MULTIPROCESSING SYSTEMS; OPTIMIZATION; PARALLEL ALGORITHMS; SCHEDULING;

PARALLEL SCHEDULING;

PARALLEL PROCESSING SYSTEMS;

EID: 0032166239     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.722221     Document Type: Article

References (24)

1. A. Al-Maasarani, "Priority-Based Scheduling and Evaluation of Precedence Graphs With Communication Times," MS thesis, King Fahd Univ. of Petroleum and Minerals, Saudi Arabia, 1993.
2. M.A. Al-Mouhamed, "Lower Bound on the Number of Processors and Time for Scheduling Precedence Graphs With Communication Costs," IEEE Trans. Software Eng., vol. 16, no. 12, pp. 1,390-1,401, Dec. 1990.
3. 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 '92, pp. 683-691, Nov. 1992.
4. 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.
5. J.Y. Colin and P. Chretienne, "C.P.M. Scheduling With Small Computation Delays and Task Duplication," Operations Research, pp. 680-684, 1991.
6. M.R. Garey and D.S. Johnson, Computers and Intractability, A Guide to the Theory of NP-Completeness. W.H. Freeman and Co., 1979.
7. A. Gerasoulis and T. Yang, "A Comparison of Clustering Heuristics for Scheduling DAGs on Multiprocessors," J. Parallel and Distributed Computing, vol. 16, no. 4, pp. 276-291, Dec. 1992.
8. 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.
9. 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.
10. 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.
11. H. Kasahara and S. Narita, "Practical Multiprocessor Scheduling Algorithms for Efficient Parallel Processing," IEEE Trans. Computers, vol. 33, no. 11, pp. 1,023-1,029, Nov. 1984.
12. B. Kruatrachue and T.G. Lewis, "Grain Size Determination for Parallel Processing," IEEE Software, pp. 23-32, Jan. 1988.
13. 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.
14. T.G. Lewis and H. El-Rewini, Introduction to Parallel Computing. New York: Prentice Hall, 1992.
15. 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.
16. 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.
17. C. Papadimitriou and M. Yannakakis, "Toward an Architecture Independent Analysis of Parallel Algorithms," SIAM J. Computing, vol. 19, pp. 322-328, 1990.
18. C.D. Polychronopoulos and D.J. Kuck, "Guided Self-Scheduling: A Practical Scheduling Scheme for Parallel Supercomputers," IEEE Trans. Computers, vol. 36, no. 12, pp. 1,425-1,439, Dec. 1987.
19. 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.
20. B. Shirazi, H. Chen, and J. Marquis, "Comparative Study of Task Duplication Static Scheduling versus Clustering and Non-Clustering Techniques," Concurrency: Practice and Experience, vol. 7, no. 5, pp. 371-390, Aug. 1995.
21. B. Shirazi, M. Wang, and G. Pathak, "Analysis and Evaluation of Heuristic Methods for Static Scheduling," J. Parallel and Distributed Computing, vol. 10, pp. 222-232, 1990.
22. 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.
23. 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.
24. 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, pp. 951-967, Sept. 1994.