摘要： 在LRU算法的基础上，提出一种改进的Web合作缓存置换算法。该算法针对不同大小的文档采取不同的存储策略，如增加小文档在缓存组中的存储数量，以提高其本地缓存的命中率，减少大文档在缓存组中存储的数量，以节约整个缓存组的空间。仿真实验结果表明该算法能够获得较好的性能。

关键词: 缓存, LRU算法, 命中率

Abstract: On basis of LRU algorithm, this paper proposes an improved replacement algorithm for cooperative Web cache, which uses different storage strategies aiming at different sizes of documents. For example, small documents are increased to gain high locally hit rates while reducing big documents to economize the cache space. Simulation experimental results show this algorithm can achieve better performance, and is effective.

Key words: cache, LRU algorithm, hit rate

中图分类号: 

• TP301.6