作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2007, Vol. 33 ›› Issue (09): 272-274.

• 开发研究与设计技术 • 上一篇    下一篇

一种基于近似LRU算法的高缓方案

鲍东星1,李晓明2   

  1. (1. 黑龙江大学电子工程学院,哈尔滨 150080;2. 哈尔滨工业大学微电子中心,哈尔滨 150001)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2007-05-05 发布日期:2007-05-05

Cache Scheme Based on LRU-like Algorithm

BAO Dongxing1, LI Xiaoming2   

  1. (1. Institute of Electronic Engineering, Heilongjiang University, Harbin 150080; 2. Microelectronics Center, Harbin Institute of Technology, Harbin 150001)
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-05-05 Published:2007-05-05

摘要: 提出了一个用于扩充高缓块管理的近似LRU算法。利用该算法,设计了一个可过滤LRU数据块的扩充高缓方案——LRU块过滤高缓(LBF高缓)。仿真结果显示,LBF高缓的性能优于类似结构的扩充高缓(如牺牲高缓和辅助高缓),与具有2倍容量的直接映像高缓相比性能有所提高。

关键词: 高缓性能, 命中率, LRU算法

Abstract: The LRU-like algorithm is proposed for the block management of augmented cache scheme. Based on the LRU-like algorithm, a kind of augmented cache named least-recently-used blocks filter cache (LBF cache) is designed. After the simulation, the performance of LBF cache shows better than some augmented caches with similar architectures (such as victim cache and assist cache), and also better than the traditional direct-mapping cache with double size.

Key words: Cache performance, Hit ratio, LRU algorithm

中图分类号: