Refactoring for Data Locality
- 10 February 2009
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Computer
- Vol. 42 (2) , 62-71
- https://doi.org/10.1109/mc.2009.57
Abstract
Refactoring for data locality opens a new avenue for performance-oriented program rewriting. SLO has broken down a large part of the complexity that software developers face when speeding up programs with numerous cache misses. Therefore, we consider SLO to belong to a new generation of program analyzers. Whereas existing cache profilers (generation 1.0) highlight problems such as cache misses, second-generation analyzers (such as SLO) highlight the place to fix problems. Improving data locality is also important in hardware-based applications. SLO was already used to optimize the frame rate and energy consumption in a wavelet decoder implemented on an FPGA. In another vein, the SLO concepts could be incorporated in interactive performance debuggers and profile-directed compilers. We believe that SLO will be useful in the optimization of many data-intensive applications.Keywords
This publication has 7 references indexed in Scilit:
- Discovery of Locality-Improving Refactorings by Reuse Path AnalysisPublished by Springer Nature ,2006
- RDVIS: A Tool that Visualizes the Causes of Low Locality and Hints Program OptimizationsPublished by Springer Nature ,2005
- ValgrindElectronic Notes in Theoretical Computer Science, 2003
- Predicting whole-program locality through reuse distance analysisPublished by Association for Computing Machinery (ACM) ,2003
- SPEC CPU2000: measuring CPU performance in the New MillenniumComputer, 2000
- PC software performance tuningComputer, 1996
- Cache profiling and the SPEC benchmarks: a case studyComputer, 1994