Load redundancy elimination on executable code

Manel Fernández, Roger Espasa, Saumya K Debray

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

Abstract

Optimizations performed at linkt ime 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 linkt ime 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 in the range of 3% to 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)
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages221-229
Number of pages9
Volume2150
ISBN (Print)3540424954, 9783540424956
StatePublished - 2001
Event7th European Conference on Parallel Computing, Euro-Par 2001 - Manchester, United Kingdom
Duration: Aug 28 2001Aug 31 2001

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2150
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other7th European Conference on Parallel Computing, Euro-Par 2001
CountryUnited Kingdom
CityManchester
Period8/28/018/31/01

    Fingerprint

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Fernández, M., Espasa, R., & Debray, S. K. (2001). Load redundancy elimination on executable code. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2150, pp. 221-229). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2150). Springer Verlag.