Abstract
We prove strong ℕℙ-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. © 2010 Springer-Verlag.
Cite
CITATION STYLE
Chrobak, M., Woeginger, G. J., Makino, K., & Xu, H. (2010). Caching is hard - Even in the fault model. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6346 LNCS, pp. 195–206). https://doi.org/10.1007/978-3-642-15775-2_17
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
