A Hierarchical Basis for Reordering Transformations

Abstract

[KKLP 80] describes graph abstraction as a process in which given a graph a mt of nodes and their internal arcs may be merged to form a compound node. Any edps incident to (or from) the set are made incident to (or from) the compound node. Our goal k to perform a modified type of graph abstraction on a layered dependence graph. We collapse the set of statements contained in a FOR or WHILE loop into a compound node that

DOI: 10.1145/800017.800539

2 Figures and Tables

Statistics

051015'86'89'92'95'98'01'04'07'10'13'16
Citations per Year

fewer than 50 Citations

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

See our FAQ for additional information.

Cite this paper

@inproceedings{Warren1984AHB, title={A Hierarchical Basis for Reordering Transformations}, author={J David Warren}, booktitle={POPL}, year={1984} }