###
计算机系统应用英文版:2018,27(3):156-161
←前一篇   |   后一篇→
本文二维码信息
码上扫一扫!
基于ARC的闪存数据库缓冲区算法
(1.福建师范大学 数学与信息学院, 福州 350108;2.福建省公共服务大数据挖掘与应用工程技术研究中心, 福州 350108)
Buffer Replacement Algorithm for Flash-Based Databases Based on ARC
(1.College of Mathematics and Informatics, Fujian Normal University, Fuzhou 350108, China;2.Fujian Engineering Research Center of Public Service Big Data Mining and Application, Fuzhou 350108, China)
摘要
图/表
参考文献
相似文献
本文已被:浏览 1508次   下载 2259
Received:June 21, 2017    Revised:July 12, 2017
中文摘要: 闪存是一种纯电子设备,具备体积小、数据读取速度快、能耗低、抗震性强等优点,被用来部分替代机械硬盘从而提升存储系统的性能.但是,现有的缓冲区置换算法都是针对机械硬盘的物理特性进行设计和优化,因此有必要针对闪存的物理特性重新设计缓冲区置换算法.提出一种新的面向闪存数据库的缓冲区替换算法CF-ARC.算法设计了一种新的页替换机制,即在替换干净页或者脏页的时候考虑其访问频度的大小,优先将访问频度少的干净页替换出缓冲区,使得热页继续留在缓冲区提高命中率,从而获得更好的性能,通过对实验结果的对比分析发现CF-ARC在多数情况下具有比其它置换算法更高的性能.
Abstract:Flash memory is a pure electronic equipment and has the advantages of smaller volume, faster reading speed, lower power consumption and strong vibration resistance, so it is used to partly replace the disk to improve the performance of storage system. But the existing design and optimization of buffer replacement algorithms are based on the physical characteristics of mechanical hard disk. Therefore, it is necessary to redesign a new buffer replacement algorithm which contrapose the physical characteristics of flash memory. This study presents a new buffer replacement algorithm named CF-ARC. A new type of page mechanism replacement is designed, which means the access frequency should be considered when the clean or dirty pages are replaced. The clean pages less visit should replace the buffer to improve the hit rate in hotspot and achieve a better performance. The experimental results show that CF-ARC has better performance than other buffer replacement algorithms in most cases.
文章编号:     中图分类号:    文献标志码:
基金项目:国家自然科学基金(61502102,61402109,61370078)
引用文本:
梁鑫,林铭炜,姚志强.基于ARC的闪存数据库缓冲区算法.计算机系统应用,2018,27(3):156-161
LIANG Xin,LIN Ming-Wei,YAO Zhi-Qiang.Buffer Replacement Algorithm for Flash-Based Databases Based on ARC.COMPUTER SYSTEMS APPLICATIONS,2018,27(3):156-161