Optimal Control Dependence Computation and the Roman Chariots Problem

@article{Pingali1997OptimalCD,
  title={Optimal Control Dependence Computation and the Roman Chariots Problem},
  author={Keshav Pingali and Gianfranco Bilardi},
  journal={ACM Trans. Program. Lang. Syst.},
  year={1997},
  volume={19},
  pages={462-491}
}
The control dependence relation plays a fundamental role in program restructuring and optimization. The usual representation of this relation is the control dependence graph (CDG), but the size of the CDG can grow quadratically with the input programs, even for structured programs. In this article, we introduce the augmented postdominator tree <italic>(APT)</italic>, a data structure which can be constructed in space and time proportional to the size of the program and which supports… CONTINUE READING
Highly Cited
This paper has 53 citations. REVIEW CITATIONS

9 Figures & Tables

Topics

Statistics

05'98'00'02'04'06'08'10'12'14'16'18
Citations per Year

54 Citations

Semantic Scholar estimates that this publication has 54 citations based on the available data.

See our FAQ for additional information.