An improved duplication strategy for scheduling precedence constrained graphs in multiprocessor systems

IEEE Transactions on Parallel and Distributed Systems

Volumn 14, Issue 6, 2003, Pages 533-544

  Bansal, Savina ^b   Kumar, Padam ^a   Singh, Kuldip ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY ROORKEE   (India)

^b GZS College of Engineering and Technology   (India)

Author keywords

Algorithm; Distributed computing; Interconnection network; Multiprocessor scheduling

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CRITICAL PATH ANALYSIS; GRAPH THEORY; HEURISTIC METHODS; INTERCONNECTION NETWORKS; RESOURCE ALLOCATION;

DUPLICATION STRATEGY; MULTIPROCESSOR SCHEDULING; SCHEDULING PRECEDENCE CONSTRAINED GRAPHS;

MULTIPROCESSING SYSTEMS;

EID: 0041848306     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPDS.2003.1206502     Document Type: Article

References (37)

1. T.L. Adam, K.M. Chandy, and J.R. Dickson, "A Comparison of List Scheduling for Parallel Processing Systems," Comm. ACM, vol. 17, no. 12, 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. S. Bansal, P. Kumar, and K. Singh, "A Cost-Effective Scheduling Algorithm for Message Passing Multiprocessor Systems," Proc. 15th Int'l Conf. Parallel and Distributed Computing Systems, pp. 47-52, Sept. 2002.
4. S. Bansal, P. Kumar, and K. Singh, "Duplication Based Scheduling Algorithm for Interconnection Constrained Distributed Memory Machines," Proc. Ninth Int'l Conf. High Performance Computing, Lecture Notes in Computer Science, S. Sahni, V.K. Prasanna, and U. Shukla, eds., vol. 2552, pp. 52-62, Dec. 2002.
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, pp. 512-521, Nov. 1992.
7. E.G. Coffman, Computer and Job-Shop Scheduling Theory. New York: Wiley, 1976.
8. J.Y. Colin and P. Chrétienne, "C.P.M. Scheduling with Small Communication Delays and Task Duplication," Operations Research, pp. 680-684, 1991.
9. S. Darbha and D.P. Agrawal, "Optimal Scheduling Algorithm for Distributed Memory Machines," IEEE Trans. Parallel and Distributed Systems, vol. 9, no. 1, pp. 87-95, Jan. 1998.
10. S. Darbha and D.P. Agrawal, "A Task Duplication Based Scalable Scheduling Algorithm for Distributed Memory Systems," J. Parallel and Distributed Computing, vol. 46, no. 1, pp. 15-27, Oct. 1997.
11. M.D. Dikaiakos, A. Rogers, and K. Steiglitz, "A Comparative Study of Heuristics for Mapping Parallel Algorithms to Message Passing Multiprocessors," technical report, Princeton Univ., 1994.
12. M.R. Garey 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 Directed Acyclic Graphs onto Multiprocessors," J. Parallel and Distributed Computing, vol. 16, no. 4, pp. 276-291, Dec. 1992.
14. 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.
15. S.J. Kim and J.C. Browne, "A General Approach to Mapping of Parallel Computation upon Multiprocessor Architectures," Proc. Int'l Conf. Parallel Processing, vol. 2, p. 1-8, Aug. 1988.
16. Y.K. Kwok and I. Ahmad, "Dynamic Critical-Path Scheduling: An Effective Technique for Allocating Task Graphs to Multiprocessors," IEEE Trans. Parallel and Distributed Systems, vol. 7, no. 5, pp. 506-521, May 1996.
17. Y.K. Kwok and I. Ahmad, "Benchmarking and Comparison of the Task Graph Scheduling Algorithms," J. Parallel and Distributed Computing, vol. 59, no. 3, pp. 381-422, Dec. 1999.
18. Y.K. Kwok, "High Performance Algorithms for Compile Time Scheduling of Parallel Processors," PhD thesis, Hong Kong Univ. of Science and Technology, Hong Kong, May 1997.
19. H. Kasahara and S. Narita, "Practical Multiprocessor Scheduling Algorithms for Efficient Parallel Processing," IEEE Trans. Computers, vol. 33, no. 11, pp. 1023-1029, Nov. 1984.
20. W.H. Kohler, "A Preliminary Evaluation of the Critical Path Method for Scheduling Tasks on Multiprocessor Systems," IEEE Trans. Computers, pp. 1235-1238, Dec. 1975.
21. B. Kruatrachue and T.G. Lewis, "Grain Size Determination for Parallel Processing," IEEE Software, pp. 23-32, Jan. 1988.
22. A. Munier and C. Hanen, "Using Duplication for Scheduling Unitary Tasks on m Processors with Unit Communication Delays," Theoretical Computing Science, 1997.
23. M.A. Palis, J.C. Liou, 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.
24. 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.
25. C.I. Park and T.Y. Choe, "An Optimal Scheduling Algorithm Based on Task Duplication," IEEE Trans. Computers, vol. 51, no. 4, pp. 444-448, Apr. 2002.
26. G.L. Park, B. Shirazi, and J. Marquis, "DFRN: A New Approach for Duplication Based Scheduling for Distributed Memory Multiprocessor Systems," Proc. 11th Int'l Parallel Processing Symp., 157-166, Apr. 1997.
27. A. Radulescu and A.J.C. van Gemund, "Low Cost Task Scheduling for Distributed-Memory Machines," IEEE Trans. Parallel and Distributed Systems, vol. 13, no. 6, pp. 648-658, June 2002.
28. 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.
29. H.El. Rewini, T.G. Lewis, and H.H. Ali, Task Scheduling in Parallel and Distributed Systems. New Jersey: Prentice Hall, 1994.
30. M.W. Schaffter, "Scheduling Jobs with Communication Delays: Complexity Results and Approximation Algorithms," PhD thesis, Technical Univ. of Berlin, Germany, 1996.
31. S. Sevalkumar and C.V. Ramamoorthy, "Scheduling Precedence Constrained Task Graphs with Non-Negligible Inter-Task Communication onto Multiprocessors," IEEE Trans. Parallel Distributed Systems, pp. 328-336, Mar. 1994.
32. B. Shirazi, M. Wang, and G. Pathak, "Analysis and Evaluation of Heuristic Methods for Static Task Scheduling," J. Parallel and Distributed Computing, vol. 10, no. 3, pp. 222-232, 1990.
33. 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.
34. 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.
35. M.Y. Wu, W. Shu, and J. Gu, "Efficient Local Search for DAG Scheduling," IEEE Trans. Parallel and Distributed Systems, vol. 12, no. 6, pp. 617-627, June 2001.
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, pp. 951-967, Sept. 1994.
37. T. Yang, "Scheduling and Code Generation for Parallel Architectures," PhD thesis, Rutgers, Univ., May 1993.