Sciweavers

45 search results - page 1 / 9
» Optimal and Efficient Speculation-Based Partial Redundancy E...
Sort
View
CGO
2003
IEEE
13 years 8 months ago
Optimal and Efficient Speculation-Based Partial Redundancy Elimination
Existing profile-guided partial redundancy elimination (PRE) methods use speculation to enable the removal of partial redundancies along more frequently executed paths at the expe...
Qiong Cai, Jingling Xue
PLDI
1995
ACM
13 years 8 months ago
Interprocedural Partial Redundancy Elimination and its Application to Distributed Memory Compilation
Partial Redundancy Elimination PRE is a general scheme for suppressing partial redundancies which encompasses traditional optimizations like loop invariant code motion and redun...
Gagan Agrawal, Joel H. Saltz, Raja Das
LCTRTS
2004
Springer
13 years 10 months ago
Optimizing for space and time usage with speculative partial redundancy elimination
Bernhard Scholz, R. Nigel Horspool, Jens Knoop
EUROPAR
2003
Springer
13 years 9 months ago
Partial Redundancy Elimination with Predication Techniques
Partial redundancy elimination (PRE) techniques play an important role in optimizing compilers. Many optimizations, such as elimination of redundant expressions, communication opti...
Bernhard Scholz, Eduard Mehofer, R. Nigel Horspool
PADO
2001
Springer
13 years 9 months ago
Deriving Pre-conditions for Array Bound Check Elimination
Abstract. We present a high-level approach to array bound check optimization that is neither hampered by recursive functions, nor disabled by the presence of partially redundant ch...
Wei-Ngan Chin, Siau-Cheng Khoo, Dana N. Xu