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%2F15%3A10316495" target="_blank" >RIV/00216208:11320/15:10316495 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-662-48971-0_11" target="_blank" >http://dx.doi.org/10.1007/978-3-662-48971-0_11</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-662-48971-0_11" target="_blank" >10.1007/978-3-662-48971-0_11</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. 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
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2015
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
Article name in the collection
26th International Symposium on Algorithms and Computation (ISAAC)
ISBN
978-3-662-48970-3
ISSN
0302-9743
e-ISSN
—
Number of pages
11
Pages from-to
116-126
Publisher name
Springer-Verlag
Place of publication
Berlin
Event location
Nagoya, Japan
Event date
Dec 9, 2015
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—