Benchmarking and Comparison of the Task Graph Scheduling Algorithms

Journal of Parallel and Distributed Computing

Volumn 59, Issue 3, 1999, Pages 381-422

  Kwok, Yu Kwong ^a   Ahmad, Ishfaq ^b  

^a UNIVERSITY OF HONG KONG   (Hong Kong)

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

Author keywords

Performance evaluation; benchmarks; multiprocessors; parallel processing; scheduling; task graphs; scalability

Indexed keywords

EID: 0001514167     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1006/jpdc.1999.1578     Document Type: Article

References (44)

1. Adam T. L., Chandy K. M., Dickson J. A comparison of list scheduling for parallel processing systems. Comm. ACM. 17:Dec. 1974;685-690.
2. Ahmad I., Kwok Y. K. On exploiting task duplication in parallel program scheduling. IEEE Trans. Parallel Distrib. Systems. 9:Sept. 1998;872-892.
3. Ahmad I., Kwok Y. K. On parallelizing the multiprocessor scheduling problem. IEEE Trans. Parallel Distrib. Systems. 11:Apr. 1999;414-432.
4. Ahmad I., Kwok Y. K. Optimal and near-optimal allocation of precedence-constrained task to parallel processors: Defying the high complexity using effective search technique. Proc. 1998 Int'l Conf. Parallel Processing. Aug. 1998;. p. 424-431.
5. Ahmad I., Kwok Y. K., Wu M.-Y., Shu W. Automatic parallelization and scheduling of programs on multiprocessors using CASH. Proc. 1997 Int'l Conf. Parallel Processing. Aug. 1997;. p. 288-291.
6. Ali H. H., El-Rewini H. The time complexity of scheduling interval orders with communication is polynomial. Parallel Process. Lett. 3:1993;53-58.
7. Al-Maasarani A. Priority-Based Scheduling and Evaluation of Precedence Graphs with Communication Times. 1993;King Fahd University of Petroleum and Minerals.
8. Al-Mouhamed M. A. Lower bound on the number of processors and time for scheduling precedence graphs with communication costs. IEEE Trans. Software Eng. 16:Dec. 1990;1390-1401.
9. Baxter J., Patel J. H. The LAST algorithm: A heuristic-based static task allocation algorithm. Proc. 1998 Int'l Conf. Parallel Processing. Aug. 1989;. p. 217-222.
10. Casavant T. L., Kuhl J. G. A taxonomy of scheduling in general-purpose distributed computing systems. IEEE Trans. Software Eng. 14:Feb. 1988;141-154.
11. Chen H., Shirazi B., Marquis J. Performance evaluation of a novel scheduling method: Linear clustering with task duplication. Proc. Int'l Conf. Parallel and Distributed Systems. Dec. 1993;. p. 270-275.
12. Chung Y. C., Ranka S. Application and performance analysis of a compile-time optimization approach for list scheduling algorithms on distributed-memory multiprocessors. Proc. Supercomputing '92. Nov. 1992;. p. 512-521.
13. Coffman E. G., Graham R. L. Optimal scheduling for two-processor systems. Acta Inform. 1:1972;200-213.
14. Colin J. Y., Chretienne P. C.P.M. scheduling with small computation delays and task duplication. Oper. Res. 39:July-Aug. 1991;680-684.
15. Cosnard M., Loi M. Automatic task graph generation techniques. Parallel Process. Lett. 5:Dec. 1995;527-538.
16. El-Rewini H., Lewis T. G. Scheduling parallel programs onto arbitrary target machines. J. Parallel Distrib. Comput. 9:June 1990;138-153.
17. Fernadez E. B., Bussell B. Bounds on the number of processors and time for multiprocessor optimal schedules. IEEE Trans. Comput. C-22:Aug. 1973;745-751.
18. Garey M. R., Johnson D. S. Computers and Intractability: A Guide to the Theory of NP-Completeness. 1979;Freeman, San Francisco.
19. Gerasoulis A., Yang T. A comparison of clustering heuristics for scheduling DAGs on multiprocessors. J. Parallel Distrib. Comput. 16:Dec. 1992;276-291.
20. Hu T. C. Parallel sequencing and assembly line problems. Oper. Res. 19:Nov. 1961;841-848.
21. Hwang J. J., Chow Y. C., Anger F. D., Lee C. Y. Scheduling precedence graphs in systems with interprocessor communication times. SIAM J. Comput. 18:Apr. 1989;244-257.
22. Hwang K., Xu Z. Scalable Parallel Computing: Technology, Architecture, Programming. 1998;McGraw-Hill, New York.
23. Hwang K., Xu Z., Arakawa M. Benchmark evaluation of the IBM SP2 for parallel signal processing. IEEE Trans. Parallel Distrib. Systems. 7:May 1996;522-536.
24. Kasahara H., Narita S. Practical multiprocessor scheduling algorithms for efficient parallel processing. IEEE Trans. Comput. C-33:Nov. 1984;1023-1029.
25. Khan A. A., McCreary C. L., Jones M. S. A comparison of multiprocessor scheduling heuristic. Proc. 1994 Int'l Conf. Parallel Processing. Aug. 1994;. p. 243-250.
26. Kim S. J., Browne J. C. A general approach to mapping of parallel computation upon multiprocessor architectures. Proc. 1988 Int'l Conf. Parallel Processing. Aug. 1988;. p. 1-8.
27. Kruatrachue B., Lewis T. G. Duplication scheduling heuristic (DSH): A new precedence task scheduler for parallel processor systems. Technical Report. 1987.
28. Kwok Y. K., Ahmad I. Dynamic critical-path scheduling: An effective technique for allocating task graphs to multiprocessors. IEEE Trans. Parallel Distrib. Systems. 7:May 1996;506-521.
29. Kwok Y. K., Ahmad I. Efficient scheduling of arbitrary task graphs to multiprocessors using a parallel genetic algorithm. J. Parallel Distrib. Comput. 47:Nov. 1997;58-77.
30. McCreary C., Gill H. Automatic determination of grain size for efficient parallel processing. Comm. ACM. 32:Sept. 1989;1073-1078.
31. Mehdiratta N., Ghose K. A bottom-up approach to task scheduling on distibuted memory multiprocessor. Proc. 1994 Int'l Conf. Parallel Processing. Aug. 1994;. p. 151-154.
32. Palis M. A., Liou J.-C., Wei D. S. L. Task clustering and scheduling for distributed memory parallel architectures. IEEE Trans. Parallel Distrib. Systems. 7:Jan. 1996;46-55.
33. Papadimitriou C. H., Yannakakis M. Scheduling interval-ordered tasks. SIAM J. Comput. 8:Aug. 1979;405-409.
34. Papadimitriou C. H., Yannakakis M. Towards an architecture-independent analysis of parallel algorithms. SIAM J. Comput. 19:Apr. 1990;322-328.
35. Park G. -L., Shirazi B., Marquis J. DFRN: A new approach for duplication based scheduling for distributed memory multiprocessor systems. Proc. 11th Int'l Parallel Processing Symposium. Apr. 1997;. p. 157-166.
36. Ramamoorthy C. V., Chandy K. M., Gonzalez M. J. Optimal scheduling strategies in a multiprocessor system. IEEE Trans. Comput. C-21:Feb. 1972;137-146.
37. Sarkar V. Partitioning and Scheduling Parallel Programs for Multiprocessors. 1989;MIT Press, Cambridge.
38. Shirazi B., Chen H., Marquis J. Comparative study of task duplication static scheduling versus clustering and non-clustering techniques. Concurrency: Practice and Experience. 7:Aug. 1995;371-390.
39. Shirazi R., Wang M., Pathak G. Analysis and evalutation of heuristic methods for static scheduling. J. Parallel Distrib. Comput. 10:Nov. 1990;222-232.
40. Sih G. C., Lee E. A. A compile-time scheduling heuristic for interconnection-constrained heterogeneous processor architectures. IEEE Trans. Parallel Distrib. Systems. 4:Feb. 1993;75-87.
41. Ullman J. NP-complete scheduling problems. J. Comput. System Sci. 10:1975;384-393.
42. Wu M.-Y., Gajski D. D. Hypercool: a programming aid for message-passing systems. IEEE Trans. Parallel Distrib. Systems. 1:July 1990;330-343.
43. Yang T., Gerasoulis A. List scheduling with and without communication delays. Parallel Comput. 19:1993;1321-1344.
44. Yang T., Gerasoulis A. DSC: Scheduling parallel tasks on an unbounded number of processors. IEEE Trans. Parallel Distrib. Systems. 5:Sept. 1994;951-967.