(Enter summary)
Abstract: Optimizations performed at link time or directly applied to final program executables have received increased attention in recent years. This paper discuss the discovery and elimination of redundant load operations in the context of a link time optimizer, an optimization that we call Load Redundancy Elimination (LRE). Our experiments show that between 50% and 75% of a program's memory references can be considered redundant because they are accessing memory locations that have been referenced... (Update)
Similar documents based on text: More All
3.9: Load Redundancy Elimination on Executable Code - Fernández, Espasa, Debray
(Correct)
0.8: Speculative Alias Analysis for Executable Code - Fernández, Espasa
(Correct)
0.3: Dixie: A Retargetable Binary Instrumentation Tool - Fernández, Espasa (1999)
(Correct)
BibTeX entry: (Update)
M. Fern'andez, R. Espasa, and S. Debray. Load redundancy elimination on executable code. Technical Report UPC-DAC- http://citeseer.ist.psu.edu/432987.html More
@misc{ fern'andez-load,
author = "M. Fern'andez and R. Espasa and S. Debray",
title = "Load redundancy elimination on executable code",
text = "M. Fern'andez, R. Espasa, and S. Debray. Load redundancy elimination on
executable code. Technical Report UPC-DAC-",
url = "citeseer.ist.psu.edu/432987.html" }
Citations (may not include all citations):
1399
Compilers principles (context) - Aho, Sethi et al. - 1986
183
Profile guided code positioning (context) - Pettis, Hansen - 1990
180
Efficient contextsensitive pointer analysis for C programs
- Wilson, Lam - 1995
132
The Alpha 21264 microprocessor (context) - Kessler - 1999
103
Efficient path profiling
- Ball, Larus - 1992
89
A practical system for intermodule code optimization at link..
- Srivastava, Wall - 1992
87
Profile-guided automatic inline expansion for C programs
- Chang, Mahlke et al. - 1992
84
Optimal code motion: Theory and practice
- Knoop, Ruthing et al. - 1994
79
Computer Sciences Department (context) - Burger, Austin et al. - 1997
36
A new algorithm for partial redundancy elimination based on ..
- Chow, Chan et al. - 1997
33
Alias analysis of executable code
- Debray, Muth et al. - 1998
24
Path profile guided partial redundancy elimination using spe..
- Gupta, Berson et al. - 1998
23
Interprocedural dataflow analysis in an executable optimizer
- Goodwin - 1997
22
Load-reuse analysis: Design and evaluation
- Bodik, Gupta et al. - 1999
20
Register promotion by sparse partial redundancy elimination ..
- Lo, Chow et al. - 1998
[Article contains additional citations not shown here]
Documents on the same site (http://www.cs.arizona.edu/people/debray/papers/): More
Reasoning About Naming Systems - Bowman, Debray, Peterson (1993)
(Correct)
A Simple Program Transformation for Parallelism - Debray, Jain (1994)
(Correct)
Towards Banishing the Cut from Prolog - Debray, Warren (1990)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC