Sciweavers

4 search results - page 1 / 1
» Emulating Optimal Replacement with a Shepherd Cache
Sort
View
MICRO
2007
IEEE
99views Hardware» more  MICRO 2007»
14 years 1 months ago
Emulating Optimal Replacement with a Shepherd Cache
Kaushik Rajan, Ramaswamy Govindarajan
ISCA
2010
IEEE
237views Hardware» more  ISCA 2010»
13 years 5 months ago
High performance cache replacement using re-reference interval prediction (RRIP)
Practical cache replacement policies attempt to emulate optimal replacement by predicting the re-reference interval of a cache block. The commonly used LRU replacement policy alwa...
Aamer Jaleel, Kevin B. Theobald, Simon C. Steely J...
ICS
2005
Tsinghua U.
14 years 28 days ago
A heterogeneously segmented cache architecture for a packet forwarding engine
As network traffic continues to increase and with the requirement to process packets at line rates, high performance routers need to forward millions of packets every second. Eve...
Kaushik Rajan, Ramaswamy Govindarajan
CASES
2003
ACM
14 years 21 days ago
Compiler-decided dynamic memory allocation for scratch-pad based embedded systems
This paper presents a highly predictable, low overhead and yet dynamic, memory allocation strategy for embedded systems with scratch-pad memory. A scratch-pad is a fast compiler-m...
Sumesh Udayakumaran, Rajeev Barua