Identifying parallelism in programs with cyclic graphs

Journal of Parallel and Distributed Computing

Volumn 63, Issue 3, 2003, Pages 337-355

  Hwang, Yuan Shin ^a   Saltz, Joel H ^b  

^a NATIONAL TAIWAN OCEAN UNIVERSITY   (Taiwan)

^b OHIO STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0038519298     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0743-7315(02)00026-6     Document Type: Article

References (30)

1. A.V. Aho, R. Sethi, J.D. Ullman, Compilers: Principles, Techniques, and Tools, Addison-Wesley, Reading, MA, 1986.
2. U. Banerjee, R. Eigenmann, A. Nicolau, D.A. Padua, Automatic program parallelization, Proc. IEEE 81 (2) (February 1993) 211-243 (in special section on languages and compilers for parallel machines).
3. J. Barnes, P. Hut, A hierarchical O(N log N) force-calculation algorithm, Nature 324 (December 1986) 446-449.
4. David Callahan, The program summary graph and flow-sensitive interprocedural data flow analysis, SIGPLAN Notices 23 (7) (July 1988) 47-56; Proceedings of the ACM SIGPLAN'88 Conference on Programming Language Design and Implementation.
5. D.R. Chase, M. Wegman, F. Kenneth Zadeck, Analysis of pointers and structures, SIGPLAN Notices 25 (6) (June 1990) 296-310; Proceedings of the ACM SIGPLAN'90 Conference on Programming Language Design and Implementation.
6. Jong-Deok Choi, Michael Burke, Paul Carini, Efficient flow-sensitive interprocedural computation of pointer-induced aliases and side effects, in: Conference Record of the 20th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Charleston, South Carolina, January 1993, pp. 232-245.
7. K.D. Cooper, M.W. Hall, R.T. Hood, K. Kennedy, K.S. McKinley, J.M. Mellor-Crummey, L. Torczon, S.K. Warren, The ParaScope parallel programming environment, Proc. IEEE 81 (2) (February 1993) 244-263 (in special section on languages and compilers for parallel machines).
8. R. Cytron, J. Ferrante, B.K. Rosen, M.N. Wegman, F. Kenneth Zadeck, Efficiently computing static single assignment form and the control dependence graph, ACM Trans. Programming Languages Systems 13 (4) (October 1991) 451-490.
9. A. Deutsch, Interprocedural May-Alias analysis for pointers: beyond k-limiting, SIGPLAN Notices 29 (6) (June 1994) 230-241 in: Proceedings of the ACM SIGPLAN '94 Conference on Programming Language Design and Implementation.
10. R. Ghiya, and L.J. Handren, Putting pointer analysis to work, in: Conference Record of POPL '98: 25nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, San Diego, California, January 1998.
11. R. Ghiya, L.J. Hendren, Is it a tree, a DAG, or a cyclic graph? A shape analysis for heap-directed pointers in C, in: Conference Record of POPL '96: 23nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, St. Petersburg Beach, Florida, January 1996, pp. 1-15.
12. R. Ghiya, L.J. Hendren, Yingchun Zhu, Detecting parallelism in c programs with recursive data structures, in: Proceedings of the 1998 International Conference on Compiler Construction, March 1998.
13. V.A. Guarna Jr., A technique for analyzing pointer and structure references in parallel restructuring compilers, in: Proceedings of 1988 International Conference on Parallel Processing, Vol. 2, August 1988, pp. 212-220.
14. M.W. Hall, S.P. Amarasinghe, B.R. Murphy, Shih-Wei Liao, M.S. Lam, Detecting coarse-grain parallelism using an interprocedural parallelizing compiler, in: Proceedings of Supercomputing '95, December 1995.
15. M.J. Harrold, M.L. Soffa, Efficient computation of interprocedural definition-use chains, ACM Trans. Programming Languages Systems 16 (2) (March 1994) 175-204.
16. L.J. Hendren, Parallelizing Programs with Recursive Data Structures, Ph.D. Thesis, Cornell University, 1990.
17. L.J. Hendren, A. Nicolau, Parallelizing programs with recursive data structures, IEEE Trans. Parallel Distrib. Systems 1 (1) (January 1990) 35-47.
18. S. Horwitz, P. Pfeiffer, T. Reps, Dependence analysis for pointer variables, SIGPLAN Notices 24 (7) (July 1989) 28-40 Proceedings of the ACM SIGPLAN '89 Conference on Programming Language Design and Implementation.
19. J. Hummel, L.J. Hendren, A. Nicolau, A general data dependence test for dynamic, pointer-based data structures, SIGPLAN Notices 29 (6) (June 1994) 218-229 Proceedings of the ACM SIGPLAN '94 Conference on Programming Language Design and Implementation.
20. Yuan-Shin Hwang, Interprocedural Definition-Use Chains of Dynamic Recursive Data Structure, Ph.D. Thesis, University of Maryland, 1998.
21. Yuan-Shin Hwang, J. Saltz, Identifying DEF/USE information of statements that construct and traverse dynamic recursive data structures, in: Proceedings of 10th International Workshop on Languages and Compilers for Parallel Computing, University of Minnesota, August 1997.
22. Yuan-Shin Hwang, J. Saltz, Identifying parallelism in programs with cyclic graphs, in: Proceedings of the 2000 International Conference on Parallel Processing, Toronto, Canada, August 2000, pp. 201-208.
23. W. Landi, B.G. Ryder, Sean Zhang, Interprocedural side effect analysis with pointer aliasing, SIGPLAN Notices 28 (6) (June 1993) 56-67; Proceedings of the ACM SIGPLAN '93 Conference on Programming Language Design and Implementation.
24. J.R. Larus, P.N. Hilfinger, Detecting conflicts between structure accesses, SIGPLAN Notices 23 (7) (July 1988) 21-34; Proceedings of the ACM SIGPLAN '88 Conference on Programming Language Design and Implementation.
25. N.K. Madsen, Divergence preserving discrete surface integral methods for maxwell's curl equations using non-orthogonal grids, Technical Report 92.04, RIACS, February 1992.
26. S.S. Mukherjee, S.D. Sharma, M.D. Hill, J.R. Larus, A. Rogers, J. Saltz, Efficient support for irregular applications on distributed-memory machines, in: Proceedings of the Fifth ACM SIGPLAN Symposium on Principles & Practice of Parallel Programming (PPOPP), ACM Press, July 1995, pp. 68-79; ACM SIGPLAN Notices, Vol. 30, No. 8.
27. M.C. Rinard, P.C. Diniz, Commutativity analysis: a new analysis framework for parallelizing compilers, SIGPLAN Notices 31 (5) (May 1996) 54-67; Proceedings of the ACM SIGPLAN '96 Conference on Programming Language Design and Implementation.
28. M. Sagiv, T. Reps, R. Wilhelm, Solving shape-analysis problems in languages with destructive updating, in: Conference Record of POPL '96: 23nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, St. Petersburg Beach, Florida, January 1996, pp. 16-31.
29. M. Wolfe, High Performance Compilers for Parallel Computing, Addison-Wesley, Reading, MA, 1995.
30. H. Zima, B. Chapman, Supercompilers for Parallel and Vector Computers, ACM Press, New York, NY, 1991.