This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2013 IEEE 19th Real-Time and Embedded Technology and Applications Symposium (RTAS)
Measurement-based modeling of the cache replacement policy
Philadelphia, PA, USA USA
April 09-April 11
ISBN: 978-1-4799-0186-9
Andreas Abel, Department of Computer Science, Saarland University, Saarbrücken, Germany
Jan Reineke, Department of Computer Science, Saarland University, Saarbrücken, Germany
Modern microarchitectures employ memory hierarchies involving one or more levels of cache memory to hide the large latency gap between the processor and main memory. Cycle-accurate simulators, self-optimizing software systems, and platform-aware compilers need accurate models of the memory hierarchy to produce useful results. Similarly, worst-case execution time analyzers require faithful models, both for soundness and precision. Unfortunately, sufficiently precise documentation of the logical organization of the memory hierarchy is seldom available publicly. In this paper, we propose an algorithm to automatically model the cache replacement policy by measurements on the actual hardware. We have implemented and applied this algorithm to various popular microarchitectures, uncovering a previously undocumented cache replacement policy in the Intel Atom D525.
Citation:
Andreas Abel, Jan Reineke, "Measurement-based modeling of the cache replacement policy," rtas, pp.65-74, 2013 IEEE 19th Real-Time and Embedded Technology and Applications Symposium (RTAS), 2013
Usage of this product signifies your acceptance of the Terms of Use.