The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.01 - January (1990 vol.1)
pp: 35-47
ABSTRACT
<p>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.</p>
INDEX TERMS
Index Termsautomatic parallelization; disambiguation techniques; parallelizing compilers; parallel programming languages; recursive data structures; interference; imperative language; dynamic data structures; interference analysis tools; parallelization techniques;imperative programs; dynamically updatable trees; directed acyclic graphs; regular-expression-like representation; accessible nodes; data structures; directed graphs; parallel programming; program compilers; trees (mathematics)
CITATION
L.J. Hendren, A. Nicolau, "Parallelizing Programs with Recursive Data Structures", IEEE Transactions on Parallel & Distributed Systems, vol.1, no. 1, pp. 35-47, January 1990, doi:10.1109/71.80123
55 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool