The Community for Technology Leaders
Green Image
ABSTRACT
<p><b>Abstract</b>—When examining a new cache structure or replacement policy, the optimal policy is a useful baseline. In this paper, we prove that finding the optimal schedule is NP-hard for any but the simplest of caches, and that no polynomial-time approximation scheme exists for this problem unless <tmath>P=NP</tmath>.</p>
INDEX TERMS
Cache, optimal cache replacement policy, interval scheduling, approximation algorithm, victim cache, skew cache, multilateral cache.
CITATION
Mark Brehob, Stephen Wagner, Eric Torng, Richard Enbody, "Optimal Replacement Is NP-Hardfor Nonstandard Caches", IEEE Transactions on Computers, vol. 53, no. , pp. 73-76, January 2004, doi:10.1109/TC.2004.1255792
96 ms
(Ver 3.3 (11022016))