Interprocedural compilation of Fortran D

Journal of Parallel and Distributed Computing

Volumn 38, Issue 2, 1996, Pages 114-129

  Hall, Mary W ^a   Hiranandani, Seema ^b   Kennedy, Ken ^c   Tseng, Chau Wen ^d  

^a UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

^b HEWLETT PACKARD ENTERPRISE   (United States)

^c Rice University   (United States)

^d Institute of Advanced Computer Science   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030295484     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1006/jpdc.1996.0135     Document Type: Article

References (28)

1. 1. V. Adve, A. Carle, E. Granston, S. Hiranandani, K. Kennedy, C. Koelbel, U. Kremer, J. Mellor-Crummey, S. Warren, and C.-W. Tseng. Requirements for data-parallel programming environments. IEEE Parallel Distrib. Tech. 2(3), 48-58, 1994.
2. 2. G. Agrawal, J. Saltz, and R. Das. Interprocedural partial redundancy elimination and its application to distributed memory compilation. Proceedings of the SIGPLAN '95 Conference on Programming Language Design and Implementation. La Jolla, CA, June 1995.
3. 3. S. Amarasinghe and M. Lam. Communication optimization and code generation for distributed memory machines. In Proceedings of the SIGPLAN '93 Conference on Programming Language Design and Implementation. Albuquerque, NM, June 1993.
4. 4. C. Ancourt and F. Irigoin. Scanning polyhedra with do loops. Proceedings of the Third ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. Williamsburg, VA, April 1991.
5. 5. J. Banning. An efficient way to find the side effects of procedure calls and the aliases of variables. Conference Record of the Sixth Annual ACM Symposium on the Principles of Programming Languages. San Antonio, TX, January 1979.
6. 6. B. Chapman, P. Mehrotra, and H. Zima. Handling distributed data in Vienna Fortran procedures. Proceedings of the Fifth Workshop on Languages and Compilers for Parallel Computing. New Haven, CT, August 1992.
7. 7. K. Cooper, M. W. Hall, R. T. Hood, K. Kennedy, K. S. McKinley, J. M. Mellor-Crummey, L. Torczon, and S. K. Warren. The ParaScope parallel programming environment. Proc. IEEE 81(2), 244-263, 1993.
8. 8. K. Cooper, M. W. Hall, and K. Kennedy. A methodology for procedure cloning. Comput. Languages 19(2), 105-117, 1993.
9. 9. E. Duesterwald, R. Gupta, and M. Soffa. Demand-driven computation of interprocedural data-flow. Proceedings of the Twenty-second Annual ACM Symposium on the Principles of Programming Languages. San Francisco, CA, January 1995.
10. 10. M. Gerndt. Array distribution in SUPERB. Proceedings of the 1989 ACM International Conference on Supercomputing. Crete, Greece, June 1989.
11. 11. D. Grove and L. Torczon. Interprocedural constant propagation: A study of jump function implementations. Proceedings of the SIGPLAN '93 Conference on Programming Language Design and Implementation. Albuquerque, NM, June 1993.
12. 12. M. Hall, S. Amarasinghe, B. Murphy, S. Liao, and M. Lam. Detecting coarse-grain parallelism using an interprocedural parallelizing compiler. Proceedings of Supercomputing '95. San Diego, CA, December 1995.
13. 13. M. Hall, B. Murphy, S. Amarasinghe, S. Liao, and M. Lam. Interprocedural analysis for parallelization. Proceedings of the Eighth Workshop on Languages and Compilers for Parallel Computing. Columbus, OH, August 1995.
14. 14. M. W. Hall. Managing Interprocedural Optimization. Ph.D. thesis, Dept. of Computer Science, Rice University, April 1991.
15. 15. M. W. Hall, S. Hiranandani, K. Kennedy, and C.-W. Tseng. Interprocedural compilation of Fortran D for MIMD distributed-memory machines. Proceedings of Supercomputing '92. Minneapolis, MN, November 1992.
16. 16. M. W. Hall and K. Kennedy. Efficient call graph analysis. ACM Lett. Programming Languages Syst. 1(3), 227-242, 1992.
17. 17. M. W. Hall, K. Kennedy, and K. S. McKinley. Interprocedural transformations for parallel code generation. Proceedings of Supercomputing '91. Albuquerque, NM, November 1991.
18. 18. M. W. Hall, J. Mellor-Crummey, A. Carle, and R. Rodriguez. FIAT: A framework for interprocedural analysis and transformation. Proceedings of the Sixth Workshop on Languages and Compilers for Parallel Computing. Portland, OR, August 1993.
19. 19. P. Havlak. Interprocedural symbolic analysis. Ph.D. thesis, Rice University, Dept. of Computer Science, May 1994.
20. 20. P. Havlak and K. Kennedy. An implementation of interprocedural bounded regular section analysis. IEEE Trans. Parallel Distrib. Syst. 2(3), 350-360, 1991.
21. 21. M. Hind, M. Burke, P. Carini, and S. Midkiff. An empirical study of precise interprocedural array analysis. Sci. Programming 3(3), 255-271, 1994.
22. 22. S. Hiranandani, K. Kennedy, and C.-W. Tseng. Compiling Fortran D for MIMD distributed-memory machines. Comm. ACM 35(8), 66-80, 1992.
23. 23. S. Hiranandani, K. Kennedy, and C.-W. Tseng. Preliminary experiences with the Fortran D compiler. Proceedings of Supercomputing '93. Portland, OR, November 1993.
24. 24. F. Irigoin, P. Jouvelot, and R. Triolet. Semantical interprocedural parallelization: An overview of the PIPS project. Proceedings of the 1991 ACM International Conference on Supercomputing. Cologne, Germany, June 1991.
25. 25. C. Koelbel, D. Loveman, R. Schreiber, G. Steele, Jr., and M. Zosel. The High Performance Fortran Handbook. MIT Press, Cambridge, MA, 1994.
26. 26. J. Loeliger, R. Metzger, M. Seligman, and S. Stroud. Pointer target tracking: An empirical study. Proceedings of Supercomputing '91. Albuquerque, NM, November 1991.
27. 27. T. Reps, S. Horwitz, and M. Sagiv. Precise interprocedural dataflow analysis via graph reachability. Proceedings of the Twenty-second Annual ACM Symposium on the Principles of Programming Languages. San Francisco, CA, January 1995.
28. 28. C.-W. Tseng. An Optimizing Fortran D Compiler for MIMD Distributed-Memory Machines. Ph.D. thesis, Dept. of Computer Science, Rice University, January 1993.