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 closely by the (analytically and computationally tractable) expected working-set miss ratio with expected working-set size CAP, as the size of the database goes to infinity. Thier 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 independent reference model and in some generalizations of this model. This result also has implications about the effect on miss ratio of variable o...
AbstractWe investigate a widely popular least-recently-used (LRU) cache replacement algorithm with s...
We analyze a class of randomized Least-Recently-Used (LRU) cache replacement algorithms under the in...
Program reference strings generated by the LRU stack model are considered, and expressions for the ...
It is proven that under the assumption of independent references, the (apparently analytically and c...
It is proven that under the assumption of independent references, the (apparently analytically and c...
Abstract. Virtual memory of computers is usually implemented by demand paging. For some page replace...
Paging (caching) is the problem of managing a two-level memory hierarchy in order to minimize the ti...
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...
The locality of a program may be quantified by the data footprint over a time period or by the miss ...
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...
AbstractMotivated by the fact that competitive analysis yields too pessimistic results when applied ...
This paper is an extended version of the ACM SIGMETRICS 2015 paper that is accessible at https://hal...
Unknown references, also known as cold-start misses, arise during trace-driven simulation of uniproc...
AbstractWe investigate a widely popular least-recently-used (LRU) cache replacement algorithm with s...
We analyze a class of randomized Least-Recently-Used (LRU) cache replacement algorithms under the in...
Program reference strings generated by the LRU stack model are considered, and expressions for the ...
It is proven that under the assumption of independent references, the (apparently analytically and c...
It is proven that under the assumption of independent references, the (apparently analytically and c...
Abstract. Virtual memory of computers is usually implemented by demand paging. For some page replace...
Paging (caching) is the problem of managing a two-level memory hierarchy in order to minimize the ti...
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...
The locality of a program may be quantified by the data footprint over a time period or by the miss ...
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...
AbstractMotivated by the fact that competitive analysis yields too pessimistic results when applied ...
This paper is an extended version of the ACM SIGMETRICS 2015 paper that is accessible at https://hal...
Unknown references, also known as cold-start misses, arise during trace-driven simulation of uniproc...
AbstractWe investigate a widely popular least-recently-used (LRU) cache replacement algorithm with s...
We analyze a class of randomized Least-Recently-Used (LRU) cache replacement algorithms under the in...
Program reference strings generated by the LRU stack model are considered, and expressions for the ...