A new heuristic for scheduling parallel programs on multiprocessor

Parallel Architectures and Compilation Techniques - Conference Proceedings, PACT

Volumn , Issue , 1998, Pages 358-365

  Liou, Jing Chiou ^a   Palis, Michael A ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

C (PROGRAMMING LANGUAGE); HEURISTIC PROGRAMMING; PARALLEL ARCHITECTURES;

BEST-KNOWN ALGORITHMS; CRITICAL PATHS; FINE GRAINS; PARALLEL PROGRAM; REFINEMENT STEP; SOLUTION QUALITY; TASK CLUSTERING; TASK DUPLICATION;

CLUSTERING ALGORITHMS;

EID: 0004511937     PISSN: 1089795X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PACT.1998.727277     Document Type: Conference Paper

References (17)

1. P. Chretienne. Complexity of tree scheduling with interprocessor communication delays. Tech. Report M.A.S.I. 90.5, Universite Pierre et Marie Curie, 1990.
2. Y.-C. Chung and S. Ranka. Applications and performance analysis of a compile-time optimization approach for list scheduling algorithms on distributed memory multiprocessors. In Proc. Supercomputeing '92, pages 512-521, 1992.
3. R. L. Graham, E. L. Lawler, J. K. Lenstra, and A. H. G. Rinnooy Kan. Optimization and approximation in deterministic sequencing and scheduling: A survey Ann. Discrete Math., pp. 287-326, May 1979.
4. J. J. Hwang, Y. C. Chow, F. D. Anger, and C. Y. Lee. Scheduling precedence graphs in systems with interprocessor communication times. SIAM Journal on Computing, 18:2:244-257,April 1989.
5. S. Kim and J. C. Browne. A general approach to mapping of parallel computation upon multiprocessor architectures. Proc. Int. Conf. on Parallel Processing, 3:1-8, 1988.
6. A. W. Kwan, L. Bic, and G. Gajski, "Improving parallel program performance using critical path analysis," Languages andCompilers forParallel Computing (D. Gerlernter, A. Nicolau, and D. P. eds.), Cambridge, MA: The MIT Press, 1990.
7. C. Y. Lee, J. J. Hwang, Y. C. Chow, and F. D. Anger. Multiprocessor scheduling with interprocessor communication delays. Oper. Res. Lett., 7:3:141-147, 1988.
8. J.-C. Liou, M. A. Palis, and D. S. Wei. Performance analysis of task clustering heuristics for scheduling static DAGs on multiprocessor. Parallel Algorithms and Applications, 12:185-203 1997.
9. J.-C. Liou, and M. A. Palis. Grain-Size Optimization of Parallel Programs for Execution onMultiprocessor. Submitted to the IEEE Transactions on Parallel and Distributed Systems .
10. C. McCreary and H. Gill. Automatic determination of grain size for efficient parallel processing. Comm. ACM, pages 1073-1078, Sep. 1989.
11. M. A. Palis, J.-C Liou, and D. S. Wei. Task clustering and scheduling for distributed memory parallel architectures. IEEE Transaction on Parallel andDistributed Systems, 7:1:46-55, 1996.
12. C. H. Papadimitriou and M. Yannakakis. Towards an architecture-independent analysis of parallel algorithms. SIAM Journal on Computing, 19:2:322-328, April 1990.
13. H. E. Rewini and T. G. Lewis. Scheduling parallel program tasks onto arbitrary target machines. Journal of Parallel andDistributed Computing,9:138-153, 1990.
14. V. Sarkar. Partitioning and Scheduling Parallel Programs for Execution on Multiprocessors. MIT Press, 1989.
15. M. Y. Wu and D. D. Gajski. A programming aid for hypercube architectures. Journal of Supercomputing, 2:349-372, 1988.
16. T. Yang. Scheduling and CodeGeneration for Parallel Architectures. PhD thesis, Department of Computer Science, RutgersUniversity, 1993. Ph.D. Thesis, Tech. Report DCS-TR-299.
17. T. Yang and A. Gerasoulis. DSC: Scheduling parallel tasks on an unbounded number of processors. IEEE Transactions on Parallel and Distributed Systems, 5:9:951-967, 1994.