It is proven that under the assumption of independent references, the (apparently analytically and computationally intractable) expected LRU (least recently used) miss ratio with main memory size CAP can be approximated arbitrarily dosely by the (analyt-ically and computationally tractable) expected working-set miss ratio with expected working-set size CAP, as the size of the database goes to infinity. Their common asymptotic value is given by a tractable formula involving integrals. An immediate corollary of the representation is the asymptotic independence of miss ratio from page size in the in-dependent reference model and in some generalizations of this model. This result also has implications about the effect on miss ratio of variable ...
Memory can be efficiently utilized if the dynamic memory demands of applications can be determined a...
Unknown references, also known as cold-start misses, arise during trace-driven simulation of uniproc...
We study a generalization of the classic paging problem that allows the amount of available memory t...
It is proven that under the assumption of independent references, the (apparently analytically and c...
This paper analyzes a recently published algorithm for page replacement in hierarchical paged memor...
Abstract. This paper analyzes a recently published algorithm for page replacement in hierarchical pa...
Paging (caching) is the problem of managing a two-level memory hierarchy in order to minimize the ti...
A program's working set W(t, T) at time t is the set of distinct pages among the T most recentl...
In this paper we explore the effects of locality on the performance of paging algorithms. Traditiona...
Program reference strings generated by the LRU stack model are considered, and expressions for the ...
The locality of a program may be quantified by the data footprint over a time period or by the miss ...
We analyze a class of randomized Least-Recently-Used (LRU) cache replacement algorithms under the in...
Vita.A function is developed which describes the cost of executing a program when using demand pagin...
This paper introduces a new approach to database disk buffering, called the LRU-K method. The basic ...
AbstractMotivated by the fact that competitive analysis yields too pessimistic results when applied ...
Memory can be efficiently utilized if the dynamic memory demands of applications can be determined a...
Unknown references, also known as cold-start misses, arise during trace-driven simulation of uniproc...
We study a generalization of the classic paging problem that allows the amount of available memory t...
It is proven that under the assumption of independent references, the (apparently analytically and c...
This paper analyzes a recently published algorithm for page replacement in hierarchical paged memor...
Abstract. This paper analyzes a recently published algorithm for page replacement in hierarchical pa...
Paging (caching) is the problem of managing a two-level memory hierarchy in order to minimize the ti...
A program's working set W(t, T) at time t is the set of distinct pages among the T most recentl...
In this paper we explore the effects of locality on the performance of paging algorithms. Traditiona...
Program reference strings generated by the LRU stack model are considered, and expressions for the ...
The locality of a program may be quantified by the data footprint over a time period or by the miss ...
We analyze a class of randomized Least-Recently-Used (LRU) cache replacement algorithms under the in...
Vita.A function is developed which describes the cost of executing a program when using demand pagin...
This paper introduces a new approach to database disk buffering, called the LRU-K method. The basic ...
AbstractMotivated by the fact that competitive analysis yields too pessimistic results when applied ...
Memory can be efficiently utilized if the dynamic memory demands of applications can be determined a...
Unknown references, also known as cold-start misses, arise during trace-driven simulation of uniproc...
We study a generalization of the classic paging problem that allows the amount of available memory t...