Runtime parallel incremental scheduling of DAGs

Proceedings of the International Conference on Parallel Processing

Volumn 2000-January, Issue , 2000, Pages 541-548

  Wu, Min You ^a   Shu, Wei ^a   Chen, Yong ^b  

^a UNIVERSITY OF NEW MEXICO   (United States)

^b SEAGATE TECHNOLOGY   (United States)

Author keywords

Dynamic scheduling; Heuristic algorithms; Load management; Parallel algorithms; Parallel processing; Partitioning algorithms; Processor scheduling; Runtime; Scheduling algorithm; Workstations

Indexed keywords

ALGORITHMS; COMPUTER WORKSTATIONS; ELECTRIC LOAD MANAGEMENT; HEURISTIC ALGORITHMS; PARALLEL ALGORITHMS; SCHEDULING ALGORITHMS;

DYNAMIC SCHEDULING; PARALLEL PROCESSING; PARTITIONING ALGORITHMS; PROCESSOR SCHEDULING; RUNTIMES;

SCHEDULING;

EID: 84949512427     PISSN: 01903918     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPP.2000.876171     Document Type: Conference Paper

References (14)

1. I. Ahmad, Y. Kwok, and M. Y. Wu. Performance comparison of algorithms for static scheduling of DAGs to multiprocessors. In Second Australasian Conference on Parallel and Real-time Systems, pages 185-192, Sept. 1995.
2. M. Cosnard and E. Jeannnot. Compact DAG representation and its dynamic scheduling. Journal of Parallel and Distributed Computing, 58(3):487-514, 1999.
3. M. Cosnard, E. Jeannnot, and L. Rougeot. Low memory cost dynamic scheduling of large coarse grain task graphs. In International Parallel Processing Symposium, Apr. 1998.
4. D. L. Eager, E. D. Lazowska, and J. Zahorjan. Adaptive load sharing in homogeneous distributed systems. IEEE Trans. Software Eng., SE-12(5):662-674, May 1986.
5. M. Gary and D. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, 1979.
6. Y. Kwok and I. Ahmad. Fastest: A practical low-complexity algorithm for compile-time assignment of parallel programs to multiprocessors. IEEE Trans. Parallel and Distributed System, 10(2):147-159, Feb. 1999.
7. V. Sarkar. Partitioning and Scheduling Parallel Programs for Multiprocessors. The MIT Press, 1989.
8. J. Shen and J. A. McCammon. Molecular dynamics simulation of superoxide interacting with superoxide dismutase. Chemical Physics, 158:191-198, 1991.
9. W. Shu and M. Y. Wu. Runtime Incremental Parallel Scheduling (RIPS) on distributed memory computers. IEEE Trans. Parallel and Distributed System, 7(6):637-649, June 1996.
10. R. V. Hanxleden and K. Kennedy. Relaxing SIMD control flow constraints using loop transformations. Technical Report CRPC-TR92207, Center for Research on Parallel Computation, Rice University, Apr. 1992.
11. M. Y. Wu. Parallel incremental scheduling. Parallel Processing Letters, 5(4):659-670, Dec. 1995.
12. M. Y. Wu and D. D. Gajski. Hypertool: A programming aid for message-passing systems. IEEE Trans. Parallel and Distributed Systems, 1(3):330-343, July 1990.
13. M. Y. Wu and W. Shu. On parallelization of static scheduling algorithms. IEEE Transactions on Software Engineering, 23(8):517-528, Aug. 1997.
14. T. Yang and A. Gerasoulis. DSC: Scheduling parallel tasks on an unbounded number of processors. IEEE Trans. Parallel and Distributed System, 5(9):951-967, Sept. 1994.