Efficient and precise array access analysis

ACM Transactions on Programming Languages and Systems

Volumn 24, Issue 1, 2002, Pages 65-109

  Paek, Yunheung ^d   Hoeflinger, Jay ^b   Padua, David ^a,c  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b INTEL CORPORATION   (United States)

^c University of Illinois at Urbana Champaign   (United States)

^d NONE

Author keywords

Algorithms; Array access analysis; D.3.4 Programming Languages : Processors compilers, optimization; F.3.2 Logics and Meanings of Programs : Semantics of Programming Languages program analysis; Internal representation; Languages

Indexed keywords

ARRAY ACCESS ANALYSIS; LINEAR MEMORY ACCESS DESCRIPTORS;

ALGORITHMS; COMPUTER PROGRAMMING LANGUAGES; DATA STORAGE EQUIPMENT; DATA STRUCTURES; FORMAL LOGIC; PROGRAM COMPILERS; SEMANTICS;

ARRAYS;

EID: 0040620594     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/509705.509708     Document Type: Article

References (35)

1. BALASUNDARAM, V. AND KENNEDY, K. 1989. A technique for summarizing data access and its use in parallelism enhancing transformations. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (June).
2. BANERJEE, U. 1997. Dependence Analysis. Kluwer Academic Publishers, Mass.
3. BERRY, M., CHEN, D., KOSS, P., KUCK, D., POINTER, L., LO, S., PANG, Y., ROLOFF, R., SAMEH, A., CLEMENTI, E., CHIN, S., SCHNEIDER, D., FOX, G., MESSINA, P., WALKER, D., HSIUNG, C., SCHWARZMEIER, J., LUE, K., ORSZAG, S., SEIDL, F., JOHNSON, O., SWANSON, G., GOODRUM, R., AND MARTIN, J. 1989. The perfect club benchmarks: Effective performance evalution of supercomputers. Int. J. Supercomp. Appl. 3, 3 (Fall), 5-40.
4. BLUME, W. 1995. Symbolic analysis techniques for effective automatic parallelization. Ph.D. dissertation, Dept. of Computer Science. Univ. of Illinois at Urbana-Champaign, Urbana-Champaign, Ill.
5. BLUME, W., DOALLO, R., EIGENMANN, R., GROUT, J., HOEFLINGER, J., LAWRENCE, T., LEE, J., PADUA, D., PAEK, Y., POTTENGER, W., RAUCHWERGER, L., AND TU, P. 1996. Parallel programming with polaris. IEEE Comput. 29, 12 (Dec.), 78-82.
6. BURKE, M. AND CYTRON, R. 1986. Interprocedural dependence analysis and parallelization. In Proceedings of the ACM SIGPLAN Symposium on Compiler Construction. ACM, New York, pp. 162-175.
7. CALLAHAN, D. AND KENNEDY, K. 1988. Analysis of interprocedural side effects in a parallel programming environment. J. Parall. Distrib. Comput. 5, 517-550.
8. CHATTERJEE, S., GILBERT, J., LONG, F., SCHREIBER, R., AND TENG, S. 1995. Generating local address and communication sets for data-parallel programs. J. Paral. Distrib. Comput. 26, 1 (Apr.), 72-84.
9. COUSOT, P. 1980. Semantic foundations of program analysis. In Program Flow Analysis, Theory and Applications, Prentice-Hall, Englewood Cliffs, N.J., pp. 303-343.
10. COUSOT, P. AND COUSOT, R. 1977. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proceedings of the 4th ACM Symposium on Principles of Programming Languages. ACM, New York, pp. 238-252.
11. CRAY RESEARCH INC. 1994. SHMEM Technical Note for Fortran.
12. CREUSILLET, B. AND IRIGOIN, F. 1995. Interprocedural array region analyses. In Lecture Notes in Computer Science. Springer-Verlag, New York.
13. CREUSILLET, B. AND IRIGOIN, F. 1996. Exact vs. approximate array region analyses. In Lecture Notes in Computer Science. Springer-Verlag, New York.
14. DANTZIG, G. AND EAVES, B. 1973. Fourier-Motzkin elimination and its dual. J. Combinat. Theory, 288-297.
15. FEAUTRIER, P. 1991. Dataflow analysis of array and scalar references. Int. J. Paral. Prog. 20, 1, 23-53.
16. GU, J., LI, Z., AND LEE, G. 1995. Symbolic array dataflow analysis for array privatization and program parallelization. In Proceedings of Supercomputing '95 (Dec.).
17. HAVLAK, P. AND KENNEDY, K. 1991. An implementation of interprocedural bounded regular section analysis. IEEE Trans. Paral. Distrib. Syst. 2, 3 (July.), 350-360.
18. HIRANANDANI, S., KENNEDY, K., AND TSENG, C. 1994. Evaluating compiler optimizations for Fortran D. J. Paral. Distrib. Comput., 27-45.
19. HOEFLINGER, J. 1998. Interprocedural parallelization using memory classification analysis. Ph.D. dissertation, Dept. Computer Science. Univ. Illinois at Urbana-Champaign, Urbana-Champaign, Ill.
20. HOEFLINGER, J. AND PAEK, Y. 1999. The access region test. In Lecture Notes in Computer Science. Springer-Verlag, New York.
21. HOROWITZ, E. AND SAHNI, S. 1978. Fundamentals of Computer Algorithms. Computer Science Press, Maryland.
22. LI, Z. AND YEW, P. 1988. Efficient interprocedural analysis for program restructuring for parallel programs. In Proceedings of the SIGPLAN Symposium on Parallel Programming: Experience with Applications, Languages and Systems (July), ACM, New York.
23. MAYDAN, D., AMARASINGHE, S., AND LAM, M. 1993. Array data-flow analysis and its use in array privatization. In Proceedings of the ACM SIGPLAN Symposium on Principles of Programming Languges (Jan.), ACM, New York.
24. MESSAGE PASSING INTERFACE FORUM 1996. MPI-2: Extensions to the Message-Passing Interface. January 12, 1996.
25. MOORE, R. 1966. Interval Analysis. Prentice-Hall, Englewood Cliffs, N.J.
26. NAVARRO, A. AND ZAPATA, E. 1999. An automatic iteration/data distribution method based on access descriptors for DSMM. In Lecture Notes in Computer Science. Springer-Verlag, New York.
27. PAEK, Y. 1997. Automatic parallelization for distributed memory machines based on access region analysis. Ph.D. dissertation, Dept. Computer Science, Univ. Illinois at Urbana-Champaign, Urbana-Champaign, Ill.
28. PAEK, Y., HOEFLINGER, J., AND PADUA, D. 1998. Simplication of array access patterns for compiler optimizations. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (June), ACM, New York.
29. PAEK, Y. AND PADUA, D. 1998. Experimental study of compier techniques for NUMA machines. In Proceedings of the IEEE International Parallel Processing Symposium & Symposium on Parallel and Distributed Processing (Apr). IEEE Computer Society Press, Los Alamitos, Calif.
30. PUGH, W. 1992. A practical algorithm for exact array dependence analysis. Commun. ACM 35, 8 (Aug.).
31. REILLY, J. 1995. SPEC95 products and benchmarks. SPEC Newsletter (Sept.).
32. SHEN, Z., LI, Z., AND YEW, P.-C. 1990. An empirical study of fortran programs for parallelizing compilers. IEEE Trans. Paral. Distrib. Syst. 1, 3 (July), 350-364.
33. TRIOLET, R., FEAUTRIER, P., AND IRIGOIN, F. 1986. Direct parallelism of call statements. In Proceedings of the ACM SIGPLAN Symposium on Compiler Construction. ACM, New York, pp. 176-185.
34. TU, P. 1995. Automatic array privatization and demand-driven symbolic analysis. Ph.D. dissertation, Dept. Computer Science, Univ. Illinois at Urbana-Champaign, Urbana-Champaign, Ill.
35. YU, H. AND RAUCHWERGER, L. 1999. The aggregate LRPD test. Tech. Rep., Univ. Texas A&M. June.