Applications and performance analysis of a compile-time optimization approach for list scheduling algorithms on distributed memory multiprocessors

Proceedings of the International Conference on Supercomputing

Volumn Part F129723, Issue , 1992, Pages 512-521

  Chung, Yeh Ching ^a   Ranka, Sanjay ^b  

^a FENG CHIA UNIVERSITY   (Taiwan)

^b SYRACUSE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DIRECTED GRAPHS; MEMORY ARCHITECTURE; MULTIPROCESSING SYSTEMS; MULTITASKING; OPTIMIZATION; SCHEDULING;

DIRECTED ACYCLIC GRAPHS; DISTRIBUTED-MEMORY MULTIPROCESSORS; EXTENSIVE SIMULATIONS; LIST SCHEDULING ALGORITHMS; OPTIMIZATION ALGORITHMS; PERFORMANCE ANALYSIS; RESOURCE UTILIZATIONS; SINGLE PROGRAM MULTIPLE DATA;

SCHEDULING ALGORITHMS;

EID: 85014168050     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/superc.1992.236653     Document Type: Conference Paper

References (33)

1. M. A. Al-Mouhamed, "Lower Bound on the Number of Processors and Time for Scheduling Precedence Graphs with Communication Costs", IEEE Transactions on Software Engineering, Vol. 16, No. 12, pp. 1390-1401, 1990.
2. F. D. Anger, J. J. Hwang, and Y. C. Chow, "Scheduling with Sufficient Loosely Coupled Processors", Journal of Parallel and Distributed Computing, Vol. 9, pp. 87-92, 1990.
3. J. Baxter and J. H. Patel, "The LAST Algorithm: A Heuristic-Based Static Task Allocation Algorithm", ICPP, Vol. 2, pp. 217-222, 1989.
4. V. Chaudhary and J. K. Aggarwal, "Generalized Mapping of Parallel Algorithms onto Parallel Architectures", ICPP, Vol. 2, pp. 137-141, 1990.
5. Y. C. Chung and S. Ranka, "An Optimization Approach for Static Scheduling of Directed-Acyclic Graphs on Distributed Memory Multiprocessors", International Conference on Parallel Processing, 1992 and CIS Technical Report, Syracuse University, 1992.
6. H. El-Rewini and T. G. Lewis, "Scheduling Parallel Program Tasks onto Arbitrary Target Machines", Journal of Parallel and Distributed Computing, Vol. 9, pp. 138-153, 1990.
7. R. Gupta and M. L. Soffa, "Region Scheduling: An Approach for Detecting and Redistributing Parallelism", IEEE Transactions on Software Engineering, Vol. 16, No. 4, pp. 421-431, 1990.
8. J. J. Hwang et al, "Scheduling Precedence Graphs in Systems with Interprocessor Communication Times", SIAM Journal of Computing, Vol. 18, pp. 244-257, 1989.
9. H. Jung, L. Kirousis, and P. Spirakis, "Lower Bounds abd Efficient Algorithms for Multiprocessor Scheduling of DAGs with Communication Delay", Proceedings of the ACM Symposiums of Parallel Algorithms and Architectures, pp. 254-264, 1989.
10. S. J. Kim and J. C. Browne, "A General Approach to Mapping of Parallel Computations upon Multiprocessor Architectures", ICPP, pp 1-8, 1988.
11. B. Kruatrachue, Static Task Scheduling and Grain Packing in Parallel Processing Systems, PhD dissertation, Electrical and Computer Engineering Department, Oregon State University, Corvallis, 1987.
12. B. Lee, A. R. Hurson, and T. Y. Feng, "A Vertically Layered Allocation Scheme for Data Flow Systems", Journal of Parallel and Distributed Computing, Vol. 11, pp. 175-187, 1991.
13. C. Y. Lee et al, "Multiprocessor Scheduling with Interprocessor Communication Delays", Operations Research Utters, Vol. 7, pp. 141-147, 1988.
14. K. J. Lin, J. Y. Chung, and J. Liu, "Scheduling Real-Time Computations on Hypercubes with Load Balancing", The Fifth Conference of Distributed Memory Multiprocessors, pp. 975-983, 1990.
15. S. Manohara and P. Thanisch, "Assigning Dependency Graphs onto Processor Networks", Parallel Computing, Vol. 17, pp. 63-73, 1991.
16. C. H. Papadimitriou and J. D. Ullman, "A Communication-Time Tradeoff", SIAM Journal of Computing, Vol. 14, No. 4, pp. 639-646, 1987.
17. C. H. Papadimitriou and M. Yannakakis, "Towards an Architecture-Independent Analysis of Parallel Algorithms", SIAM Journal of Computing, Vol. 19, pp. 322-328, 1990.
18. K. Ramamritham, J. A. Stankovic, and P. F. Shiah, "Efficient Scheduling Algorithms for Real-Time Multiprocessor Systems", IEEE Transactions on Parallel and Distributed Systems, Vol. 1, No. 2, pp. 184-194, 1990.
19. G. C. Sih and E. A. Lee, "Scheduling to Account for Interprocessor Communication within Interconnection-Constrained Processor Networks", ICPP, Vol. 1, pp. 9-16, 1990.
20. H. S. Stone, "Multiprocessor Scheduling with the Aid of Network Flow Algorithms", IEEE Transactions on Software Engineering, Vol. 3, No. 1, pp. 85-93, 1977.
21. 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, 1990.
22. T. L. Adam, K. M. Chandy, and J. R. Dickson, "A Comparisonof List Schedules for Parallel Processing Systems", Communication of ACM, Vol. 17, No. 12, pp. 685-690, 1974.
23. E. G. Coffman Jr., Computer and Job-Shop Scheduling Theory. New York: Wiley, 1976.
24. D. K. Friesen, "Tighter Bound for LPT Scheduling on Uniform Processors", SIAM Journal of Computing, Vol. 16, No. 3, pp. 554-560, 1987.
25. R. L. Graham, "Bounds on Multiprocessor Timing Anomalies", SIAM Journal of Applied Mathematics, Vol. 17, No. 2, pp. 416-429, 1969.
26. M. Granski, I. Koren, and G. M. Silberman, "The Effect of Operation Scheduling on the Performance of a Data Flo w Computer", IEEE Transactions on Computers, Vol. 36, No. 9, pp. 1019-1029, 1987.
27. D. S. Hochbaum and D. B. Shmoys, "A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach", SIAM Journal of Computing, Vol. 17, No. 3, pp. 539-551, 1988.
28. T. C. Hu, "Parallel Sequencing and Assembly Line Problems", Operations Research, pp. 841-848, 1961.
29. H. Kasahara and S. Narita, "Practical Multiprocessor Scheduling Algorithms for Efficient Parallel Processing", IEEE Transactions on Computers, Vol. 33, No. 11, pp. 1023-1029, 1984.
30. J. Y. T. Leung and G. H. Young, "Minimizing Schedule Length Subject to Minimum Flow Time", SIAM Journal of Computing, Vol. 18, No. 2, pp. 314-326, 1989.
31. B. Shirazi and M. Wang, "Analysis and Evaluation of Heuristic Methods for Static Task Scheduling." Journal of Parallel and Distributed Computing, Vol. 10, pp. 222-232, 1990.
32. B. B. Simons and M. K. Warmuth, "A Fast Algorithm for Multiprocessor Scheduling of Unit-Time Jobs", SIAM Journal of Computing, Vol. 18, No. 4, pp. 690-710, 1989.
33. M. R. Garey and D. S. Johnson, Computers and Intractability - A Guide to the Theory of NP-Completeness, W. H. Freeman, New York, 1979.