Reverse if-conversion

Nancy J. Warter, Scott A. Mahlke, Wen mei W. Hwu, B. Ramakrishna Rau

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 languageEnglish (US)
Title of host publicationProc ACM SIGPLAN 93 Conf Program Lang Des Implementation
Editors Anon
PublisherPubl by ACM
Pages290-299
Number of pages10
ISBN (Print)0897915984
StatePublished - Dec 1 1993
EventProceedings of the ACM SIGPLAN '93 Conference on Programming Language Design and Implementation - Albuquerque, NM, USA
Duration: Jun 23 1993Jun 25 1993

Publication series

NameProc ACM SIGPLAN 93 Conf Program Lang Des Implementation

Other

OtherProceedings of the ACM SIGPLAN '93 Conference on Programming Language Design and Implementation
CityAlbuquerque, NM, USA
Period6/23/936/25/93

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'Reverse if-conversion'. Together they form a unique fingerprint.

  • Cite this

    Warter, N. J., Mahlke, S. A., Hwu, W. M. W., & Rau, B. R. (1993). Reverse if-conversion. In Anon (Ed.), Proc ACM SIGPLAN 93 Conf Program Lang Des Implementation (pp. 290-299). (Proc ACM SIGPLAN 93 Conf Program Lang Des Implementation). Publ by ACM.