A Cache Scheme Based on LRU-Like Algorithm

摘要：

The LRU-like algorithm was proposed for the block management to enhance the direct-mapped cache scheme. Base on the LRU-like algorithm, the Least-Recently-Used Block Filtering cache (LBF cache), which can filter LRU blocks, is designed. From the point of cache usage rate, the LBF cache uses LRU-like algorithm to allocate and replace blocks, and evicts the blocks whose usage shows the least efficiency. After the simulation, the performance of LBF cache shows better performance than typical cache schemes with similar architecture (such as victim cache and assist cache). Comparison also shows, with the same block size of 32 bytes, 9KB LBF cache reduces 26％ in average miss rate over the traditional 16KB direct-mapped cache and 53％ over the 8KB 2-way setassociative cache.

关键词： Cache miss rate LRU algorithm

作者: Dongxing Bao Xiaoming Li

作者单位: College of Electronic Engineering Heilongjiang University Harbin,Heilongjiang,China Microelectronic Center Harbin Institute of Technology Harbin,Heilongjiang,China

会议类型: 国际会议

会议名称: 2010 IEEE信息与自动化国际会议(ICIA 2010)

会议地点: 哈尔滨

会议语种:英文

页码: 1-6

在线出版日期: 2010-06-20（万方平台首次上网日期，不代表论文的发表时间）