.png){kind=icon}
返回
Dual queues cache replacement algorithm based on sequentiality detection
.png){kind=icon}
PRE
AI
DOI：10.1007/s11432-011-4213-z.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Caching is one of the most effective and commonly used mechanisms to improve performance of storage servers. Replacement policies play a critical role in the cache design due to the limited cache capacity. Recent researchers devote themselves to achieve high hit ratios, but rarely pay attention to reducing miss penalty during the design of a replacement policy. To address the issue, this paper presents a novel algorithm, called dual queues cache replacement algorithm based on sequentiality detection, which prefers to drop sequential blocks and protect random blocks. The buffer cache can serve more subsequent random read requests, so the cache miss penalty could be decreased significantly. Moreover, the algorithm makes use of two queues separately maintaining new blocks and old blocks to avoid the degradation of hit ratios. Our trace-driven simulation results show that it performs better than LRU and ARC for a wide range of cache sizes and workloads.
Keyword:
caching mechanism
replacement policy
hit ratio
miss penalty
sequentiality detection
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.6
论文数:
4.9K
被引数:
8.9K
机构
引用论文
Impact Assessment of Installed Photovoltaic on Fuel Cell Hybrid Electric Vehicle Considering Fast Identification of Power Changes.png)
2020 International Youth Conference on Radio Electronics, Electrical and Power Engineering (REEPE)
2020 International Youth Conference on Radio Electronics, Electrical and Power Engineering (REEPE)IF0
PREAI
分享收藏 没有更多内容
没有更多内容