Results 1 - 10
of
3,739
Replacement Policies for a Proxy Cache
- DEIT, Univ. di Pisa. [Online]. Available: http://www.iet.unipi.it/~luigi/caching.ps. IEEE/ACM TRANSACTIONS ON NETWORKING
, 1996
"... 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 to document ..."
Abstract
-
Cited by 150 (0 self)
- Add to MetaCart
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
Predictability of Cache Replacement Policies
- Reports of SFB/TR 14 AVACS 9, SFB/TR 14 AVACS
, 2006
"... Abstract. Hard real-time systems must obey strict timing constraints. Therefore, one needs to derive guarantees on the worst-case execution times of a system’s tasks. In this context, predictable behavior of system components is crucial for the derivation of tight and thus useful bounds. This paper ..."
Abstract
-
Cited by 49 (13 self)
- Add to MetaCart
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
General Adaptive Replacement Policies
, 2004
"... 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 policie ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
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
Cache replacement policies for . . .
, 2007
"... In IP routing, the routing table lookup is a very important operation and the speed in which it is performed determines the overall performance of Internet processors. Consequently, caching schemes are implemented in such processors to speed up these operations. A well-known factor affecting the per ..."
Abstract
- Add to MetaCart
the performance of caches is the replacement policy, which decides which entry in the cache to be replaced with a new one. In this paper, we propose two new cache replacement policies, namely LAR (Least Access and Recently used) and RLAI (Relatively Least Average Interval). With regard to the common LRU (Least
Sensitivity of Cache Replacement Policies
, 2010
"... Caches are commonly employed to hide the latency gap between memory and the CPU by exploiting locality in memory accesses. On today’s architectures a cache miss may cost several hundred CPU cycles. In order to fulfill stringent performance requirements, caches are also used in hard real-time system ..."
Abstract
-
Cited by 9 (3 self)
- Add to MetaCart
-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
Page Replacement Policies
"... 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 the ..."
Abstract
- Add to MetaCart
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
An Age-Based Inspection and Replacement Policy for Heterogeneous Components
"... An age-based inspection and replacement policy for heterogeneous components ..."
Abstract
- Add to MetaCart
An age-based inspection and replacement policy for heterogeneous components
Abstract Cache Replacement Policy Revisited
"... 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 of wor ..."
Abstract
- Add to MetaCart
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 Efficient Web Cache Replacement Policy
"... 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 f ..."
Abstract
-
Cited by 3 (0 self)
- Add to MetaCart
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
The Worst Page-Replacement Policy
"... Abstract. In this paper, we consider the question: what is the worst possible page-replacement strategy? Our goal is to devise an online strategy that has the highest possible fraction of misses as compared to the worst offline strategy. We show that there is no deterministic, online pagereplacement ..."
Abstract
- Add to MetaCart
Abstract. In this paper, we consider the question: what is the worst possible page-replacement strategy? Our goal is to devise an online strategy that has the highest possible fraction of misses as compared to the worst offline strategy. We show that there is no deterministic, online
Results 1 - 10
of
3,739