Cited By
View all- Kovács AMeyer UMoruz GNegoescu A(2019)The optimal structure of algorithms for α-pagingInformation Processing Letters10.1016/j.ipl.2015.07.011115:12(932-938)Online publication date: 6-Jan-2019
Paging with Request Sets
Pages 67 - 81
Abstract
A generalized paging problem is considered. Each request is expressed as a set of u pages. In order to satisfy the request, at least one of these pages must be in the cache. Therefore, on a page fault, the algorithm must load into the cache at least one page out of the u pages given in the request. The problem arises in systems in which requests can be serviced by various utilities (e.g., a request for a data that lies in various web-pages) and a single utility can service many requests (e.g., a web-page containing various data). The server has the freedom to select the utility that will service the next request and hopefully additional requests in the future.
The case u=1 is simply the classical paging problem, which is known to be polynomially solvable. We show that for any u>1 the offline problem is NP-hard and hard to approximate if the cache size k is part of the input, but solvable in polynomial time for constant values of k. We consider mainly online algorithms, and design competitive algorithms for arbitrary values of k, u. We study in more detail the cases where u and k are small. We also give an algorithm which uses resource augmentation and which is asymptotically optimal for u=2.
Index Terms
- Paging with Request Sets
Recommendations
On Broadcast Disk Paging
Broadcast disks are an emerging paradigm for massive data dissemination. In a broadcast disk, data is divided into n equal-sized pages, and pages are broadcast in a round-robin fashion by a server. Broadcast disks are effective because many clients can ...
Paging for multi-core shared caches
ITCS '12: Proceedings of the 3rd Innovations in Theoretical Computer Science ConferencePaging for multi-core processors extends the classical paging problem to a setting in which several processes simultaneously share the cache. Recently, Hassidim proposed a model for multi-core paging [25], studying cache eviction policies for multi-...
Online paging and file caching with expiration times
We consider a paging problem in which each page is assigned an expiration time at the time it is brought into the cache. The expiration time indicates the latest time that the fetched copy of the page may be used. Requests that occur later than the ...
Comments
Information & Contributors
Information
Published In
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Published: 22 December 2008
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 19 Oct 2024
Other Metrics
Citations
Cited By
View all- Kovács AMeyer UMoruz GNegoescu A(2019)The optimal structure of algorithms for α-pagingInformation Processing Letters10.1016/j.ipl.2015.07.011115:12(932-938)Online publication date: 6-Jan-2019
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in