• DocumentCode
    849678
  • 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
  • Volume
    53
  • Issue
    1
  • fYear
    2004
  • fDate
    1/1/2004 12:00:00 AM
  • Firstpage
    73
  • Lastpage
    76
  • 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;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/TC.2004.1255792
  • Filename
    1255792
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=849678