一种面向固态硬盘的Cache置换算法  

New Cache Replacement Algorithm for Solid-state Drive

作　　者：李博[1] 谢长生[1] 王芬[1] 赵小刚[1] 

机构地区：[1]华中科技大学计算机学院武汉光电国家实验室,武汉430074

出　　处：《计算机科学》2010年第8期298-301,共4页Computer Science

基　　金：国家自然科学基金项目(60933002);863课题(2009AA01A402);留学生基金委资助

摘　　要：固体硬盘的出现改变了现有存储子系统的框架,也逐渐成为了嵌入式应用的主流存储设备。但是其自身的写机制由于需要先擦后写,成为了影响SSD性能的瓶颈。针对此问题,出于减少写操作次数这一思路提出了LRU-AB算法,力图在基于Cache数据的访问频度上改进SSD置换算法。同时对现有算法进行了分析。The appearance of solid-state drive（SSD） incurs exciting changes in the architecture of computer storage subsystems and SSD has become the main storage devices for embedded application, gradually. But the bottle neck problem of ＂erase before write＂ in NAND-based SSD and its lifetime are the most important issues in today＇s SSD desigrL This paper presented the algorithm, LRU-AB（access-based） by considering the access frequency to improve the performance of write operations. Meantime,we also discussed some existing algorithms for this area.

关 键 词：固体硬盘 flash转换层 缓冲 置换算法 

分 类 号：TP333[自动化与计算机技术—计算机系统结构]