Click here to skip to this page's main content.

New Feature: You can now embed Open Library books on your website!   Learn More
Last edited by WorkBot
July 20, 2010 | History

Analysis of predicated code 1 edition

Analysis of predicated code
Richard Johnson

No ebook available.

Prefer the physical book? Check nearby libraries with:

Buy this book

Add an ISBN in order to
link to booksellers

Cor blimey. There's no description for this book yet. Can you help?
There is only 1 edition record, so we'll show it here...  •  Add edition?

Analysis of predicated code
Richard Johnson, Michael Schlansker.

Published 1996 by Hewlett-Packard Laboratories, Technical Publications Dept. in Palo Alto, Calif .
Written in English.

About the Book

Abstract: "Predicated execution offers new approaches to exploiting instruction-level parallelism (ILP), but it also presents new challenges for compiler analysis and optimization. In predicated code, each operation is guarded by a boolean operand whose run-time value determines whether the operation is executed or nullified. While research has shown the utility of predication in enhancing ILP, there has been little discussion of the difficulties surrounding compiler support for predicated execution. Conventional program analysis tools (e.g. data flow analysis) assume that operations execute unconditionally within each basic block and thus make incorrect assumptions about the run-time behavior of predicated code. These tools can be modified to be correct without requiring predicate analysis, but this yields overly-conservative results in crucial areas such as scheduling and register allocation. To generate high-quality code for machines offering predicated execution, a compiler must incorporate information about relations between predicates into its analysis. We present new techniques for analyzing predicated code. Operations which compute predicates are analyzed to determine relations between predicate values. These relations are captured in a graph-based data structure, which supports efficient manipulation of boolean expressions representing facts about predicated code. This approach forms the basis for predicate-sensitive data flow analysis. Conventional data flow algorithms can be systematically upgraded to be predicate-sensitive by incorporating information about predicates. Predicate-sensitive data flow analysis yields significantly more accurate results than conventional data flow analysis when applied to predicated code."

Edition Notes

"Published as 'Analysis Techniques for Predicated Code' in the Proceedings of the 29th Annual International Symposium on Microarchitecture, pages 100-113, Paris, France, December 2-4, 1996."

"December, 1996."

Includes bibliographical references.

HP Laboratories technical report -- HPL-96-119.

The Physical Object

21 p. :
Number of pages

ID Numbers

Open Library

History Created July 20, 2010 · 1 revision Download catalog record: RDF / JSON

July 20, 2010 Created by WorkBot work found