Reverse If-Conversion (1993) [61 citations — 8 self]
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
author = {Nancy J. Warter and Scott A. Mahlke and Wen-mei W. Hwu and B. Ramakrishna Rau},
title = {Reverse If-Conversion},
booktitle = {in Proceedings of the ACM SIGPLAN 1993 Conference on Programming Language Design and Implementation},
year = {1993},
pages = {290--299}
}
Years of Citing Articles
Bookmarks
OpenURL
Abstract:
In this paper we present a set of isomorphic control transformations that allow the compiler to apply local scheduling techniques to acyclic subgraphs of the control flow graph. Thus, the code motion complexities of global scheduling are eliminated. This approach relies on a new technique, Reverse If-Conversion (RIC), that transforms scheduled If-Converted code back to the control flow graph representation. This paper presents the predicate internal representation, the algorithms for RIC, and the correctness of RIC. In addition, the scheduling issues are addressed and an application to software pipelining is presented. 1 Introduction Compilers for processors with instruction level parallelism hardware need a large pool of operations to schedule from. In processors without support for conditional execution, branches present a scheduling barrier that limits the pool of operations to the basic block. Since basic blocks tend to have only a few operations, global scheduling techniques are ...
