期刊文献+

一种面向闪存固态盘的页级缓冲区管理算法 被引量:2

A Page-level Buffer Management Algorithm Oriented Flash Solid State Disk
下载PDF
导出
摘要 为提升固态硬盘的寿命和整体性能,提出一种基于分类策略的新型页级缓冲区管理算法。将数据页缓存分为热数据页存储区、冷数据页存储区和连续数据页存储区,分别缓存访问频繁的数据页、访问频率较低的数据页和连续请求的数据页。通过预取多个数据页到连续数据页存储区,利用连续负载的高空间本地性提升对连续负载的响应性能。在缓冲区满时优先剔除冷数据页存储区中最近最少访问的干净数据页,若无干净数据页,再置换脏数据页,降低闪存的读写开销。实验结果表明,与页级LRU和CFLRU算法相比,该算法能明显提升缓冲区命中率,有效减少响应时间和闪存块擦除次数。 In order to improve the life and overall performance of Solid State Disk( SSD),a novel page-level buffer management algorithm——CPBMS based on classification strategy is proposed. CPBMS divides Random Access Memory( RAM) into Hot Cached Data Page( H-CDP),Cold Cached Data Page( C-CDP) and Sequential Cached Data Page( SCDP),which is responsible for buffering hot data page, cold data page and data page of requests with high spatial locality,respectively. In order to benefit from the high spatial locality of sequential requests,CPBMS prefetches multiple sequential data page into S-CDP,thus it can improve the response performance of sequential requests. When buffer is full,CPBMS preferred removes clean page of C-CDP. If C-CDP has no clean page,then replaces the dirty page, significantly reduce SSD read and write cost. Experimental results show that compared with page-level LRU and CFLRU algorithms,CPBMS algorithm significantly improves the buffer hit rate, effectively reduces the response time and flash block erasure times.
作者 杜晨杰 姚英彪 DU Chenjie;YAO Yingbiao(Department of Science and Technology,Zhejiang Wanli University,Ningbo,Zhejiang 315100,China;Provincial Key Laboratory of Solid State Disk and Data Security Technology of Zhejiang,Hangzhou Dianzi University,Hangzhou 310018,China)
出处 《计算机工程》 CAS CSCD 北大核心 2018年第7期54-59,共6页 Computer Engineering
基金 国家自然科学基金(61100044) 浙江省重点科技创新团队项目"固态存储和数据安全关键技术创新团队"(2013TD03) 浙江省科技计划项目(2017C37056)
关键词 固态硬盘 分类策略 缓冲区管理 热数据页缓存 高空间本地性 Solid State Disk ( SSD) classification strategy (buffer management Hot Cached Data Page ( H- CDP) high spatial locality
  • 相关文献

参考文献8

二级参考文献173

  • 1Hwang C-G.Nanotechnology enables a new memory growth model.Proceedings of the IEEE,2003,91(11):1765-1771.
  • 2Babaoglu O,Joy W.Converting a swap-based system to do paging in an architecture lacking page-reference bits.ACM SIGOPS Operating Systems Review,1981,15(5):78-86.
  • 3Robinson J T,Devarakonda M V.Data cache management using frequency-based replacement//Proceedings of the ACM SIGMETRICS.Boulder,Colorado,USA,1990:134-142.
  • 4O'Neil E J,O'Neil P E,Weikum G.The LRU-K page replacement algorithm for database disk buffering//Proceedings of the ACM SIGMOD Conference.Washington,1993:297-306.
  • 5Johnson T,Shasha D.2Q:A low overhead high performance buffer management replacement algorithm//Proceedings of the 20th International Conference on Very Large Data Base.Santiago de Chile,Chile,1994:439-450.
  • 6Jiang S,Zhang X.Making LRU friendly to weak locality workloads:A novel replacement algorithm to improve buffer cache performance.IEEE Transactions on Computers,2005,54(8):939-952.
  • 7Megiddo N,Modha D S.ARC:A self-tuning,low overhead replacement cache//Proceedings of the FAST'03 Conference on File and Storage Technologies.San Francisco,California,USA,2003:115-130.
  • 8Lee D,Choi J,Kim J-H,Noh S H,Min S L,Cho Y,Kim C-S.LRFU:A spectrum of policies that subsumes the least recently used and least frequently used policies.IEEE Transactions on Computers,2001,50(12):1352-1361.
  • 9Effelsberg W,Haerder T.Principles of database buffer management.ACM Transactions on Database Systems,1984,9(4):560-595.
  • 10Park S-Y,Jung D,Kang J-U,Kim J,Lee J.CFLRU:A replacement algorithm for flash memory//Proceedings of the 2006 International Conference on Compilers,Architecture,and Synthesis for Embedded Systems (CASES).Seoul,Korea,2006:234-241.

共引文献95

同被引文献6

引证文献2

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部