General Caching Is Hard: Even with Small Pages
Abstract
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. We give the first NP-hardness result for general caching with small pages: General caching is (strongly) NP-hard even when page sizes are limited to {1, 2, 3}. It holds already in the fault model (each page has unit fault cost) as well as in the bit model (each page has the same fault cost as size). We also give a very short proof of the strong NP-hardness of general caching with page sizes restricted to {1, 2, 3} and arbitrary costs.
Cite
@article{arxiv.1506.07905,
title = {General Caching Is Hard: Even with Small Pages},
author = {Lukáš Folwarczný and Jiří Sgall},
journal= {arXiv preprint arXiv:1506.07905},
year = {2015}
}
Comments
19 pages, 8 figures, an extended abstract appeared in the proceedings of MAPSP 2015 (www.mapsp2015.com), a conference version has been submitted