Parallelizing Programs with Recursive Data Structures

IEEE Transactions on Parallel and Distributed Systems

Volumn 1, Issue 1, 1990, Pages 35-47

  Hendren, Laurie J ^a   Nicolau, Alexandru ^b  

^a Department of Obstetrics Gynecology   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Automatic parallelization; disambiguation techniques; interference analysis; parallel programming languages; parallelizing compilers; recursive data structures

Indexed keywords

COMPUTER SYSTEMS, DIGITAL--PARALLEL PROCESSING; DATA PROCESSING--DATA STRUCTURES;

PARALLELIZING COMPILERS; RECURSIVE DATA STRUCTURES;

COMPUTER OPERATING SYSTEMS;

EID: 0025207766     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.80123     Document Type: Article

References (23)

1. R. Allen and K. Kennedy, “Automatic translation of Fortran programs to vector form,” ACM Trans. Program. Lang. Syst., vol. 9, no. 4, Oct. 1987.
2. U. Banerjee, “Speedup of ordinary programs,” Ph.D. dissertation, Univ. Illinois, Urbana-Champaign, Dep. Comput. Sci. Rep. 79-989, Oct. 1979.
3. J. P. Banning, “An efficient way to find the side effects of procedure calls and the aliases of variables,” in Proc. 6th ACM Symp. Principles Program. Lang., 1979.
4. J. Barth, “A practical interprocedural data flow analysis algorithm,” Commun. ACM, vol. 21, pp. 724-736, 1978.
5. G. Bilardi and A. Nicolau, “Adaptive bitonic sorting: An optimal parallel algorithm for shared-memory machines,” SI AM J. Computing, vol. 18, no. 2, pp. 216-228, 1989.
6. M. Burke and R. Cytron, “Interprocedural dependence analysis and parallelization,” ACM SIGPLAN Notices, vol. 21, no. 7, 1986.
7. L. J. Hendren, “Recursive data structures and parallelism detection,” Tech. Rep. TR 88-924, Cornell Univ., Ithaca, NY, June 1988.
8. L. J. Hendren and A. Nicolau, “Interference analysis tools for parallelizing programs with recursive data structures,” in Proc. Internal. Conf. Supercomputing, June 1989, pp. 205-214.
9. L. J. Hendren and A. Nicolau, “Parallelizing programs with recursive data structures,” in Proc. Internat. Conf. Parallel Process., vol. II, Software, Aug. 1989, pp. 49-56.
10. S. Horwitz, P. Pfeiffer, and T. Reps, “Dependence analysis for pointer variables,” in Proc. SIGPLAN ‘89 Conf. Program. Lang. Design and Implement., June 1989, pp. 28-40.
11. P. Hudak, “A semantic model of reference counting and its abstraction,” in Proc. 1986 ACM Conf. Lisp and Funct. Program., 1986.
12. N. D. Jones and S. Muchnick, “A flexible approach to interprocedural data flow analysis and programs with recursive data structures,” in 9th ACM Symp. Principles Program. Lang., 1982, pp. 66-74.
13. N. D. Jones and S. Muchnick, “Flow analysis and optimization of LISP-like structures,” in Program Flow Analysis, Theory, and Applications. Englewood Cliffs, NJ: Prentice Hall, 1981, ch. 4, pp. 102-131.
14. J. R. Larus and P. N. Hilfinger, “Detecting conflicts between structure accesses,” in Proc. SIGPLAN ‘88 Conf. Program. Lang. Design and Implement., June 1988, pp. 21-34.
15. J. R. Larus and P. N. Hilfinger, “Restructuring Lisp programs for concurrent execution,” in Proc. ACM/SIGPLAN PPEALS 1988—Parallel Program.: Experience with Appl., Lang., Syst., July 1988, pp. 100-110.
16. J. M. Lucassen, “Types and effects: Towards the integration of functional and imperative programming,” PhD dissertation, M.I.T., Cambridge, MA, 1987.
17. J. M. Lucassen and D. K. Gifford, “Polymorphic effect systems,” in Proc. 15th ACM Symp. Principles Program. Lang., 1988, pp. 47-57.
18. A. Neirynek, “Static analysis of aliasing and side effects in higher-order languages,” Ph.D. dissertation, Cornell Univ., Ithaca, NY, Jan. 1988.
19. A. Neirynek, P. Panangaden, and A. J. Demers, “Computation of aliases and support sets,” in Proc. 14th ACM Symp. Principles Program. Lang., 1987, pp. 274-283.
20. A. Nicolau, “Parallelism, memory anti-aliasing, and correctness for trace scheduling compilers,” Ph.D. dissertation, Yale Univ., New Haven, CT, 1984.
21. D. A. Padua and M. J. Wolfe, “Advanced compiler optimization for supercomputers,” Commun. ACM, vol. 29, no. 12, Dec. 1986.
22. C. Ruggieri and T. P. Murtagh, “Lifetme analysis of dynamically allocated objects,” in Proc. 15th ACM Symp. Principles Program. Lang., 1988, pp. 285-293.
23. M. J. Wolfe, “Optimizing supercompilers for supercomputers,” Ph.D. dissertation, Univ. Illinois, Urbana-Champaign, Oct. 1982.