Parallelizing programs with recursive data structures
- 1 January 1990
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 1 (1) , 35-47
- https://doi.org/10.1109/71.80123
Abstract
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.Keywords
This publication has 16 references indexed in Scilit:
- Dependence analysis for pointer variablesPublished by Association for Computing Machinery (ACM) ,1989
- Detecting conflicts between structure accessesPublished by Association for Computing Machinery (ACM) ,1988
- Polymorphic effect systemsPublished by Association for Computing Machinery (ACM) ,1988
- Restructuring Lisp programs for concurrent executionPublished by Association for Computing Machinery (ACM) ,1988
- Computation of aliases and support setsPublished by Association for Computing Machinery (ACM) ,1987
- Interprocedural dependence analysis and parallelizationACM SIGPLAN Notices, 1986
- A semantic model of reference counting and its abstraction (detailed summary)Published by Association for Computing Machinery (ACM) ,1986
- A flexible approach to interprocedural data flow analysis and programs with recursive data structuresPublished by Association for Computing Machinery (ACM) ,1982
- An efficient way to find the side effects of procedure calls and the aliases of variablesPublished by Association for Computing Machinery (ACM) ,1979
- A practical interprocedural data flow analysis algorithmCommunications of the ACM, 1978