PYRROS: Static task scheduling and code generation for message passing multiprocessors

Proceedings of the International Conference on Supercomputing

Volumn Part F129617, Issue , 1992, Pages 428-437

  Yang, Tao ^a   Gerasoulis, Apostolos ^a  

^a RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INTELLIGENT CONTROL; PARALLEL PROGRAMMING;

CODE GENERATION; MIMD ARCHITECTURE; STATIC TASK SCHEDULING; TARGET CODES; TASK GRAPH;

MESSAGE PASSING;

EID: 84996622121     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/143369.143446     Document Type: Conference Paper

References (26)

1. S.H. Bokhari, Assignment Problems in Parallel and Distributed Computing, Kluwer Academic Publisher, 1990.
2. D. Callahan, K. Kennedy, Compiling programs for distributed-memory multi-processors, The Journal of Supercomputing, (2): 151-169, 1988.
3. Ph. Chretienne, Task Scheduling over Distributed Memory Machines, Proc. of the International Workshop on Parallel and Distributed Algorithms, (North Holland, Ed.), 1989.
4. R. Das, R. Ponnusamy, J. Saltz, and D. Mavriplis, Distributed Memory Compiler Methods for Irregular Problems: Data Copy Reuse and Runtime Partitioning, ICASE Report No. 91-73, 1991.
5. J. J. Dongarra, and D.C. Sorensen, SCHEDULE: Tools for Developing and Analyzing Parallel Fortran Programs, in D.B. Gannon, L.H. Jamieson and R.J. Douglass, editors, The Characteristics of Parallel Algorithms, pp. 363-394. The MIT Press, Cambridge, Massachusetts, 1987.
6. J. J. Dongarra, J. Du Croz, I. Duff and S. Hammar-ling, A Set of Level 3 Basic Linear Algebra Subprograms, ACM Trans, on Math. Software, 16(1):1-17, Mar. 1990.
7. T.H. Dunigan, Performance of the INTEL iPSC/860 and nCUBE 6400 Hypercube, ORNL TM-11790, Oak Ridge National Laboratory, Oak Ridge, TN, Nov. 1991.
8. H.El-Rewini and T.G. Lewis, Scheduling Parallel Program Tasks onto Arbitrary Target Machines, J. of parallel and Distributed Computing 9, 138-153(1990).
9. A. Gerasoulis and T. Yang, On the Granularity and Clustering of Directed Acyclic Task Graphs, LCSR-TR-153, Dept. of Computer Science, Rutgers Univ., 1990.
10. A. Gerasoulis and T. Yang, A Comparison of Clustering Heuristics for Scheduling DAGs on Multiprocessors, LCSR-TR-169, Dept. of Computer Science, Rutgers Univ., 1991.
11. A. Gerasoulis and T. Yang, Compile-time scheduling and code generation for message-passing architectures, Report.
12. A. George, , M.T. Heath, and J. Liu, Parallel Cholesky Factorization on a Shared Memory Processor, Lin. Algebra Appl., 77(1986), pp. 165-187.
13. S. Hiranandani, K. Kennedy and C.W. Tseng, Compiler Optimizations for Fortran D on MIMD Distributed-Memory Machines, Supercomputing 91, pp. 86-100.
14. C. Koelbel and P. Mehrotra, Compiling global name-space parallel loops for distributed execution, IEEE Trans, on parallel and Distributed Systems 2(4), 1991.
15. S.J. Kim and J.C Browne, A General Approach to Mapping of Parallel Computation upon Multiprocessor Architectures, Int'l Conf. on Parallel Processing, vol 3, pp. 1-8, 1988.
16. J. Li and M. Chen, Compiling Communication-Efficent Programs for Massively Parallel Machines., May 1991, accepted in IEEE Trans, on Distributed and Parallel Computing.
17. J.M. Ortega, Introduction to Parallel and Vector Solution of Linear Systems, New York:Plenum, 1988.
18. C. D. Polychronopoulos, M.B. Girkar, M. R.Haghighat, C.L. Lee, B.P. Leung, and D.A. Schouten, The Structure of Parafrase-2: an Advanced Parallelizing Compiler for C and Fortran, in D. Gelernter, A. Nicolau and D. Padua (Eds.), Languages and Compilers for Parallel Computing, 1990.
19. A. Rogers, K. Pingali, Process Decomposition Through Locality of Reference, SIGPLAN 1989, pp. 69-80.
20. Y. Saad, Gaussian Elimination on Hypercubes, Parallel Algorithms and Architectures, Cosnard, M. et al. Eds., Elsevier Science Publishers, North-Holland, 1986.
21. Y. Saad and M. H. Schultz, Data Communication in Hypercubes, DCS/RR-428, Research Report, Yale Uiverstiy, 1985.
22. V. Sarkar, Partitioning and Scheduling Parallel Programs for Execution on Multiprocessors, The MIT Press, 1989.
23. V. Sarkar, Determining Average Program Execution Times and their Variance, SIGPLAN 1989, pp. 298-312.
24. Min-You Wu and D. Gajski, A Programming Aid for Hypercube Architectures, The Journal of Super-computing, vol. 2, pp. 349-372, 1988.
25. T. Yang and A. Gerasoulis, A Fast Scheduling Algorithm for DAGs on an Unbounded Number of Processors, The Proceeding of IEEE Supercomputing 91, pp. 633-642.
26. T. Yang and A. Gerasoulis, List Scheduling with and without Communication Delay, Report.