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.
| Original language | English (US) |
|---|---|
| Title of host publication | Proc ACM SIGPLAN 93 Conf Program Lang Des Implementation |
| Editors | Anon |
| Publisher | Publ by ACM |
| Pages | 290-299 |
| Number of pages | 10 |
| ISBN (Print) | 0897915984 |
| State | Published - Dec 1 1993 |
| Event | Proceedings of the ACM SIGPLAN '93 Conference on Programming Language Design and Implementation - Albuquerque, NM, USA Duration: Jun 23 1993 → Jun 25 1993 |
Publication series
| Name | Proc ACM SIGPLAN 93 Conf Program Lang Des Implementation |
|---|
Other
| Other | Proceedings of the ACM SIGPLAN '93 Conference on Programming Language Design and Implementation |
|---|---|
| City | Albuquerque, NM, USA |
| Period | 6/23/93 → 6/25/93 |
Fingerprint
ASJC Scopus subject areas
- Engineering(all)
Cite this
Reverse if-conversion. / Warter, Nancy J.; Mahlke, Scott A.; Hwu, Wen mei W.; Rau, B. Ramakrishna.
Proc ACM SIGPLAN 93 Conf Program Lang Des Implementation. ed. / Anon. Publ by ACM, 1993. p. 290-299 (Proc ACM SIGPLAN 93 Conf Program Lang Des Implementation).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - Reverse if-conversion
AU - Warter, Nancy J.
AU - Mahlke, Scott A.
AU - Hwu, Wen mei W.
AU - Rau, B. Ramakrishna
PY - 1993/12/1
Y1 - 1993/12/1
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=0027806309&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0027806309&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:0027806309
SN - 0897915984
T3 - Proc ACM SIGPLAN 93 Conf Program Lang Des Implementation
SP - 290
EP - 299
BT - Proc ACM SIGPLAN 93 Conf Program Lang Des Implementation
A2 - Anon, null
PB - Publ by ACM
ER -