Compiler techniques for determining data distribution and generating communication sets on distributed-memory machines

Proceedings of the Annual Hawaii International Conference on System Sciences

Volumn 1, Issue , 1996, Pages 537-546

  Lee, PeiZong ^a   Chen, Wen Yao ^a  

^a INSTITUTE OF INFORMATION SCIENCE   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

DYNAMIC PROGRAMMING; SOFTWARE ENGINEERING; STRUCTURED PROGRAMMING;

COMPILER TECHNIQUES; DATA DISTRIBUTION; DATA REDISTRIBUTION; DISTRIBUTED MEMORY MACHINES; DISTRIBUTED MEMORY MULTICOMPUTERS; DYNAMIC PROGRAMMING ALGORITHM; PROCESSING ELEMENTS; PROGRAM FRAGMENTS;

MEMORY ARCHITECTURE;

EID: 85019514322     PISSN: 15301605     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/HICSS.1996.495504     Document Type: Conference Paper

References (15)

1. S. Benkner, P. Brezany, and H. Zima. Processing array statements and procedureinterfacesin the PREPARE high performance Fortran compiler. In Lecture Notes in Computer Science 786, pages 324-338, 1993.
2. S. Chatterjee, J. R Gilbert, F. J. E. Long, R. Schreiber, and S. H. Teng. Generating local addresses and communication sets for data-parallel programs. In PTOC. ACM SIGPLAN Symp. on PPoPP, pages 149-158, May 1993.
3. M. Gupta and P. Banerjee. Demonstration of automatic data partitioning techniquesfor pardelizing compilerson multicomputers. IEEE Trans. Parallel Dastributed Syst., 3(2):179-193, Mar. 1992.
4. S. K. S. Gupta, S. D. Kaushik, C. H. Huang, and P. Sa-dayappan. On compiling array expressionsfor efficient execution on distributed-memory machines. In PTOC. International Conf. on Parallel Processing, pages 11-301-305, St. Charles, IL, Aug. 1993.
5. S. Hiranandaui, K. Kennedy, J. Mellor-Crummey, and A. Sethi. Compilation techniques for block-cyclic distributions. In PTOC. of ACM International Gonj. on Supercomputing, pages 392-403, Manchester, U.K., July 1994.
6. S. Hiranandani, K. Kennedy, and C-W. Tseng. Compiling Fortran D for MIMD distributed-memory machines. Communications of the ACM, 35(8):66-80, Aug. 1992.
7. C. Koelbel. Compile-timegeneration of regular communications patterns. In PTOC.oj Supercomputing '91, pages 101-110, NOV.1991.
8. C. Koelbel, D. Loveman, R. Schreiber, G. Steele, Jr., and M. Zosel. The High Performance Fortran Handbook. The MIT Press, Cambridge,MA, 1994.
9. C. Koelbeland P. Mehrotra. Compilingglobalname-space parallel loopsfor distributed execution. IEEE Trans. Parallel Distributed Syst., 2(4):440-451, Oct. 1991.
10. P.-Z. Lee and W. Y. Chen. Compiler techniques for determining data distribution and generating communication sets on distributed-memory multicomputers. Technical Report TR-11s-95-007, Institute of InformationScience, Academia Sinica, 1995.
11. J. Li and M. Chen. Compiling communication-efficient problems for massively parallel machines. IEEE Trans. Parallel Distributed Syst., 2(3):361-376, July 1991
12. J. Li and M. Chen. The data alignment phase in compiling programs for distributed-memory machines. Journal of Parallel and Distrabuted Computing, 13:213-221, 1991.
13. J. M. Stichnoth, D. O'Hallaron, and T . R. Gross. Generating communicationfor array statements: Design, implementation, and evaluation. Journal of Parallel and Dts-tributed Computang, 21:150-159, 1994.
14. Ellis Wade Jr. and Ed Lodi. A Tutoraal Introduction to Derive. Brooks/Cole Publishing Company, Pacific Grove, California, 1991.
15. M. E. Wolf and M. S. Lam. A loop transformation theory and an algorithm to maximize pardelism. IEEE Trans. Parallel Distributed Syst., 2(4):452-471, Oct. 1991.