A short proof of optimality for the MIN cache replacement algorithm

被引：21
|
作者：
Van Roy, Benjamin [1 ]
机构：
[1] Stanford Univ, Stanford, CA 94305 USA
来源：
INFORMATION PROCESSING LETTERS | 2007年 / 102卷 / 2-3期
关键词：
analysis of algorithms; on-line algorithms; caching; paging;
D O I：
10.1016/j.ipl.2006.11.009
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
The MIN algorithm is an offline strategy for deciding which item to replace when writing a new item to a cache. Its optimality was first established by Mattson et al. [R.L. Mattson, J.Gecsei, D.R. Slutz, I.L. Traiger, Evaluation techniques for storage hierarchies, IBM Systems Journal 9 (2) (1970) 78-117] through a lengthy analysis. We provide a short and elementary proof based on a dynamic programming argument. (c) 2006 Elsevier B.V. All rights reserved.
引用
收藏
页码：72 / 73
页数：2
相关论文
共 50 条
  • [1] Another short proof of optimality for the MIN cache replacement algorithm
    Vogler, Walter
    INFORMATION PROCESSING LETTERS, 2008, 106 (05) : 219 - 220
  • [2] A simple proof of optimality for the MIN cache replacement policy
    Lee, Mun-Kyu
    Michaud, Pierre
    Sim, Jeong Seop
    Nyang, DaeHun
    INFORMATION PROCESSING LETTERS, 2016, 116 (02) : 168 - 170
  • [3] Proof of Optimality based on Greedy Algorithm for Offline Cache Replacement Algorithm
    Srivastava, Swapnita
    Singh, P. K.
    INTERNATIONAL JOURNAL OF NEXT-GENERATION COMPUTING, 2022, 13 (03): : 276 - 286
  • [4] An optimality proof of the LRU-K page replacement algorithm
    O'Neil, EJ
    O'Neil, PE
    Weikum, G
    JOURNAL OF THE ACM, 1999, 46 (01) : 92 - 112
  • [5] A PROOF OF THE OPTIMALITY OF THE MIN PAGING ALGORITHM USING LINEAR-PROGRAMMING DUALITY
    COHEN, A
    BURKHARD, WA
    OPERATIONS RESEARCH LETTERS, 1995, 18 (01) : 7 - 13
  • [6] PROOF OF OPTIMALITY FOR AGE REPLACEMENT POLICIES
    BERG, M
    ADVANCES IN APPLIED PROBABILITY, 1977, 9 (02) : 218 - 218
  • [7] PROOF OF OPTIMALITY FOR AGE REPLACEMENT POLICIES
    BERG, M
    JOURNAL OF APPLIED PROBABILITY, 1976, 13 (04) : 751 - 759
  • [8] A short proof of optimality of the Bottom Up algorithm for discrete resource allocation problems
    Zaporozhets, A
    OPERATIONS RESEARCH LETTERS, 1997, 21 (02) : 81 - 85
  • [9] A Novel Cache Replacement Algorithm of EPCIS
    Chen, Wei
    Gong, Yongwang
    Gao, Zhi
    Xu, Xiufang
    Shao, Xing
    Han, Limao
    PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON LOGISTICS, ENGINEERING, MANAGEMENT AND COMPUTER SCIENCE (LEMCS 2015), 2015, 117 : 1295 - 1298
  • [10] A new web cache replacement algorithm
    Bhattacharjee, A
    Debnath, BK
    2005 IEEE PACIFIC RIM CONFERENCE ON COMMUNICATIONS, COMPUTERS AND SIGNAL PROCESSING (PACRIM), 2005, : 420 - 423
12345