H-NMRU: An efficient cache replacement policy with low area

DOI10.1007/S10766-010-0130-9zbMATH Open1206.68074OpenAlexW1975406773MaRDI QIDQ987755FDOQ987755

Authors: Sourav Roy 

Publication date: 13 August 2010

Published in: International Journal of Parallel Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10766-010-0130-9

Recommendations

• On the complexity of cache analysis for different replacement policies
• A systolic LRU processor and its top-down development
• Dynamic tag reduction for low-power caches in embedded systems with virtual memory
• Finding optimal non-datapath caching strategies via network flow
• Approximate analysis of LRU in the case of short term correlations

zbMATH Keywords

cachereplacement policybranch target bufferLRUH-NMRUPLRU

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14) Computer system organization (68M99)

Uses Software

• SPEC Benchmarks

This page was built for publication: H-NMRU: An efficient cache replacement policy with low area

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q987755)