Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

General Caching Is Hard: Even with Small Pages

General Caching Is Hard: Even with Small Pages 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\}$$ { 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Algorithmica Springer Journals

General Caching Is Hard: Even with Small Pages

Algorithmica , Volume 79 (2) – Aug 19, 2016

Loading next page...
1
 
/lp/springer_journal/general-caching-is-hard-even-with-small-pages-ojlFSY226Q

References (28)

Publisher
Springer Journals
Copyright
Copyright © 2016 by Springer Science+Business Media New York
Subject
Computer Science; Algorithm Analysis and Problem Complexity; Theory of Computation; Mathematics of Computing; Algorithms; Computer Systems Organization and Communication Networks; Data Structures, Cryptology and Information Theory
ISSN
0178-4617
eISSN
1432-0541
DOI
10.1007/s00453-016-0185-0
Publisher site
See Article on Publisher Site

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. 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\}$$ { 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.

Journal

AlgorithmicaSpringer Journals

Published: Aug 19, 2016

There are no references for this article.