An Efficient LFU-Like Policy for Web Caches

msra(1998)

引用 31|浏览18
暂无评分
摘要
This study proposes Cubic Selection Sceme (CSS) -- a new policy for Web caches. The policy is based on the LeastFrequently Used (LFU) heuristic but takes into account object size and possibly object retrieval costs.We show that CSS can be efficiently implemented and it results in high cache performance.1. IntroductionThe World Wide Web (WWW) is often considered a major invention of the 1990s. Since its introduction in 1991,the Web has been constantly growing and so has the load on the...
更多
查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要