首页    期刊浏览 2025年07月08日 星期二
登录注册

文章基本信息

  • 标题:Least Recently Plus Five Least Frequently Replacement Policy (LR+5LF)
  • 本地全文:下载
  • 作者:Adwan AbdelFattah ; Aiman Abu Samra
  • 期刊名称:The International Arab Journal of Information Technology
  • 印刷版ISSN:1683-3198
  • 出版年度:2012
  • 卷号:9
  • 期号:1
  • 出版社:Zarqa Private University
  • 摘要:In this paper we present a new block replacement policy, in which we proposed a new efficient algorithm for combining two important policies Least Recently Used (LRU) and Least Frequently Used (LFU). The implementation of the proposed policy is simple. It requires limited calculations to determine the victim block. We proposed our models to implement LRU and LFU policies. The new policy gives each block in cache two weighing values corresponding to LRU and LFU policies. Then a simple algorithm is used to get the overall value for each block. A comprehensive comparison is made between our Policy and LRU, First In First Out (FIFO), V-WAY, and Combined LRU and LFU (CRF) policies. Experimental results show that the LR+5LF replacement policy significantly reduces the number of cache misses. We modified simple scalar simulator version 3 under Linux Ubuntu 9.04 and we used speccpu2000 benchmark to simulate this policy. The results of simulations showed, that giving higher weighing to LFU policy gives this policy best performance characteristics over other policies. Substantial improvement on miss rate was achieved on instruction level 1 cache and at level 2 cache memory.
  • 关键词:Cache memory; replacement policy; LRU; LFU; and miss rate
国家哲学社会科学文献中心版权所有