Integrating replacement policies in StorM: an extensible approach
Abstract
Reference
Index Terms
- Integrating replacement policies in StorM: an extensible approach
Recommendations
Simple penalty-sensitive replacement policies for caches
CF '06: Proceedings of the 3rd conference on Computing frontiersClassic cache replacement policies assume that miss costs are uniform. However, the correlation between miss rate and cache performance is not as straightforward as it used to be. Ultimately, the true cost measure of a miss should be the penalty, i.e. ...
Improving Performance in Sub-Block Caches with Optimized Replacement Policies
Special Issues on Neuromorphic Computing and Emerging Many-Core Systems for Exascale ComputingRecent advances in computer processor design have led to the introduction of sub-blocking to cache architectures. Sub-block caches reduce the tag area and power overhead in caches without reducing the effective cache size by using fewer tags to index ...
Instruction Cache Replacement Policies and Organizations
Instruction cache replacement policies and organizations are analyzed both theoretically and experimentally. Theoretical analyses are based on a new model for cache referencesthe loop model. First the loop model is used to study replacement policies and ...
Comments
Information & Contributors
Information
Published In
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Qualifiers
- Article
Conference
Acceptance Rates
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 103Total Downloads
- Downloads (Last 12 months)61
- Downloads (Last 6 weeks)14
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in