article · IEEE Transactions on Parallel and Distributed Systems · 1990

Parallelizing programs with recursive data structures

Cited by 10Abstract and details only

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.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>

Cite this paper

APA 7

Hendren, L., & Nicolau, A. (1990). Parallelizing programs with recursive data structures. IEEE Transactions on Parallel and Distributed Systems, 1(1), 35–47. https://doi.org/10.1109/71.80123

MLA 9

Hendren, Laurie, and Alexandru Nicolau. “Parallelizing programs with recursive data structures.” IEEE Transactions on Parallel and Distributed Systems, vol. 1, no. 1, 1990, pp. 35–47, https://doi.org/10.1109/71.80123.

Chicago

Hendren, Laurie, and Alexandru Nicolau. 1990. “Parallelizing programs with recursive data structures.” IEEE Transactions on Parallel and Distributed Systems 1 (1): 35–47. https://doi.org/10.1109/71.80123.

Harvard

Hendren, L. and Nicolau, A. (1990) ‘Parallelizing programs with recursive data structures’, IEEE Transactions on Parallel and Distributed Systems, 1(1), pp. 35–47. Available at: https://doi.org/10.1109/71.80123.

BibTeX

@article{hendren1990parallelizing,
  title = {{Parallelizing programs with recursive data structures}},
  author = {Hendren, Laurie and Nicolau, Alexandru},
  journal = {IEEE Transactions on Parallel and Distributed Systems},
  volume = {1},
  number = {1},
  pages = {35--47},
  year = {1990},
  doi = {10.1109/71.80123}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.