Please use this identifier to cite or link to this item: https://doi.org/10.1109/CGO.2007.12
Title: Ubiquitous memory introspection
Authors: Zhao, Q.
Rabbah, R.
Amarasinghe, S.
Rudolph, L.
Wong, W.-F. 
Issue Date: 2007
Source: Zhao, Q.,Rabbah, R.,Amarasinghe, S.,Rudolph, L.,Wong, W.-F. (2007). Ubiquitous memory introspection. International Symposium on Code Generation and Optimization, CGO 2007 : 299-311. ScholarBank@NUS Repository. https://doi.org/10.1109/CGO.2007.12
Abstract: Modern memory systems play a critical role in the performance of applications, but a detailed understanding of the application behavior in the memory system is not trivial to attain. It requires time consuming simulations and detailed modeling of the memory hierarchy, often using long address traces. It is increasingly possible to access hardware performance counters to count relevant events in the memory system, but the measurements are coarse-grained and better suited for performance summaries than providing instruction level feedback. The availability of a low cost, online, and accurate methodology for deriving fine-grained memory behavior profiles can prove extremely useful for runtime analysis and optimization of programs. This paper presents a new methodology for Ubiquitous Memory Introspection (UMI). It is an online and lightweight methodology that uses fast mini-simulations to analyze short memory access traces recorded from frequently executed code regions. The simulations provide profiling results at varying granularities, down to that of a single instruction or address. UMI naturally complements runtime optimizations and enables new opportunities for online memory specific optimizations. We present a prototype runtime system implementing UMI. The prototype has an average runtime overhead of 14%. This overhead is only 1% more than a state of the art binary instrumentation tool. We used 32 benchmarks, including the full suite of SPEC CPU2000 benchmarks, for evaluation. We show that the mini-simulations accurately reflect the cache performance of two existing memory systems, an Intel Pentium 4 and an AMD Athlon MP (K7). We also demonstrate that UMIpredicts delinquent load instructions with an 88% rate of accuracy for applications with a relatively high number of cache misses, and 61% overall. The online profiling results are used at runtime to implement a simple software prefetching strategy that achieves an overall speedup of 64% in the best case. © 2007 IEEE.
Source Title: International Symposium on Code Generation and Optimization, CGO 2007
URI: http://scholarbank.nus.edu.sg/handle/10635/40318
ISBN: 0769527647
DOI: 10.1109/CGO.2007.12
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

20
checked on Dec 11, 2017

Page view(s)

117
checked on Dec 9, 2017

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.