%0 Journal Article %1 Havlak:1997:NRI %A Havlak, Paul %D 1997 %I ACM %J ACM Trans. Program. Lang. Syst. %K Benchmark Compiler Loop Nesting Optimization Scala %N 4 %P 557--567 %R 10.1145/262004.262005 %T Nesting of Reducible and Irreducible Loops %V 19 %X Recognizing and transforming loops are essential steps in any attempt to improve the running time of a program. Aggressive restructuring techniques have been developed for single-entry (reducible) loops, but restructurers and the dataflow and dependence analysis they rely on often give up in the presence of multientry (irreducible) loops. Thus one irreducible loop can prevent the improvement of all loops in a procedure. This article give an algorithm to build a loop nesting tree for a procedure with arbitrary control flow. The algorithm uses definitions of reducible and irreducible loops which allow either kind of loop to be nested in the other. The tree construction algorithm, an extension of Tarjan's algorithm for testing reducibility, runs in almost linear time. In the presence of irreducible loops, the loop nesting tree can depend on the depth-first spanning tree used to build it. In particular, the header node representing a reducible loop in one version of the loop nesting tree can be the representative of an irreducible loop in another. We give a normalization method that maximizes the set of reducible loops discovered, independent of the depth-first spanning tree used. The normalization require the insertion of at most one node and one edge per reducible loop.

@article{Havlak:1997:NRI, abstract = {Recognizing and transforming loops are essential steps in any attempt to improve the running time of a program. Aggressive restructuring techniques have been developed for single-entry (reducible) loops, but restructurers and the dataflow and dependence analysis they rely on often give up in the presence of multientry (irreducible) loops. Thus one irreducible loop can prevent the improvement of all loops in a procedure. This article give an algorithm to build a loop nesting tree for a procedure with arbitrary control flow. The algorithm uses definitions of reducible and irreducible loops which allow either kind of loop to be nested in the other. The tree construction algorithm, an extension of Tarjan's algorithm for testing reducibility, runs in almost linear time. In the presence of irreducible loops, the loop nesting tree can depend on the depth-first spanning tree used to build it. In particular, the header node representing a reducible loop in one version of the loop nesting tree can be the representative of an irreducible loop in another. We give a normalization method that maximizes the set of reducible loops discovered, independent of the depth-first spanning tree used. The normalization require the insertion of at most one node and one edge per reducible loop.}, acmid = {262005}, added-at = {2016-02-11T18:14:02.000+0100}, author = {Havlak, Paul}, biburl = {https://www.bibsonomy.org/bibtex/29b0ff7613a00916c19038228c9eac986/gron}, description = {Nesting of reducible and irreducible loops}, doi = {10.1145/262004.262005}, interhash = {16c6894d17fe241ee51a86eb9bef2fe7}, intrahash = {9b0ff7613a00916c19038228c9eac986}, issn = {0164-0925}, issue_date = {July 1997}, journal = {ACM Trans. Program. Lang. Syst.}, keywords = {Benchmark Compiler Loop Nesting Optimization Scala}, month = jul, number = 4, numpages = {11}, pages = {557--567}, publisher = {ACM}, timestamp = {2016-02-11T18:14:02.000+0100}, title = {Nesting of Reducible and Irreducible Loops}, volume = 19, year = 1997 }