Caching is hard: even in the fault model

Authors:
Marek Chrobak;Gerhard J. Woeginger;Kazuhisa Makino;Haifeng Xu
Affiliations:
Department of Computer Science, University of California, Riverside;Department of Mathematics and Computer Science, TU Eindhoven, Netherlands;Department of Mathematical Informatics, Graduate School of Information and Technology, University of Tokyo, Japan;Department of Mathematics, Zhejiang University, Hangzhou, China
Venue:
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Year:
2010

Citing 7
Cited 5

New results on server problems

SIAM Journal on Discrete Mathematics
Online computation and competitive analysis

Online computation and competitive analysis
Page replacement for general caching problems

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
A unified approach to approximating resource allocation and scheduling

Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Optimal Replacement Is NP-Hardfor Nonstandard Caches

IEEE Transactions on Computers
A study of replacement algorithms for a virtual-storage computer

IBM Systems Journal

On variants of file caching

ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Randomized Competitive Algorithms for Generalized Caching

SIAM Journal on Computing
Energy efficient caching for phase-change memory

MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
Constant integrality gap LP formulations of unsplittable flow on a path

IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
Lifetime and QoS-aware energy-saving buffering schemes

Journal of Systems and Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

We prove strong NP-completeness for the four variants of caching with multi-size pages. These four variants are obtained by choosing either the fault cost or the bit cost model, and by combining it with either a forced or an optional caching policy. This resolves two questions in the area of paging and caching that were open since the 1990s.