Access the full text.
Sign up today, get DeepDyve free for 14 days.
S. Albers, Sanjeev Arora, S. Khanna (1999)
Page replacement for general caching problems
(c) For each edge e , there are exactly H pages associated with e requested in I , all the ¯ a e -pages
S. Irani (1997)
Page replacement with multi-size pages and applications to Web caching
N. Bansal, Amit Chakrabarti, Amir Epstein, B. Schieber (2006)
A quasi-PTAS for unsplittable flow on line graphs
N Bansal, N Buchbinder, J Naor (2012)
Randomized competitive algorithms for generalized cachingSIAM J. Comput., 41
A. Fiat, R. Karp, M. Luby, L. McGeoch, D. Sleator, N. Young (1991)
Competitive Paging AlgorithmsArXiv, cs.DS/0205038
L. Belady (1966)
A Study of Replacement Algorithms for Virtual-Storage ComputerIBM Syst. J., 5
D. Achlioptas, M. Chrobak, J. Noga (2000)
Competitive analysis of randomized paging algorithmsTheor. Comput. Sci., 234
Let e = { u, v } be an edge and p an α e -page or β e -page
The total savings incurred on edge-pages are equal to (cid:80) s B (summing over all blocks)
M. Chrobak, G. Woeginger, K. Makino, Haifeng Xu (2012)
Caching Is Hard—Even in the Fault ModelAlgorithmica, 63
PS Bonsma, J Schulz, A Wiese (2014)
A constant-factor approximation algorithm for unsplittable flow on pathsSIAM J. Comput., 43
A. Borodin, Ran El-Yaniv (1998)
Online computation and competitive analysis
A. Bar-Noy, R. Bar-Yehuda, Ari Freund, J. Naor, B. Schieber (2001)
A unified approach to approximating resource allocation and schedulingJ. ACM, 48
N. Young (2002)
On-Line File CachingAlgorithmica, 33
a) Each vertex page p v is requested exactly twice, right before the v -phase and right after the v -phase
M. Chrobak, L. Larmore, C. Lund, N. Reingold (1997)
A Better Lower Bound on the Competitive Ratio of the Randomized 2-Server ProblemInf. Process. Lett., 63
M. Chrobak, H. Karloff, T. Payne, S. Vishwanathan (1991)
New results on server problems
G. Brodal, Gabriel Moruz, Andrei Negoescu (2011)
OnlineMin: A Fast Strongly Competitive Randomized Paging AlgorithmTheory of Computing Systems, 56
A. Bar-Noy, R. Bar-Yehuda, Ari Freund, J. Naor, B. Schieber (2000)
A unified approach to approximating resource allocation and scheduling
Anna Adamaszek, A. Czumaj, Matthias Englert, Harald Räcke (2012)
An O(log k)-Competitive Algorithm for Generalized CachingACM Transactions on Algorithms (TALG), 15
Andreas Darmann, U. Pferschy, Joachim Schauer (2010)
Resource allocation with time intervalsTheor. Comput. Sci., 411
Jatin Batra, Naveen Garg, Amit Kumar, Tobias Mömke, Andreas Wiese (2015)
New Approximation Schemes for Unsplittable Flow on a Path
L. McGeoch, D. Sleator (1991)
A strongly competitive randomized paging algorithmAlgorithmica, 6
N. Bansal, Zachary Friggstad, R. Khandekar, M. Salavatipour (2009)
A logarithmic approximation for unsplittable flow on line graphs
A. Anagnostopoulos, F. Grandoni, S. Leonardi, Andreas Wiese (2018)
A Mazing 2+ϵ Approximation for Unsplittable Flow on a PathACM Trans. Algorithms, 14
P. Bonsma, J. Schulz, Andreas Wiese (2011)
A Constant Factor Approximation Algorithm for Unsplittable Flow on Paths2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
N. Bansal, Niv Buchbinder, J. Naor (2008)
Randomized competitive algorithms for generalized cachingProceedings of the fortieth annual ACM symposium on Theory of computing
Caching (also known as paging) is a classical problem concerning page replacement policies in two-level memory systems. General caching is the variant with pages of different sizes and fault costs. The strong NP-hardness of its two important cases, the fault model (each page has unit fault cost) and the bit model (each page has the same fault cost as size) has been established, but under the assumption that there are pages as large as half of the cache size. We prove that this already holds when page sizes are bounded by a small constant: The bit and fault models are strongly NP-complete even when page sizes are limited to $$\{1, 2, 3\}$$ { 1 , 2 , 3 } . Considering only the decision versions of the problems, general caching is equivalent to the unsplittable flow on a path problem and therefore our results also improve the hardness results about this problem.
Algorithmica – Springer Journals
Published: Aug 19, 2016
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.