Jan Reineke
Daniel Grund
ABSTRACT
No abstract available.
- C. Ferdinand and R. Wilhelm. Efficient and precise cache behavior prediction for real-time systems. Real-Time Systems, 17(2-3):131--181, 1999. Google Scholar
Digital Library
- A. Hergenhan and W. Rosenstiel. Static timing analysis of embedded software on advanced processor architectures. In DATE '00, pages 552--559, New York, NY, USA, 2000. ACM Press. Google ScholarDigital Library
- J. Reineke and D. Grund. Relative competitive analysis of cache replacement policies. In LCTES, 2008 (to appear). Google ScholarDigital Library
- J. Reineke, D. Grund, C. Berg, and R. Wilhelm. Timing predictability of cache replacement policies. Real-Time Systems, 37(2):99--122, November 2007. Google ScholarDigital Library
- D. D. Sleator and R. E. Tarjan. Amortized efficiency of list update and paging rules. Commun. ACM, 28(2):202--208, 1985. Google ScholarDigital Library
Index Terms
- Relative competitiveness of cache replacement policies
Recommendations
An analytical model for cache replacement policy performance
SIGMETRICS '06/Performance '06: Proceedings of the joint international conference on Measurement and modeling of computer systemsDue to the increasing gap between CPU and memory speed, cache performance plays an increasingly critical role in determining the overall performance of microprocessor systems. One of the important factors that a affect cache performance is the cache ...
Relative competitive analysis of cache replacement policies
LCTES '08Caches are commonly employed to hide the latency gap between memory and the CPU by exploiting locality in memory accesses. On today's architectures a cache miss may cost several hundred CPU cycles.
In order to fulfill stringent performance requirements, ...
Sensitivity of cache replacement policies
Special section on ESTIMedia'12, LCTES'11, rigorous embedded systems design, and multiprocessor system-on-chip for cyber-physical systemsThe sensitivity of a cache replacement policy expresses to what extent the execution history may influence the number of cache hits and misses during program execution. We present an algorithm to compute the sensitivity of a replacement policy. We have ...
Comments