A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
Filters
Partial redundancy elimination for access path expressions
2001
Software, Practice & Experience
Preserved Fulltext
PARTIAL REDUNDANCY ELIMINATION FOR ACCESS EXPRESSIONS Our analysis and optimization framework revolves around PRE over object access expressions. ...
We describe an approach to elimination of redundant access expressions that combines partial redundancy elimination (PRE) with type-based alias analysis (TBAA). ...
Partial redundancy elimination Our approach to optimization of access expressions is based on application of partial redundancy elimination (PRE) [1] . ...
doi:10.1002/spe.371
fatcat:f65cvjyebrhida7v6cim3ussgm
Load Elimination in the Presence of Side Effects, Concurrency and Precise Exceptions
[chapter]
2004
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Partial redundancy elimination can reduce the number of loads corresponding to field and array accesses in Java programs. ...
Partial redundancy elimination is extended to exploit this information and to broaden the optimization scope. ...
Acknowledgments We thank Matteo Corti for his contributions to our compiler infrastructure and the anonymous referees for their useful comments. ...
doi:10.1007/978-3-540-24644-2_25
fatcat:uv7fwvudczcm3jplsoplxcovri
ABCD
2000
SIGPLAN notices
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Because bounds checks may raise exceptions, they block code motion of instructions with side effects, thus preventing many useful code optimizations, such as partial redundancy elimination or instruction ...
Furthermore, because it is not expressible at level, the elimination of bounds checks can only be performed at run time, after the program is loaded. ...
Ramalingam, Tom Reps, Mark Wegman, and Zhichen Xu for discussions and their suggestions on the presentation of the paper. We also thank the anonymous referees for their suggestions. ...
doi:10.1145/358438.349342
fatcat:2l7hliy7iffxdkqw5m42ia6ff4
ABCD
2000
Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation - PLDI '00
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Because bounds checks may raise exceptions, they block code motion of instructions with side effects, thus preventing many useful code optimizations, such as partial redundancy elimination or instruction ...
Furthermore, because it is not expressible at level, the elimination of bounds checks can only be performed at run time, after the program is loaded. ...
Ramalingam, Tom Reps, Mark Wegman, and Zhichen Xu for discussions and their suggestions on the presentation of the paper. We also thank the anonymous referees for their suggestions. ...
doi:10.1145/349299.349342
dblp:conf/pldi/BodikGS00
fatcat:zr52dvlcgze4xdwn7lplxpal5m
Scalar replacement in the presence of conditional control flow
1994
Software, Practice & Experience
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
The algorithm presented here extends previous techniques for scalar replacement by allowing the presence of forward conditional control flow within loop bodies through the mapping of partial redundancy ...
elimination to scalar replacement. ...
For partially redundant array accesses, partial redundancy elimination is used to ensure that loads are inserted on the proper paths to make the array accesses fully redundant. ...
doi:10.1002/spe.4380240104
fatcat:rotzs3appnbetad4yseqb6umtm
Scalar Replacement Considering Branch Divergence
2022
Journal of Information Processing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
On the other hand, branch divergence may be increased by some traditional code optimizations based on code motion such as partial redundancy elimination (PRE) and scalar replacement (SR). ...
These methods insert some expressions into some paths, on which insertion points may be included in divergent branches. ...
Partial Redundancy Elimination An expression e is available at node n if each path from the start node s to n includes node m that has e and any operands of e are not modified on the path between m and ...
doi:10.2197/ipsjjip.30.164
fatcat:mhuijvktl5arzc7auj67dvs6mu
Memory Redundancy Elimination to Improve Application Energy Efficiency
[chapter]
2004
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
An effective compiler technique that can improve energy efficiency is memory redundancy elimination. It reduces both application execution cycles and the number of cache accesses. ...
The results show that memory redundancy elimination can significantly reduce energy in the processor clocking network and the instruction and data caches. ...
Partial Redundancy Elimination The key idea behind partial redundancy elimination (pre) and lazy code motion is to find computations that are redundant on some, but not all paths [24, 18, 11] . ...
doi:10.1007/978-3-540-24644-2_19
fatcat:hlxgoa3b3bbdvhy6g5ngcznnwu
Partial Redundancy Elimination with Predication Techniques
[chapter]
2003
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Partial redundancy elimination (PRE) techniques play an important role in optimizing compilers. ...
Many optimizations, such as elimination of redundant expressions, communication optimizations, and load-reuse optimizations, employ PRE as an underlying technique for improving the efficiency of a program ...
Introduction Partial redundancy elimination (PRE) is an important optimization technique in compilers for improving the efficiency of programs. ...
doi:10.1007/978-3-540-45209-6_38
fatcat:ee24fvlafzhuffeocgxlkz6wae
Effective partial redundancy elimination
1994
SIGPLAN notices
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
Partial redundancy elimination is a code optimization with a long history of literature and implementation. ...
Addition-
ally, some partially-dead
expressions
are eliminated.
We showed experimental
results
that demonstrate
the
effectiveness
of partial
redundancy
elimination. ...
If z is available
on every path reaching
p, then any computation
of
x at p is redundant
and may be deleted.
3. Partial
redundancy
elimination,
as described
in
Section
2. ...
doi:10.1145/773473.178257
fatcat:d67bo55365cm5bsubpzp4nk47i
Effective partial redundancy elimination
1994
Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation - PLDI '94
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
Partial redundancy elimination is a code optimization with a long history of literature and implementation. ...
Addition-
ally, some partially-dead
expressions
are eliminated.
We showed experimental
results
that demonstrate
the
effectiveness
of partial
redundancy
elimination. ...
If z is available
on every path reaching
p, then any computation
of
x at p is redundant
and may be deleted.
3. Partial
redundancy
elimination,
as described
in
Section
2. ...
doi:10.1145/178243.178257
dblp:conf/pldi/BriggsC94
fatcat:rufsz3fgrbh2pehqlbecvlnkdm
Fault-safe code motion for type-safe languages
2008
Proceedings of the sixth annual IEEE/ACM international symposium on Code generation and optimization - CGO '08
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
First, we modify the standard SSAPRE partial redundancy elimination (PRE) algorithm [18, 20] to use fault safety, rather than the traditional down safety property. ...
Our modified algorithm better exploits profile information by inserting of dangerous instructions on new paths when it is profitable and provably safe. ...
Partial redundancy elimination (PRE), for example, performs code motion to place expressions at new program points to eliminate redundant computations. ...
doi:10.1145/1356058.1356078
dblp:conf/cgo/MurphyMSSA08
fatcat:tmkjkuh32nfnjdkgn4b6gpv3xy
Distribution assignment placement: effective optimization of redistribution costs
2002
IEEE Transactions on Parallel and Distributed Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
In this article, we present a novel, aggressive approach for avoiding unnecessary remappings which works by eliminating partially dead and partially redundant distribution changes. ...
Index TermsÐData-parallel languages, High-Performance Fortran (HPF), dynamic data redistribution, data flow analysis, optimization, partially dead and partially redundant assignment elimination. ...
This research was partially supported by the Austrian Science Fund as part of Aurora Project ªLanguages and Compilers for Scientific Computationº under Contract SFB-011. ...
doi:10.1109/tpds.2002.1011416
fatcat:qtmuy6bw45azzakm22nn2pnlgq
Predicated Partial Redundancy Elimination using a Cost Analysis
2003
Parallel Processing Letters
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
Partial redundancy elimination (PRE) is a key technology for modern compilers. However traditional approaches are conservative and fail to exploit many opportunities for optimization. ...
In this paper we describe a predicated partial redundancy elimination (PPRE) approach which can potentially remove all partial redundancies. ...
Such a path contains an unnecessary re-computation of e which can be avoided by partial redundancy elimination techniques. Central to our cost model is the definition of p n . ...
doi:10.1142/s0129626403001483
fatcat:f7gubmdddbee7hf3p3kb3dbp7u
Register Pressure Sensitive Redundancy Elimination
[chapter]
1999
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Examples of redundancy elimination optimizations include common subexpression elimination, loop invariant code motion and partial redundancy elimination. ...
By setting strict register pressure limits for frequently executed (hot) blocks and higher limits for infrequently executed (cold) blocks, our algorithm permits trade-off between redundancy removal from ...
Finally, partial redundancy elimination (PRE) subsumes LICM and CSE by eliminating redundancy from instructions that are redundant along only a subset of incoming paths [1, 6, 7, 9, 13, 14, 16, 17, 19 ...
doi:10.1007/978-3-540-49051-7_8
fatcat:mtu7d2fuu5fprjaqdcn7mc62ne
Interprocedural partial redundancy elimination and its application to distributed memory compilation
1995
Proceedings of the ACM SIGPLAN 1995 conference on Programming language design and implementation - PLDI '95
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2003; you can also visit the original URL.
The file type is application/pdf.
Partial Redundancy Elimination PRE is a general scheme for suppressing partial redundancies which encompasses traditional optimizations like l o o p i n v ariant code motion and redundant code elimination ...
W e use interprocedural partial redundancy elimination for placement of communication and communication preprocessing statements while compiling for distributed memory parallel machines. ...
We will like t o a c knowledge Paul Havlak for numerous discussions we had with him on this topic. ...
doi:10.1145/207110.207157
dblp:conf/pldi/AgrawalSD95
fatcat:5istmxg2jbc55oltayhc2mu3bm
« Previous
Showing results 1 — 15 out of 44,380 results