Optimal replacement is NP-hard for nonstandard caches

@article{Brehob2004OptimalRI,
  title={Optimal replacement is NP-hard for nonstandard caches},
  author={Mark Brehob and Stephen Wagner and Eric Torng and Richard J. Enbody},
  journal={IEEE Transactions on Computers},
  year={2004},
  volume={53},
  pages={73-76}
}
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. 

Citations

Publications citing this paper.
Showing 1-10 of 15 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 18 references

Accurate Data Layout into Blocks May Boost Cache Performance

  • D. Truong, F. Bodin, A. Seznec
  • Proc. Interact-2, pp. 55-57, Feb. 1997.
  • 1997
1 Excerpt

Similar Papers

Loading similar papers…