Abstractions for Recursive Pointer Data Structures: Improving the Analysis and Transformation of Imperative Programs

ACM SIGPLAN Notices

Volumn 27, Issue 7, 1992, Pages 249-260

  Hendren, Laurie J ^a   Hummell, Joseph ^b   Nicolau, Alexandru ^b  

^a MCGILL UNIVERSITY   (Canada)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PARALLEL PROCESSING SYSTEMS; PROGRAM COMPILERS;

ALIAS ANALYSIS; ARRAY REFERENCE ANALYSIS; IMPERATIVE PROGRAM TRANSFORMATIONS; POINTER DATA STRUCTURE ANALYSIS;

COMPUTER PROGRAMMING;

EID: 0026985242     PISSN: 03621340     EISSN: 15581160     Source Type: Journal    
DOI: 10.1145/143103.143138     Document Type: Article

References (30)

1. Randy Allen and Ken Kennedy. Automatic translation of FORTRAN programs to vector form. ACM Transactions on Programming Languages and Systems, 9(4), October 1987.
2. A. Aiken and A. Nicolau. Optimal Loop Parallelization. In. In Proceedings of the SIGPLAN 1988 Conference on Programming Language Design and Implementation, pages 308-317, June 1988.
3. A. Aiken and A. Nicolau. Perfect Pipelining: A new loop parallelization technique. In Proceedings of the 1988 European Symposium on Programming. Springer Verlag Lecture Notes in Computer Science No.300, March 1988.
4. Andrew W. Appel. An Efficient Program for Many-Body Simulation. SIAM J. Sci. Stat. Comput., 6(1):85-103, 1985.
5. Alfred V. Aho, Ravi Sethi, and Jeffrey D. Ullman. Compilers: Principles, Techniques, and Tools. Addison-Wesley, 1987.
6. Josh Barnes and Piet Hut. A Hierarchical O(NlogN) Force-Calculation Algorithm. Nature, 324:446-449, 4 December 1986. The code can be obtained from Prof. Barnes at the University of Hawaii.
7. CONVEX Computer Corporation. CONVEX C and FORTRAN Language Reference Manuals. 1990.
8. D.R. Chase, M. Wegman, and F.K. Zadek. Analysis of pointers and structures. In Proceedings of the SIGPLAN ‘90 Conference on Programming Language Design and Implementation, pages 296-310, 1990.
9. Kemal Ebcioglu and Toshio Nakatani. A New Compilation Technique for Parallelizing Loops Loops with Unpredictable Branches on a VLIW Architecture. In Proceedings of the Second Workshop on Programming Languages and Compilers for Parallel Computing, Research Monographs in Parallel and Distributed Computing. MIT-Press, 1989.
10. Josef Grosch. Tool support for data structures.
11. Structured Programming, 12(1):31-38, January 1991.
12. Vincent A. Guarna Jr. A technique for analyzing pointer and structure references in parallel restructuring compilers. In Proceedings of the International Conference on Parallel Processing, volume 2, pages 212-220, 1988.
13. Laurie J. Hendren. Parallelizing Programs with Recursive Data Structures. PhD thesis, Cornell University, April 1990. TR 90-1114.
14. Laurie J. Hendren and Guang R. Gao. Designing Programming Languages for Analyzability: A Fresh Look at Pointer Data Structures. In. In Proceedings of the 4th IEEE International Conference on Computer Languages (to appear, also available as ACAPS Technical Memo 28, McGill University), April 1992.
15. Laurie J. Hendren and Alexandru Nicolau. Parallelizing Programs with Recursive Data Structures. IEEE Trans. on Parallel and Distributed Computing, 1(1):35-47, January 1990.
16. Susan Horwitz, Phil Pfeiffer, and Thomas Reps. Dependence analysis for pointer variables. In Proceedings of the SIGPLAN ‘89 Conference on Programming Language Design and Implementation, pages 28-40, June 1989.
17. N. D. Jones and S. S. Muchnick. Program Flow Analysis, Theory and Applications, chapter 4, Flow Analysis and Optimization of LISP-like Structures, pages 102-131. Prentice-Hall, 1981.
18. David Klappholz, Apostolos D. Kallis, and Xiangyun Kang. Refined C: An Update. In David Gelernter, Alexandru Nicolau, and David Padua, editors, Languages and Compilers for Parallel Computing, pages 331-357. The MIT Press, 1990.
19. Monica Lam. Software Pipelining: An Effective Scheduling Technique for VLIW Machines. In Proceedings of the SIGPLAN 1988 Conference on Programming Language Design and Implementation, pages 318-328, June 1988.
20. James R. Larus. Restructuring Symbolic Programs for Concurrent Execution on Multiprocessors. PhD thesis, University of California, Berkeley, 1989.
21. James R. Larus and Paul N. Hilfinger. Detecting conflicts between structure accesses. In Proceedings of the SIGPLAN ‘88 Conference on Programming Language Design and Implementation, pages 21-34, June 1988.
22. James R. Larus and Paul N. Hilfinger. Restructuring Lisp programs for concurrent execution. In Proceedings of the ACM/SIGPLAN PPEALS 1988 - Parallel Programming: Experience with Applications, Languages and Systems, pages 100-110, July 1988.
23. Michael Metcalf and John Reid. Fortran 90 Explained. Oxford University Press, 1990.
24. A. Nicolau, R. Potasman, and H. Wang. Register Allocation, Renaming and their impact on Finegrain Parallelism. In Proceedings of the Fourth Workshop on Languages and Compilers for Parallel Computing, August 1991.
25. David A. Padua and Michael J. Wolfe. Advanced compiler optimization for supercomputers. Communications of the ACM, 29(12), December 1986.
26. B. R. Rau and C. D. Glaeser. Efficient Code Generation for Horizontal Architectures: Compiler Techniques and Architectural Support. In Proceedings of the 9th Symposium on Computer Architecture, April 1982.
27. Hanan Samet. The Design and Analysis of Spatial Data Structures. Addison-Wesley, 1990.
28. Jon A. Solworth. The PARSEQ Project: An Interim Report. In David Gelernter, Alexandru Nicolau, and David Padua, editors, Languages and Compilers for Parallel Computing, pages 490-510. The MIT Press, 1990.
29. Thomas A. Standish. Data Structure Techniques. Addison-Wesley, 1980.
30. Hans Zima and Barbara Chapman. Supercompilers for Parallel and Vector Computers. ACM Press, 1990.