185 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2000.The Partial Reverse If-Conversion Framework, the Predicate Analysis System, the Predicate Dataflow Graph, and the Program Decision Logic Optimizer are demonstrated to work synergistically in the compiler to generate efficient code for nonnumeric programs. Using predication, these techniques effectively optimize codes in the presence of complex branch control flow.U of I OnlyRestricted to the U of I community idenfinitely during batch ingest of legacy ETD
The time-predictable design of computer architectures for the use in (hard) real-time systems is bec...
Abstract To fully utilize the wide machine resources in modern high-performance microprocessors it i...
Dynamic predication has been proposed to reduce the branch misprediction penalty due to hard-to-pred...
Predicated execution is a promising architectural feature for exploiting instruction-level paralleli...
Partial redundancy elimination (PRE) is one of the most widespread optimizations in compilers. Howev...
Modern compilers must expose sufficient amounts of Instruction-Level Parallelism (ILP) to achieve th...
Architectural support for predicated execution has been proposed as a manner of attacking performanc...
Predicated execution has been used to reduce the number of branch mispredictions by eliminating hard...
277 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1997.For many applications, specul...
The performance of modern processors is increasingly de-pendent on their ability to execute multiple...
textEven after decades of research in branch prediction, branch predictors still remain imperfect, w...
We present a new constant propagation (CP) algorithm for predicated code, for which classical CP-tec...
If-conversion is a compiler technique that reduces the misprediction penalties caused by hard-to-pre...
Predicated execution enables the removal of branches wherein seg-ments of branching code are convert...
Backward program slicing identifies the program parts that might influence a particular variable at ...
The time-predictable design of computer architectures for the use in (hard) real-time systems is bec...
Abstract To fully utilize the wide machine resources in modern high-performance microprocessors it i...
Dynamic predication has been proposed to reduce the branch misprediction penalty due to hard-to-pred...
Predicated execution is a promising architectural feature for exploiting instruction-level paralleli...
Partial redundancy elimination (PRE) is one of the most widespread optimizations in compilers. Howev...
Modern compilers must expose sufficient amounts of Instruction-Level Parallelism (ILP) to achieve th...
Architectural support for predicated execution has been proposed as a manner of attacking performanc...
Predicated execution has been used to reduce the number of branch mispredictions by eliminating hard...
277 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1997.For many applications, specul...
The performance of modern processors is increasingly de-pendent on their ability to execute multiple...
textEven after decades of research in branch prediction, branch predictors still remain imperfect, w...
We present a new constant propagation (CP) algorithm for predicated code, for which classical CP-tec...
If-conversion is a compiler technique that reduces the misprediction penalties caused by hard-to-pre...
Predicated execution enables the removal of branches wherein seg-ments of branching code are convert...
Backward program slicing identifies the program parts that might influence a particular variable at ...
The time-predictable design of computer architectures for the use in (hard) real-time systems is bec...
Abstract To fully utilize the wide machine resources in modern high-performance microprocessors it i...
Dynamic predication has been proposed to reduce the branch misprediction penalty due to hard-to-pred...