Simplification of Array Access Patterns for Compiler Optimizations

SIGPLAN Notices (ACM Special Interest Group on Programming Languages)

Volumn 33, Issue 5, 1998, Pages 60-71

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

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

^b NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0346877103     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/277652.277664     Document Type: Article

References (31)

1. V. Balasundaram and K. Kennedy. A Technique for Summarizing Data Access and its Use in Parallelism Enhancing Transformations. Proceedings of the SIGPLAN Conference on Programming Language Design and Implementation, June 1989.
2. U. Banerjee. Dependence Analysis. Kluwer Academic Publishers, Norwell, MA, 1997.
3. W. Blume. Symbolic Analysis Techniques for Effective Automatic Parallelization. PhD thesis, Univ. of Illinois at Urbana-Champaign, Dept. of Computer Science, June 1995.
4. W. Blume, R. Doallo, R. Eigenmann, J. Grout, J. Hoeflinger, T. Lawrence, J. Lee, D. Padua, Y. Paek, W. Pottenger, L. Rauchwerger, and P. Tu. Parallel Programming with Polaris. IEEE Computer, 29(12):78-82, December 1996.
5. M. Burke and R. Cytron. Interprocedural Dependence Analysis and Parallelization. Proceedings of the SIGPLAN Symposium on Compiler Construction, pages 162-175, July 1986.
6. D. Callahan and K. Kennedy. Analysis of Interprocedural Side Effects in a Parallel Programming Environment. Journal of Parallel and Distributed Computing, 5:517-550, 1988.
7. S. Chatterjee, J. Gilbert, F. Long, R. Schreiber, and S. Teng. Generating Local Address and Communication Sets for Data-Parallel Programs. Journal of Parallel and Distributed Computing, 26(1):72-84, April 1995.
8. Cray Research Inc. SHMEM Technical Note for Fortran, 1994.
9. B. Creusillet and F. Irigoin. Exact vs. Approximate Array Region Analyses. In Lecture Notes in Computer Science. Springer Verlag, New York, New York, August 1996.
10. D. Culler, A. Dusseau, S. Goldstein, A. Krishnamurthy, S. Lumetta, T. Eicken, and K. Yelick. Parallel Programming in Split-C. Proceedings of Supercomputing '93, pages 262-273, November 1993.
11. G. Dantzig and B. Eaves. Fourier-Motzkin Elimination and its Dual. Journal of Combinatorial Theory, pages 288-297, 1973.
12. R. Graham, D. Knuth, and O. Patashnik. Concrete Mathematics: A Foundation for Computer Science. Addison-Wesley Pub. Co., New York, 1989.
13. J. Grout. Inline Expansion for the Polaris Research Compiler. Master's thesis, Univ. of Illinois at Urbana-Champaign, Dept. of Computer Science, May 1995.
14. J. Gu, Z. Li, and G. Lee. Symbolic Array Dataflow Analysis for Array Privatization and Program Parallelization. Proceedings of Supercomputing '95, December 1995.
15. P. Havlak. Interprocedural Symbolic Analysis. PhD thesis, Rice University, May 1994.
16. S. Hiranandani, K. Kennedy, and C. Tseng. Evaluating Compiler Optimizations for Fortran D. Journal of Parallel and Distributed Computing, pages 27-45, 1994.
17. J. Hoeflinger. PhD thesis, Univ. of Illinois at Urbana-Champaign, Dept. of Computer Science, forthcoming.
18. C. Huson. An In-line Subroutine Expander for Parafrase. Master's thesis, Univ. of Illinois at Urbana-Champaign, Dept. of Computer Science, May 1982.
19. Z. Li and P. Yew. Efficient Interprocedural Analysis for Program Parallelization and Restructuring. Proceedings of the SIGPLAN Symposium on Parallel Programming: Experience with Applications, Languages and Systems, July 1988.
20. Z. Li, P. Yew, and C. Zhu. An Efficient Data Dependence Analysis for Parallelizing Compilers. IEEE Transaction on Parallel and Distributed Systems, 1(1):26-34, January 1990.
21. D. Maydan, S. Amarasinghe, and M. Lam. Array Data-Flow Analysis and its Use in Array Privatization. Proceedings of ACM SIGPLAN Symposium on Principles of Programming Languges, January 1993.
22. Message Passing Interface Forum. MPI-2: Extensions to the Message-Passing Interface, January 12, 1996.
23. J. Nielocha, R. Harrison, and R. Littlefield. Global Arrays: A Portable Shared-Memory Programming Model for Distributed Memory Computers. Proceedings of Supercomputing '94, pages 340-349, November 1994.
24. Y. Pack. Automatic Parallelization for Distributed Memory Machines Based on Access Region Analysis. PhD thesis, Univ. of Illinois at Urbana-Champaign, Dept. of Computer Science, April 1997.
25. Y. Pack and D. Padua. Experimental Study of Compiler Techniques for NUMA Machines. IEEE International Parallel Processing Symposium & Symposium on Parallel and Distributed Processing, April 1998.
26. W. Pugh. A Practical Algorithm for Exact Array Dependence Analysis. Communications of the ACM, 35(8), August 1992.
27. W. Pugh and D. Wonnacott. Nonlinear Array Dependence Analysis. Technical Report 123, Univ of Maryland at College Perk, November 1994.
28. Z. Shen, Z. Li, and P. Yew. An Empirical Study of Fortran Programs for Parallelizing Compilers. IEEE Transaction on Parallel and Distributed Systems, 1(3):350-364, July 1990.
29. P. Tang. Exact Side Effects for Interprocedural Dependence Analysis. Communications of the ACM, 35(8):102-114, August 1992.
30. R. Triolet, F. Irigoin, and P. Feautrier. Direct Parallelization of Call Statements. Proceedings of the SIGPLAN Symposium on Compiler Construction, pages 176-185, 1986.
31. P. Tu. Automatic Array Privatization and Demand-Driven Symbolic Analysis. PhD thesis, Univ. of Illinois at Urbana-Champaign, Dept. of Computer Science, May 1995.