Interprocedural array redistribution data-flow analysis

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1239, Issue , 1997, Pages 436-449

  Palermo, Daniel J ^a   Hodges Iv, Eugene W ^b   Banerjee, Prithviraj ^c  

^a HEWLETT PACKARD COMPANY   (United States)

^b SAS INSTITUTE INC   (United States)

^c NORTHWESTERN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; DATA FLOW ANALYSIS; SEMANTICS;

ARRAY REDISTRIBUTION; DISTRIBUTED MEMORY; DISTRIBUTION PATTERNS; DYNAMIC DISTRIBUTION; HIGH PERFORMANCE FORTRANS; MULTIPLE DISTRIBUTION; PARALLELIZING COMPILER; UNIVERSITY OF ILLINOIS;

PROGRAM COMPILERS;

EID: 84957625827     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0017268     Document Type: Conference Paper

References (17)

1. A. V. Aho, R. Sethi, and J. D. Ullman. Compilers: Principles, Techniques, and Tools. Addison-Wesley Publ., Reading, MA, 1986.
2. P. Banerjee, J. A. Chandy, M. Gupta, E. W. Hodges IV, J. G. Holm, A. Lain, D. J. Palermo, S. Ramaswamy, and E. Su. The PARADIGM Compiler for Distributed-Memory Multicom-puters. IEEE Computer, 28(10):37-47, Oct. 1995.
3. M. Burke and R. Cytron. Interprocedural Dependence Analysis and Parallelization. In Proc. of the ACM SIGPLAN Symp. on Compiler Construction, pages 162-175, Palo Alto, CA, June 1986.
4. L. Choi and P.-C. Yew. Interprocedural Array Data-Flow Analysis for Cache Coherence. In Proc. of the 8th Work, on Langs, and Compilers for Parallel Computing, volume 1033 of Lecture Notes in Computer Science, pages 81-95, Columbus, OH, Aug. 1995. Springer-Verlag. 1996.
5. F. Coelho and C. Ancourt. Optimal Compilation of HPF Remappings (Extended Abstract). Tech. Report CRIA-277, Centre de Recherche en Informatique, Ecole des mines de Paris, Fontainebleau, France, Nov. 1995.
6. R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman, and F. K. Zadeck. Efficiently Computing Static Single Assignment Form and the Control Dependence Graph. ACM Trans, on Prog. Langs. andSys., 13(4):451-490, Oct. 1991.
7. M. W. Hall, S. Hiranandani, K. Kennedy, and C. Tseng. Interprocedural Compilation of Fortran D for MIMD Distributed-Memory Machines. In Proc. of Supercomputing '92, pages 522-534, Minneapolis, MN, Nov. 1992.
8. M. W. Hall, B. R. Murphy, and S. P. Amarasinghe. Interprocedural Analysis for Parallelization. In Proc. of the 8th Work, on Langs, and Compilers for Parallel Computing, volume 1033 of Lecture Notes in Computer Science, pages 61-80, Columbus, OH, Aug. 1995. Springer-Verlag. 1996.
9. P. Havlak and K. Kennedy. Experience with Interprocedural Analysis of Array Side Effects. In Proc. of Supercomputing '90, pages 952-961, New York, NY, Nov. 1990.
10. High Performance Fortran Forum. High Performance Fortran Language Specification, version 1.1. Tech. report, Center for Research on Parallel Computation, Rice Univ., Houston, TX, Nov. 1994.
11. C. Koelbel, D. Loveman, R. Schreiber, G. Steele, Jr, and M. Zosel. The High Performance Fortran Handbook. The MIT Press, Cambridge, MA, 1994.
12. D. J. Palermo. Compiler Techniques for Optimizing Communication and Data Distribution for Distributed-Memory Multicomputers. PhD thesis, Dept. of Electrical and Computer Eng., Univ. of Illinois, Urbana, IL, June 1996. CRHC-96-09/UILU-ENG-96-2215.
13. D. J. Palermo and P. Banerjee. Automatic Selection of Dynamic Data Partitioning Schemes for Distributed-Memory Multicomputers. In Proc. of the 8th Work on Langs, and Compilers for Parallel Computing, volume 1033 of Lecture Notes in Computer Science, pages 392-406, Columbus, OH, Aug. 1995. Springer-Verlag. 1996.
14. C. D. Polychronopoulos, M. Girkar, M. R. Haghighat, C. L. Lee, B. Leung, and D. Schouten. Parafrase-2: An Environment for Parallelizing, Partitioning, Synchronizing and Scheduling Programs on Multiprocessors. In Proc. of the 18th Int'l Conf. on Parallel Processing, pages II:39-48, St. Charles, IL, Aug. 1989.
15. S. Ramaswamy and P. Banerjee. Automatic Generation of Efficient Array Redistribution Routines for Distributed Memory Multicomputers. In Frontiers '95: The 5th Symp. on the Frontiers of Massively Parallel Computation, pages 342-349, McLean, VA, Feb. 1995.
16. R. Triolet, F. Irigion, and P. Feautrier. Direct Parallelization of Call Statements. Proc. of the ACM SIGPLAN Symp. on Compiler Construction, 21(7): 176-185, July 1986.
17. C. W. Tseng. An Optimizing Fortran D Compiler for MIMD Distributed-Memory Machines. PhD thesis, Rice Univ., Houston, TX, Jan. 1993. COMP TR93-199.