@article{oai:ipsj.ixsq.nii.ac.jp:00013181, author = {Noritaka, Osawa and Toshitsugu, Yuba and Katsuya, Hakozaki and Noritaka, Osawa and Toshitsugu, Yuba and Katsuya, Hakozaki}, issue = {3}, journal = {情報処理学会論文誌}, month = {Mar}, note = {This paper proposes and evaluates generational replacement schemes suitable for patterns of access to World Wide Web(WWW)proxy server caches.The schemes partition a cache into generations and put frequently accessed data into older generations where entries are less likely to be replaced.With our schemes the hit rate per page is about 5.2 percentage points higher than with the Least Recently Used(LRU)algorithm using logs of more than 8 million accesses.This improvement reduces the number of cache misses by about 10.8 percent with respect to the LRU-roughly twice as good as the LRU's improvement over the First-In First-Out(FIFO)algorithm., This paper proposes and evaluates generational replacement schemes suitable for patterns of access to World Wide Web(WWW)proxy server caches.The schemes partition a cache into generations and put frequently accessed data into older generations where entries are less likely to be replaced.With our schemes,the hit rate per page is about 5.2 percentage points higher than with the Least Recently Used(LRU)algorithm,using logs of more than 8 million accesses.This improvement reduces the number of cache misses by about 10.8 percent with respect to the LRU-roughly twice as good as the LRU's improvement over the First-In First-Out(FIFO)algorithm.}, pages = {760--768}, title = {An Evaluation of Generational Replacement Schemes Based on WWW Caching Proxy Server Logs}, volume = {39}, year = {1998} }