General Caching Is Hard: Even with Small Pages
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F17%3A10369124" target="_blank" >RIV/00216208:11320/17:10369124 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/s00453-016-0185-0" target="_blank" >http://dx.doi.org/10.1007/s00453-016-0185-0</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s00453-016-0185-0" target="_blank" >10.1007/s00453-016-0185-0</a>
Alternative languages
Result language
angličtina
Original language name
General Caching Is Hard: Even with Small Pages
Original language description
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}. 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.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2017
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Algorithmica
ISSN
0178-4617
e-ISSN
—
Volume of the periodical
79
Issue of the periodical within the volume
2
Country of publishing house
US - UNITED STATES
Number of pages
21
Pages from-to
319-339
UT code for WoS article
000406779100002
EID of the result in the Scopus database
—