一种针对websearch应用的缓存替换算法

摘要

We studied the access pattern of web search workloads and proposed a new replacement algorithm called ERDPLRU based on the observed access properties. The most obvious difference with other algorithms is that it adopts the placement policy based on the reused distance. Through simulation and real validation, ERDP-LRU tniformly outperforms the others for all the wcrkloads and cache size.%本文通过对websearch负载的分析,总结出负载访问模式的特点,在此基础上提出了一种新的缓存替换算法--ERDP-LRU.与传统的LRU算法的区别是它采用基于重用距离的放置策略.通过模拟实验和实际系统验证,在各种不同的典型负载和缓存大小下,ERDP-LRU的效果均好于其它替换算法.