Compiler analysis of irregular memory accesses

SIGPLAN Notices (ACM Special Interest Group on Programming Languages)

Volumn 35, Issue 5, 2000, Pages 157-168

  Lin, Yuan ^a   Padua, David ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

EID: 17144386249     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/358438.349322     Document Type: Article

References (32)

1. Z. Ammarguellat and W. L. Harrison, III. Automatic recognition of induction variables and recurrence relations by abstract interpretation. In PLDI '90, pages 283-295, NY, June 1990.
2. V. Balasundaram and K. Kennedy. A technique for summarizing data access and its use in parallelism-enhancing transformations. In PLDI'89, pages 41-53, Portland, OR, June 1989.
3. U. Banerjee. Data dependence in ordinary programs. Master's thesis, Dept. of Computer Science, University of Illinois at Urbana-Champaign, November 1976. Report No. 76-837.
4. J. Barnes. ftp://hubble.ifa.hawaii.edu/pub/barnes/treecode/. Technical report, Institute for Astronomy, University of Hawaii, 1994.
5. W. Blume. Symbolic analysis techniques for effective automatic parallelization. PhD thesis, University of Illinois at Urbana-Champaign, June 1995.
6. W. Blume, R. Doallo, R. Eigenmann, J. Grout, J. Hoeflinger, T. Lawrence, J. Lee, D. Padua, Y. Paek, B. Pottenger, L. Rauchwerger, and P. Tu. Parallel programming with polaris. IEEE Computer, 29(12):78-82, December 1996.
7. W. Blume and R. Eigenmann. An overview of symbolic analysis techniques needed for the effective parallelization of the perfect benchmarks. In Proceedings of the 23rd International Conference on Parallel Processing. Volume 2: Software, pages 233-238, Boca Raton, FL, August 1994. CRC Press.
8. W. Blume and R. Eigenmann. The range test: A dependence test for symbolic, non-linear expressions. In Proceedings of the Conference on Supercomputing, pages 528-537, Los Alamitos, November 1994. IEEE Computer Society Press.
9. D. Callahan and K. Kennedy. Analysis of interprocedural side effects in a parallel programming environment. Journal of Parallel and Distributed Computing, 5(5):517-550, October 1988.
10. B. Creusillet and F. Irigoin. Interprocedural array region analysis. In Proceedings of the 8th International Workshop on Languages and Compilers for Parallel Computing (LCPC'95), volume 103 of Lecture Notes in Computer Science, pages 46-60. Ohio State University, Colombus (Ohio), August 1996.
11. E. Duesterwald, R. Gupta, and M. Soffa. A practical framework for demand-driven interprocedural data flow analysis. ACM Transactions on Programming Languages and Systems, 19(6):992-1030, November 1997.
12. P. Feautrier. Array expansion. In Proceedings of the Second International Conference on Supercomputing, St. Malo, France, July 1988.
13. M. Gerlek, E. Stoltz, and M. Wolfe. Beyond induction variables: Detecting and classifying sequences using a demand-driven SSA form. ACM Transactions on Programming Languages and Systems, 17(1):85-122, January 1995.
14. T. Gross and P. Steenkiste. Structured dataflow analysis for arrays and its use in an optimizing compiler. Software Practice and Experience, 20(2):133-155, February 1990.
15. J. Gu, Z. Li, and G. Lee. Symbolic array dataflow analysis for array privatization and program parallelization. In Proceedings of the 1995 Supercomputing Conference, San Diego, CA, 1995.
16. M. Hall, S. Amarasinghe, B. Murphy, S. Liao, and M. Lam. Detecting coarse-grain parallelism using an interprocedural parallelizing compiler. In Proceedings of the 1995 Supercomputing Conference, San Diego, CA, 1995.
17. P. Havlak. Interprocedural Symbolic analysis. PhD thesis, Rice University, May 1994.
18. K. Kennedy, K. S. McKinley, and C.-W. Tseng. Analysis and transformation in the ParaScope Editor. In Proceedings of the 1991 ACM International Conference on Supercomputing, pages 433-447, Cologne, Germany, June 1991.
19. Z. Li. Array privatization for parallel execution of loops. In Proceedings of 1992 International Conference on Supercomputing, DC, pages 313-322, 1992.
20. Y. Lin. Compiler analysis of sparse and irregular computations. PhD thesis, University of Illinois at Urbana-Champaign, May 2000.
21. Y. Lin and D. Padua. On the automatic parallelization of sparse and irregular fortran programs. In Proc. of 4th Workshop on Languages, Compilers, and Run-time Systems for Scalable Computers (LCR'98), volume 1511 of Lecture Notes in Computer Science, pages 41-56. Springer-Verlag, Pittsburgh, PA, 1998.
22. Y. Lin and D. Padua. Analysis of irregular single-indexed array accesses and its applications in compiler optimizations. In Proceedings of the 9th International Conference on Compiler Construction, Berlin, March 2000.
23. D. Maydan, S. Amarasinghe, and M. Lam. Array-data flow analysis and its use in array privatization. In Proceedings of the Twentieth Annual ACM Symposium on Principles of Programming Languages, Charleston, South Carolina, pages 2-15, January 1993.
24. K. McKinley. Dependence analysis of arrays subscripted by index arrays. Technical Report TR91-162, Dept. of Computer Science, Rice University, June 1991.
25. Y. Paek, J. Hoeflinger, and D. Padua. Simplification of array access patterns for compiler optimizations. In PLDI'98, pages 60-71, Montreal, Canada, June 1998.
26. L. Rauchwerger. Run-time parallelization: a framework for parallel computation. PhD thesis, University of Illinois at Urbana-Champaign, 1995.
27. J. H. Saltz, R. Mirchandaney, and K. Crowley. Run-time parallelization and scheduling of loops. IEEE Transactions on Computers, 40(5):603-612, May 1991.
28. M. Spezialetti and R. Gupta. Loop monotonic statements. IEEE Transactions on Software Engineering, 21(6):497-505, June 1995.
29. R. Triolet, F. Irigoin, and P. Feautrier. Direct parallelization of call statements. In Proceedings of the SIGPLAN'86 Symposium on Compiler Construction, pages 176-185, Palo Alto, CA, July 1986.
30. P. Tu and D. Padua. Automatic array privatization. In Proceedings of the 6th International Workshop on Languages and Compilers for Parallel Computing, Lecture Notes in Computer Science, pages 500-521. Springer-Verlag, August 12-14, 1993.
31. M. Wolfe. Beyond induction variables. In PLDI'92, pages 162-174, July 1992.
32. C.-Q. Zhu and P.-C. Yew. A synchronization scheme and its applications for large multiprocessor systems. In International Conference on Distributed Computing Systems, pages 486-493, 1985.