Load redundancy elimination on executable code

Manel Fernández, Roger Espasa, Saumya Debray

Research output: Contribution to journalArticlepeer-review

1 Scopus citations


Optimizations performed at link time or directly applied to final program executables have received increased attention in recent years. This paper discusses 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 less than 200-400 instructions away. We then present three profile-based LRE algorithms targeted at optimizing away these redundancies. Our results show that between 5% and 30% of the redundancy detected can indeed be eliminated, which translates into program speedups of around 8%. We also test our algorithm assuming different cache latencies, and show that, if latencies continue to grow, the load redundancy elimination will become more important.

Original languageEnglish (US)
Pages (from-to)979-997
Number of pages19
JournalConcurrency Computation Practice and Experience
Issue number10
StatePublished - Aug 2003
Externally publishedYes


  • Link-time optimizations
  • Profile-guided optimizations
  • Redundancy elimination

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Software
  • Computer Science Applications
  • Computer Networks and Communications
  • Computational Theory and Mathematics


Dive into the research topics of 'Load redundancy elimination on executable code'. Together they form a unique fingerprint.

Cite this