Parallelizing programs with recursive data structures
Laurie Jane Hendren, Alexandru Eugen Nicolau · IEEE Transactions on Parallel and Distributed Systems · 1990
A study is made of the problem of estimating interference in an imperative language with dynamic data structures. The authors focus on developing efficient and implementable methods for recursive data structures. In particular, they present interference analysis tools and parallelization techniques for imperative programs that contain dynamically updatable trees and directed acyclic graphs. The analysis methods are based on a regular-expression-like representation of the relationship between accessible nodes in the data structure. They authors have implemented their analysis, and they present some concrete examples that have been processed by this system.>
Cited by 219 works. doi:10.1109/71.80123
Authors
References
- Automatic translation of FORTRAN programs to vector form
- Advanced compiler optimizations for supercomputers
- A practical interprocedural data flow analysis algorithm
- An efficient way to find the side effects of procedure calls and the aliases of variables
- A flexible approach to interprocedural data flow analysis and programs with recursive data structures
- Dependence analysis for pointer variables
- Polymorphic effect systems
- Parallelizing programs with recursive data structures
- Lifetime analysis of dynamically allocated objects
- A semantic model of reference counting and its abstraction (detailed summary)