This paper proposes and evaluates generational replacement schemes that suit access patterns to the World Wide Web (WWW) proxy server cache. The schemes partition a cache into generations and put frequently accessed data into older generations where entries are less likely to be replaced. Using our schemes, the hit rate per page is improved by about 5.2 percentage points over the Least Recently Used (LRU) algorithm on the basis of logs of more than 8 million accesses. This improvement reduces the number of cache misses by about 10.8 percent with respect to LRU. Our improvement is roughly twoce as good as the improvement of LRU over the First-In Frist-Out (FIFO) algorithm.
展开▼
