首页 | 官方网站   微博 | 高级检索  
     

一种数据块关系指导的缓存替换方法
引用本文:朱旭东,柯剑,那文武,许鲁.一种数据块关系指导的缓存替换方法[J].计算机研究与发展,2009,46(Z2).
作者姓名:朱旭东  柯剑  那文武  许鲁
作者单位:1. 中国科学院计算技术研究所,北京,100190;中国科学院研究生院,北京,100049
2. 中国科学院计算技术研究所,北京,100190
基金项目:国家"九七三"重点基础研究发展计划基金项目,国家"八六三"高技术研究发展计划基金项目 
摘    要:提出了一种数据块关系指导的缓存替换方法BDP(block correlations directed replacement policy).数据块关系所表示的空间局部性可以用来指导存储系统的缓存替换策略.BDP利用历史访问信息和实时访问信息,预测数据块未来的空间局部性特征,并设计数据块驻留时间的控制策略,减少现有替换算法对空间局部性预测失败带来的失效惩罚.同时给出了BDP的有效缓存模型.模拟结果显示,对大多数实际系统工作负载,BDP的失效率相对LRU算法下降11%~38%,优于现有的考虑空间局部性的替换算法.

关 键 词:缓存替换  数据块关系  空间局部性  缓存模型

A Replacement Algorithm Directed by Block Correlations
Zhu Xudong,Ke Jian,Na Wenwu,Xu Lu.A Replacement Algorithm Directed by Block Correlations[J].Journal of Computer Research and Development,2009,46(Z2).
Authors:Zhu Xudong  Ke Jian  Na Wenwu  Xu Lu
Abstract:A block correlations directed cache replacement policy,BDP,is proposed.The spatial locality presented by block correlations can be used to direct cache replacement algorithm used in storage systems.BDP utilizes both history and real-time access information to accurately predict block's future access characteristics.A policy is also designed to control block's resident time so as to reduce the penalty incurred by the failure of predication.In addition,a validated cache model is given.Simulation results show that,for most real system workloads,BDP can reduce the cache miss ratio of classic cache replacement algorithms by 11%~38% and is better than other spatial locality based cache replacement algorithms.
Keywords:cache replacement  block correlations  spatial locality  cache model
本文献已被 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号