Abstract—In this paper, we analyze access traces to a Web proxy, looking at statistical parameters to be used in the design of a replacement policy for documents held in the cache. In the first part of this paper, we present a number of properties of the lifetime and statistics of access

presents results about the predictability of common cache replacement policies. To this end, we introduce three metrics, evict, fill, and mls that capture aspects of cache-state predictability. A thorough analysis of the LRU, FIFO, MRU, and PLRU policies yields the respective values under these metrics

We propose a general scheme for creating adaptive replacement policies with good performance and strong theoretical guarantees. Specifically, we show how to combine any two existing replacement policies so that the resulting policy provably can never perform worse than either of the original

-time systems. In such systems, upper and lower bounds on the execution time of tasks have to be computed. Different methods have been proposed for timing analysis, including measurement and static analysis. The sensitivity of a cache replacement policy expresses to what extent the initial state of the cache

General caching problem: which entry should be removed from the cache to make room for another? When should page replacement policy be invoked: • on a page fault • independent of page faults (a paging daemon) CS 3013 1 week5-pagereplace.tex Min Policy (Belady’s algorithm), Optimal Policy Discard

Cache replacement policy is a major design parameter of any memory hierarchy. The efficiency of the replacement policy affects both the hit rate and the access latency of a cache system. The higher the associativity of the cache, the more vital the replacement policy becomes. Therefore, a lot

An age-based inspection and replacement policy for heterogeneous components

Abstract. Several replacement policies for web caches have been proposed and studied extensively in the literature. Different replacement policies perform better in terms of (i) the number of objects found in the cache (cache hit), (ii) the network traffic avoided by fetching the referenced object

This paper proposes a novel methodology for cache replacement policy based on techniques of genetic algorithms. The key innovation is to allow the cache to be tuned to a given workload by using an appropriate combination of LRU, FIFO, or other information such as a history of hits and misses in a

performance evaluation, proxy caching, replacement policies, trace-driven simulation The continued growth of the World-Wide Web and the emergence of new end-user technologies such as cable modems necessitate the use of proxy caches to reduce latency, network traffic and Web server loads