| 一种自适应cache替换策略的研究与设计 |
| |
| 引用本文： | 陈国志.一种自适应cache替换策略的研究与设计[J].数字社区&智能家居,2011(5). |
| |
| 作者姓名： | 陈国志 |
| |
| 作者单位： | 孝感学院计算机与信息科学学院; |
| |
| 摘 要： | 由于I/O工作流多样性,单纯的LRU或LFU类型的算法都无法提高缓冲区的效率。自适应双栈LRU(下文简称AD-LRU)替换算法很好的解决了上面的问题,其中LRS存放低recency的页面,HRS存放高recency且高频率的页面,利用它们的效率来调整它们的大小。实验证明,有效的提高了缓冲区的命中率。
|
| 关 键 词： | 最近最久未使用 缓冲区 新近度 频繁度 最近最少使用 页面 |
Research and Design of an Adaptive Cache Replacement Algorithm |
| |
| CHEN Guo-zhi.Research and Design of an Adaptive Cache Replacement Algorithm[J].Digital Community & Smart Home,2011(5). |
| |
| Authors: | CHEN Guo-zhi |
| |
| Affiliation: | CHEN Guo-zhi(School of Computer and Information,Xiaogan University,Xiaogan 432000,China) |
| |
| Abstract: | Neither LRU-like nor LFU-like algorithms could improve the cache efficiency under mixed I/O workloads independently. The adaptive dual-stack LRU algorithm(AD-LRU for short)can addresses on this problem.The LRS stack of AD-LRU is used to hold pages with low recency,and the HRS stack of AD-LRU stores the pages with high recency and high frequency.The stack sizes are adaptively adjusted according to their efficiency.From the results of simulation,we can see its efficiency of improving hit-ratio. |
| |
| Keywords: | LRU buffer cache recency frequency LFU page |
| 本文献已被 CNKI 等数据库收录！ |
