Argonne National Laboratory

Calculating Reuse Distance from Source Code

TitleCalculating Reuse Distance from Source Code
Publication TypeReport
Year of Publication2016
AuthorsNarayanan, SHK, Hovland, PD
Abstract

The efficient use of a system is of paramount importance in high-performance computing. Applications need to be engineered for future systems even before the architecture of such a system is clearly known. Static performance analysis that generates performance bounds is one way to approach the task of understanding application behavior. Performance bounds provide an upper limit on the performance of an application on a given architecture. Predicting cache hierarchy behavior and accesses to main memory is a requirement for accurate performance bounds. This work presents our static reuse distance algorithm to generate reuse distance histograms. We then use these histograms to predict cache miss rates. Experimental results for kernels studied show that the approach is accurate.

 

PDFhttp://www.mcs.anl.gov/papers/P5513-0116.pdf