An Improved Clock Adaptive Cache Replacement Algorithm

WEI Wenguo; ZHAO Huimin; ZHUANG Linkai; XU Hongjun

您当前的位置：

首页 >

文章列表页 >

An Improved Clock Adaptive Cache Replacement Algorithm

更新时间：2023-12-11

- An Improved Clock Adaptive Cache Replacement Algorithm
- Acta Scientiarum Naturalium Universitatis SunYatseni Vol. 51, Issue 6, (2012)
- 作者机构：
  
  广东技术师范学院电子与信息学院,广东,广州,510665
- 作者简介：
- 基金信息：
- DOI：
  CLC：
- Published：2012，
  
  Published Online：25 November 2012，
扫描看全文
WEI Wenguo, ZHAO Huimin, ZHUANG Linkai, et al. An Improved Clock Adaptive Cache Replacement Algorithm. [J]. Acta Scientiarum Naturalium Universitatis SunYatseni 51(6).(2012)
DOI：

WEI Wenguo, ZHAO Huimin, ZHUANG Linkai, et al. An Improved Clock Adaptive Cache Replacement Algorithm. [J]. Acta Scientiarum Naturalium Universitatis SunYatseni 51(6).(2012) DOI：

摘要

缓存算法在存储系统、数据库、Web服务器等计算机领域有很广泛的应用，缓存命中率是衡量缓存算法优劣的指标之一，对经典的缓存页面替代算法LRU、CLOCK、ARC和CAR进行了比较和分析，提出了一种基于时钟自适应的改进缓存替换算法——ICAR，它能更精确地对读请求的“频率”特性进行管理。实验结果表明，在几种典型的概率分布（例如随机分布、泊松分布和正态分布）的读请求进入缓存的情况下，ICAR在大部分情况下都比CAR和LRU算法有更高的缓存命中率。但是当缓存命中率相当高（高于80%）或者比较低（低于30%）的情况下，ICAR算法并不能总是表现出更好的性能，值得进一步研究。

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 adaptive 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.

关键词

缓存替换算法命中率

Keywords

cachereplacement algorithmthe hit rate

references

Views

500

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

A Strategy of Designing In Network Cache Size in Information-Centric Networking

Related Author

CAI Jun

ZHAO Huimin

WEI Wenguo

LIU Waixi

Related Institution

School of Electronic and Information , Guang Dong Polytechnic Normal University



Postal code：510275
Tel：020-84112585，84113223 Email：xuebaozr@mail.sysu.edu.cn
Technical support is provided by Beijing Founder electronics co., LTD 京ICP备09064830号-19 京公网安备11010802024621
It is recommended to read the content of this site in Chrome&IE9+. Please switch to extreme mode in browser 360.
Cookies We use cookies to help provide and enhance our service and tailor content. By continuing, you agree to the use of cookies.

⁰