摘要
针对现有缓存替换算法考虑替换因素不够全面而导致对象命中率和延迟时间等综合指标不够优越的问题,建议采用基于缓存剩余空间变化的动态性缓存替换算法.该算法的对象命中率和延迟时间等综合性能指标比传统算法有所提高,在提升Web应用服务器性能方面具有一定的优势.
Current cache replacement algorithm fails to take some replacement factors into account, which leads to the low hit ratio for the cache and time delay. In this paper,we design a new dynamic cache replacement algorithm based on the changes of cache memory, which is superior to traditional cache replacement algorithm and has certain advantage to improve the web application server' s capability.
出处
《柳州师专学报》
2013年第3期130-132,117,共4页
Journal of Liuzhou Teachers College
关键词
缓存空间
替换算法
命中率
延迟时间
cache space, replacement algorithm, hit rate
time delay