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 条
  • [21] An improved GreedyDual* cache document replacement algorithm
    Li, KQ
    Shen, H
    IEEE/WIC/ACM INTERNATIONAL CONFERENCE ON WEB INTELLIGENCE (WI 2004), PROCEEDINGS, 2004, : 457 - 460
  • [22] Simulation study of a novel cache replacement algorithm
    Khalid, H
    Obaidat, MS
    SIMULATION, 1997, 68 (04) : 209 - 218
  • [23] SzLFU(k) web cache replacement algorithm
    Wang, HC
    Peng, JZ
    Wu, YT
    Feng, HT
    2002 IEEE REGION 10 CONFERENCE ON COMPUTERS, COMMUNICATIONS, CONTROL AND POWER ENGINEERING, VOLS I-III, PROCEEDINGS, 2002, : 754 - 758
  • [24] Outperforming LRU with an adaptive replacement cache algorithm
    Megiddo, N
    Modha, DS
    COMPUTER, 2004, 37 (04) : 58 - +
  • [25] SF-LRU cache replacement algorithm
    Alghazo, J
    Akaaboune, A
    Botros, N
    RECORDS OF THE 2004 IEEE INTERNATIONAL WORKSHOP ON MEMORY TECHNOLOGY, DESIGN AND TESTING, 2004, : 19 - 24
  • [26] An Optimal Cache Replacement algorithm for Internet systems
    Yeung, KH
    Ng, KW
    LCN'97 - 22ND ANNUAL CONFERENCE ON LOCAL COMPUTER NETWORKS, PROCEEDINGS, 1997, : 189 - 194
  • [27] Optimality proof of the Kise-Ibaraki-Mine algorithm
    Li, Shanlin
    Chen, Zhi-Long
    Tang, Guochun
    JOURNAL OF SCHEDULING, 2012, 15 (03) : 289 - 294
  • [28] A revised proof of the optimality for the Kise–Ibaraki–Mine algorithm
    Baoqiang Fan
    Yeping Sun
    Rongjun Chen
    Guochun Tang
    Optimization Letters, 2012, 6 : 1951 - 1955
  • [29] Short proof of an algorithm by Boehm
    Kirrmann, Georg
    Computer Aided Geometric Design, 1992, 9 (01) : 69 - 71
  • [30] A Joint Cache Placement and Replacement Algorithm for Cache Requirements of New Contents in CCN
    Shan S.-Y.
    Feng C.-Y.
    Zhu G.-Y.
    Zhang T.-K.
    Beijing Youdian Daxue Xuebao/Journal of Beijing University of Posts and Telecommunications, 1600, 44 (02): : 68 - 74
12345