Experience with Efficient Array Data Flow Analysis for Array Privatization

SIGPLAN Notices (ACM Special Interest Group on Programming Languages)

Volumn 32, Issue 7, 1997, Pages 157-167

  Gu, Junjie ^a   Li, Zhiyuan ^a   Lee, Gyungho ^b  

^a UNIVERSITY OF MINNESOTA   (United States)

^b UNIVERSITY OF TEXAS AT SAN ANTONIO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0347936494     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/263767.263785     Document Type: Article

References (25)

1. A.V. Aho, R. Sethi, and J.D. Ullman. Compilers: Principles, Techniques, and Tools. Addison-Wesley, Reading, Mass., 1986.
2. V. Balasundaram. A mechanism for keeping useful internal information in parallel programming tools: The data access descriptor. Journal of Parallel and Distributed Computing, 9:154-170, 1990.
3. W. Blume and R. Eigenmann. Symbolic analysis techniques needed for the effective parallelization of Perfect benchmarks. Technical report, Dept. of Computer Science, University of Illinois, 1994.
4. D. Callahan and K. Kennedy. Analysis of interprocedural side effects in a parallel programming environment. In ACM SIGPLAN '86 Symp. Compiler Construction, pages 162-175, June 1986.
5. Lori A. Clarke and Debra J. Richardson. Applications of symbolic evaluation. The Journal of Systems and Software, 5(1):15-35, 1985.
6. Béatrice Creusillet and F. Irigoin. Interprocedural array region analyses. Int. Journal of Parallel Programming, 24(6):513-546, December 1996.
7. E. Duesterwald, R. Gupta, and M.L. Soffa. A practical data flow framework for array reference analysis and its use in optimizations. In ACM SIGPLAN '93 Conf. on Programming Language Design and Implementation, pages 68-77, June 1993.
8. R. Eigenmann, J. Hoeflinger, and D. Padua. On the automatic parallelization of the perfect benchmarks. Technical Report TR 1392, CSRD, University of Illinois at Urbana-Champaign, November 1994.
9. Paul Feautrier. Dataflow analysis of array and scalar references. International Journal of Parallel Programming, 2(1):23-53, February 1991.
10. 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.
11. J. Gu, Z. Li, and G. Lee. Symbolic array dataflow analysis for array privatization and program parallelization. In Supercomputing, December 1995.
12. M.W. Hall, B.R. Murphy, S.P. Amarasinghe, S.-W. Liao, and M.S. Lam. Interprocedural analysis for parallelization. In Proceedings of the 8th Workshop on Languages and Compilers for Parallel Computing, No. 1033, In Lecture Notes in Computer Science, Springer-Verlag, Berlin, pages 61-80, August 1995.
13. P. Havlak and K. Kennedy. An implementation of interprocedural bounded regular section analysis. IEEE Trans. on Parallel and Distributed Systems, 2(3):350-360, 1991.
14. Z. Li. Array privatization for parallel execution of loops. In ACM Int. Conf. on Supercomputing, pages 313-322, July 1992.
15. Vadim Maslov. Lazy array data-flow dependence analysis. In Proceedings of Annual ACM Symposium on Principles of Programming Languages, pages 331-325, Jan. 1994.
16. D.E. Maydan, S.P. Amarasinghe, and M.S. Lam. Array dataflow analysis and its use in array privatization. In Proc. of the 20th ACM Symp. on Principles of Programming Languages, pages 2-15, January 1993.
17. Dror E. Maydan. Accurate Analysis of Array References. PhD thesis, Stanford University, October 1992.
18. T. Nguyen, J. Gu, and Z. Li. An interprocedural parallelizing compiler and its support for memory hierarchy research. In Lecture Notes in Computer Science 1033: 8th International Workshop on Languages and Compilers for Parallel Computing, pages 96-110, Columbus, Ohio, August 1995. Springer-Verlag.
19. William Pugh and David Wonnacott. An exact method for analysis of value-based array data dependences. In Lecture Notes in Computer Science 768: Sixth Annual Workshop on Programming Languages and Compilers for Parallel Computing, Portland, OR, August 1993. Springer-Verlag.
20. Carl Rosene. Incremental dependence analysis. Technical Report CRPC-TR90044, PhD thesis, Computer Science Department, Rice University, March 1990.
21. Jr T.E. Cheatham, G.H. Holloway, and J.A. Townley. Symbolic evaluation and the analysis of programs. IEEE Trans.on Software Engineering, 5(4):402-417, July 1979.
22. R. Triolet, F. Irigoin, and P. Feautrier. Direct parallelization of CALL statments. In ACM SIGPLAN'86 Sym. on Compiler Construction, pages 176-185, July 1986.
23. Remi Triolet. Interprocedural analysis for program restructuring with parafrase. Technical Report CSRD Rpt. No.538, Center for Supercomputing Research and Development, University of Illinois at Urbana-Champaign, December 1985.
24. P. Tu and D. Padua. Gated ssa-based demand-driven symbolic analysis for parallelizing compilers. In International Conference on Supercomputing, pages 414-423, July 1995.
25. Peng Tu and David Padua. Automatic array privatization. In Proceedings of Sixth Workshop on Languages and Compilers for Parallel Computing, pages 500-521, August 1993.