2018 · 16 citations · 35 references
EngineeringComputer EngineeringComputer ScienceComputer ArchitectureHardware SecurityHardware-software Co-designCache Behavior AnalysisCachingCaching StrategiesLow-power Cache DesignMemory HierarchyMemory Hierarchy DesignCache Access PatternsCache AnalysisCache DesignCache Eviction AlgorithmsCache Eviction PoliciesCache Replacement PoliciesMetadataOptimal Replacement Policy
Secure memory increases both the latency and energy required for memory accesses. To reduce these overheads, computer architects have sought to cache metadata on the processor chip, but placing metadata in a simple cache has not been as effective as expected. With a detailed analysis of metadata access patterns, we clarify myths in metadata caching and provide insight into more efficient caching strategies. We provide three observations that can help architects design future metadata caches. First, caching all metadata types improves efficiency. Second, the size of the metadata cache should match the reuse distance of the metadata. Third, when designing a better eviction policy, the traditional Belady's MIN algorithm cannot be used as the optimal replacement policy.
35
Steven Cameron Woo, Moriyoshi Ohara, Evan Torrie et al. · 1995 · 3.6K citations · Full text
Christian Bienia, Sanjeev Kumar, Jaswinder Pal Singh et al. · 2008 · 3.4K citations
Sheng Li, Jung Ho Ahn, Richard Strong et al. · 2009 · 2.4K citations
SPEC CPU2006 benchmark descriptions
John L. Henning · ACM SIGARCH Computer Architecture News · 2006 · 2K citations
A study of replacement algorithms for a virtual-storage computer
L. A. Belady · IBM Systems Journal · 1966 · 1.7K citations