中山大学学报（自然科学版）2012，Vol.51Issue(6)：54-57,62,5.
一种基于时钟自适应的改进缓存替换算法
An Improved Clock Adaptive Cache Replacement Algorithm
摘要
Abstract
The caching algorithm has a very wide range of applications in the field of storage systems, database system and Web server, the cache hit ratio is one of cache measure indicators. Based on analysis of classic cache page replacement algorithms-LRU, CLOCK, ARC and CAR, the improved clock a-daptive cache replacement algorithm-ICAR is proposed, which can more accurately manage read requests "frequency" characteristics. The experimental results show that if read requests fulfill several typical probability distribution ( for example, random distribution, the Poisson distribution and normal distribution) , ICAR can get higher cache hit rate than CAR and LRU algorithm in the majority of cases. But when the cache hit rate is very high (above 80% ) or low (less than 30% ) case, ICAR algorithm can not get better performance than CAR, it's worthy of further research.关键词
缓存/替换算法/命中率Key words
cache/ replacement algorithm/ the hit rate分类
信息技术与安全科学引用本文复制引用
魏文国,赵慧民,庄林凯,许鸿俊..一种基于时钟自适应的改进缓存替换算法[J].中山大学学报（自然科学版）,2012,51(6):54-57,62,5.基金项目
国家自然科学基金资助项目(61272381) （61272381）
广东省自然科学基金资助项目(10151063301000000) （10151063301000000）
