Paging (caching) is the problem of managing a two-level memory hierarchy in order to minimize the time required to process a sequence of memory accesses. In order to measure this quantity, which we refer to as the total memory access time, we define the system parameter miss penalty to represent the extra time required to access slow memory. We also introduce the system parameter page size. In the context of paging, miss penalty is quite large, so most previous studies of on-line paging have implicitly set miss penaltyD 1 in order to simplify the model. We show that this seemingly insignificant simplification substantially alters the precision of derived results. For example, previous studies have essentially ignored page size. Consequently...
AbstractThe paging problem is defined as follows: we are given a two-level memory system, in which o...
We prove strong NP-completeness for the four variants of caching with multi-size pages. These four v...
This paper describes a model for studying the cache performance of algorithms in a direct-mapped cac...
AbstractMotivated by the fact that competitive analysis yields too pessimistic results when applied ...
AbstractThe Sleator-Tarjan competitive analysis of paging (Comm. ACM28 (1985), 202-208) gives us the...
In this paper we explore the effects of locality on the performance of paging algorithms. Traditiona...
Caching (also known as paging) is a classical problem concerning page re- placement policies in two-...
Caching (paging) is a well-studied problem in online algorithms, usually studied under the assumptio...
It has been experimentally observed that LRU and variants thereof are the preferred strategies for o...
We study a generalization of the classic paging problem that allows the amount of available memory t...
We study the writeback-aware caching problem, a variant of classic paging where paging requests that...
Recall our three goals for the mathematical analysis of algorithms — the Explanation Goal, the Compa...
We tackle the problem of online paging on two level memories with arbitrary associativity (including...
AbstractIn this paper we extend the Paging Problem to the case in which each request specifies a set...
The paging problem is that of deciding which pages to keep in a memory of k pages in order to minimi...
AbstractThe paging problem is defined as follows: we are given a two-level memory system, in which o...
We prove strong NP-completeness for the four variants of caching with multi-size pages. These four v...
This paper describes a model for studying the cache performance of algorithms in a direct-mapped cac...
AbstractMotivated by the fact that competitive analysis yields too pessimistic results when applied ...
AbstractThe Sleator-Tarjan competitive analysis of paging (Comm. ACM28 (1985), 202-208) gives us the...
In this paper we explore the effects of locality on the performance of paging algorithms. Traditiona...
Caching (also known as paging) is a classical problem concerning page re- placement policies in two-...
Caching (paging) is a well-studied problem in online algorithms, usually studied under the assumptio...
It has been experimentally observed that LRU and variants thereof are the preferred strategies for o...
We study a generalization of the classic paging problem that allows the amount of available memory t...
We study the writeback-aware caching problem, a variant of classic paging where paging requests that...
Recall our three goals for the mathematical analysis of algorithms — the Explanation Goal, the Compa...
We tackle the problem of online paging on two level memories with arbitrary associativity (including...
AbstractIn this paper we extend the Paging Problem to the case in which each request specifies a set...
The paging problem is that of deciding which pages to keep in a memory of k pages in order to minimi...
AbstractThe paging problem is defined as follows: we are given a two-level memory system, in which o...
We prove strong NP-completeness for the four variants of caching with multi-size pages. These four v...
This paper describes a model for studying the cache performance of algorithms in a direct-mapped cac...