Title :
Optimal replacement is NP-hard for nonstandard caches
Author :
Brehob, Mark ; Wagner, Stephen ; Torng, Eric ; Enbody, Richard
Author_Institution :
Dept. of Electr. Eng. & Comput. Sci., Michigan Univ., Ann Arbor, MI, USA
fDate :
1/1/2004 12:00:00 AM
Abstract :
When examining a new cache structure or replacement policy, the optimal policy is a useful baseline. 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 P=NP.
Keywords :
cache storage; computational complexity; optimisation; polynomial approximation; scheduling; NP-hard problem; cache structure; optimal scheduling; polynomial time approximation; replacement policy; Approximation algorithms; Carbon capture and storage; Computer architecture; Law; Legal factors; Optimal scheduling; Optimized production technology; Polynomials; Processor scheduling; Scheduling algorithm;
Journal_Title :
Computers, IEEE Transactions on
DOI :
10.1109/TC.2004.1255792
