The Community for Technology Leaders
Green Image
<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>
Cache, optimal cache replacement policy, interval scheduling, approximation algorithm, victim cache, skew cache, multilateral cache.

M. Brehob, S. Wagner, E. Torng and R. Enbody, "Optimal Replacement Is NP-Hardfor Nonstandard Caches," in IEEE Transactions on Computers, vol. 53, no. , pp. 73-76, 2004.
85 ms
(Ver 3.3 (11022016))