基于生命值敏感的闪存数据库缓冲区替换算法

发布时间：2018-04-27 02:07

本文选题：计算机应用 + 闪存　；参考：《吉林大学学报(工学版)》2017年02期

【摘要】：针对现有面向闪存的缓冲区替换算法的不足,提出了一种基于生命值敏感的闪存数据库缓冲区替换算法LAB-LRU。该算法把缓冲区分为3个LRU链表来管理,为缓冲区中每个活跃页定义生命值,使高生命值的数据页在缓存中停留更久。生命值的定义充分结合了数据页的访问频度、新颖度(recency)和闪存的读写代价,并采用多线程技术和双阈值控制实现并行高效替换。采用符合Zipf分布的不同用例进行测试,实验结果表明:在缓存命中率、闪存读写次数和系统运行时间方面,本文提出的LAB-LRU算法与现有缓存算法相比性能得到了明显提高。
[Abstract]:Aiming at the shortcomings of the existing flash memory oriented buffer replacement algorithm, a novel flash database buffer replacement algorithm, LAB-LRU-based, is proposed. The algorithm divides the buffer into three LRU linked lists, defines the health value for each active page in the buffer, and makes the high-life data page stay in the cache longer. The definition of life value fully combines the access frequency of data page, the novelty of data page and the read and write cost of flash memory, and uses multi-thread technology and double threshold control to realize parallel and efficient replacement. The test results of different use cases according to Zipf distribution show that the performance of the proposed LAB-LRU algorithm is significantly improved compared with the existing cache algorithms in the aspects of cache hit ratio, flash memory read and write times and system running time.
【作者单位】：中国科学院微电子研究所EDA中心;
【基金】：国家科技重大专项项目(2013ZX03001008-003)
【分类号】：TP311.13

【相似文献】