An Empirical Study of Iterative Data-Flow Analysis

@article{Cooper2006AnES,
  title={An Empirical Study of Iterative Data-Flow Analysis},
  author={K. D. Cooper and T. J. Harvey and Ken Kennedy},
  journal={2006 15th International Conference on Computing},
  year={2006},
  pages={266-276}
}
The iterative algorithm is widely used to solve instances of data-flow analysis problems. The algorithm is attractive because it is easy to implement and robust in its behavior. The theory behind the iterative algorithm establishes a set of conditions where the algorithm runs in at most d(G)+3 passes over the graph - a round-robin algorithm, running a "rapid" framework, on a reducible graph (Kam and Ulman, 1976). Fortunately, these restrictions encompass many practical analyses used in code… CONTINUE READING

Similar Papers

Figures, Tables, Results, and Topics from this paper.

Key Quantitative Results

  • The worklist version of the iterative algorithm that we explore in this paper can reduce the cost of iterative data-flow analysis by 25 to 40% compared to the naive round-robin version.