期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

基于页面写相关的闪存转换层策略 被引量：5

Page write-related scheme for flash translation layer
下载PDF
导出
摘要 针对固态硬盘(SSD)的闪存转换层(FTL)策略诸如BAST、FAST增加了垃圾回收的成本,带来了固态硬盘性能的下降等缺点,提出了一种基于页面"写相关"的FTL策略PWRST。PWRST的基本思想是分析I/O请求的访问历史并找出"写相关"的页面,将"写相关"的页面存储到同一数据块。从而减少垃圾回收开销和I/O请求的平均响应时间。实验结果表明PWRST在Postmark和IOzone负载下的响应时间比BAST减少了35%,比FAST减少了26%。在TPC-C负载下的响应时间比BAST减少了12%,比FAST减少了10%。 Most existing flash translation layer （FTL） schemes such as block associative sector translation （BAST） and fully associative sector translation （FAST） increase garbage collection overhead and degrade the performance of solid-state drive （SSD）. A novel flash translation layer scheme called page write-related sector translation （PWRST） was proposed. PWRST finds write-related pages from request history set and writes these pages into the same data block, which reduces garbage collection overhead and average request response time. Experiment results indicate that PWRST reduces average response time by 35% compared to BAST and 26% compared to FAST for Postmark and IOzone work- load. For TPC-C workload, PWRST reduces response time by 12% compared to BAST and 10% compared to FAST.
作者 陈金忠 姚念民 蔡绍滨 战福瑞 孙美玲
机构地区 哈尔滨工程大学计算机科学与技术学院
出处 《通信学报》 EI CSCD 北大核心 2013年第6期76-84,共9页 Journal on Communications
基金 国家自然科学基金资助项目(61073047) 中央高校基本科研业务费专项基金资助项目(HEUCFT1007 HEUCF100607 HEUCFT1202) 哈尔滨市科技创新人才专项基金资助项目(2012RFLXG023)~~
关键词 固态硬盘 闪存转换层 垃圾回收 写相关 solid state drive flash translation layer garbage collection write-related
分类号 TP333.35 [自动化与计算机技术—计算机系统结构]
  • 相关文献

参考文献18

  • 1CHUNG T S, PARK S W, LEE D H, et al. Systems software for llash memory: a survey[A]. Proceedings of the 2006 IFIP International Conlr- ence on Embedded and Ubiquitous Computing[C]. Korea, 2006. 394-404.
  • 2DING X N, JIANG S, CHEN F, et al. DULO: an effective bufli: cache management scheme to exploit both temporal and spatial locali ties[J]. ACM Trans Storage, 2007, 3(2):1242522.
  • 3LI Z M, CHEN Z F, SUDARSHAN M S, et al. C-miner: mining block correlations in storage systems[A]. Proc of FAST'02[C]. San Francisco, USA, 2004. 173-186.
  • 4GAL E, TOLEDO S, Algorithms and data structures for flash merr ries[J]. ACM Computing Surveys, 2005, 37(2):138-163,.
  • 5LEVENTHAL A. Flash storage memory communications[J]. Commu- nications of the ACM, 2008, 51(7):47-51.
  • 6SANTAR1NI M. NAND versus NOR[J]. EDN, 2005, 50(21):41-48.
  • 7KIM J S, KIM J M, NOH S H, et al. A space-efficient flash translatior layer lbr compactflash systems[J]. IEEE transactions on ConsumeJ Electronics, 2002, 48(2):366-375.
  • 8LEE S W, PARK D J, CHUNG T S, et al. A log buffer based flash translation layer using tully associative sector translation[J]. IEEE Transactions on Embedded Computing Systems, 2007, 6(3): 18-45.
  • 9KANG J U, JO H, K1M J S, et al. A superblock based flash translation layer lbr NAND flash memory[A]. Proc of 1CES'06[C]+ Seoul, Korea, 2006. 161-170.
  • 10CHAO H, SHIN D, EOM Y I. Kast: k-associative sector translation for NAND flash memory in real-time systems[A]. Design, Automation Test in Europe Conference Exhibition[C]. Nice, France, 2009. 507-512.

同被引文献49

  • 1黄昆,张大方.一种面向深度数据包检测的索引拆分Bloom过滤器[J].中国科学：信息科学,2010,40(8):1062-1077. 被引量：3
  • 2Sandisk. Virtual RPM[EB/OL]. (2008-11-28) [2014- 02-19]. http://www, sandisk. com/media/65714/Virtual%20RPM-80-11-01647-ENG-FINAL. pdf.
  • 3Zhu B, Li K, Hugo P. Avoiding the disk bottleneck in the data domain deduplication file system [C] //Proc of the 6th USENIX Conf on File and Storage Technologies. Berkeley, CA: USENIX Association, 2008:1-14.
  • 4Lakshman A, Malik P. Cassandra.. A decentralized structured storage system [J]. Operating Systems Review, 2010, 44(2): 35-40.
  • 5Lim H, Fan B, Andersen D G, et al. SILT: A memory efficient, high-performance key-value Store [C] //Proc of the 23rd ACM Symp on Operating Systems Principles. New York: ACM, 2011:1-13.
  • 6Milo Polte, Jiri Simsa, Garth Gibson. Comparing performance of solid state devices and mechanical disks [C]// Proc of the 3rd Petascale Data Storage Workshop Held in Conjunction with Supercomputing. Pittsburgh: Petaseale Data Storage Institute, 2008: 1-7.
  • 7吕雁飞,陈学轩,崔斌.基于闪存的数据库性能评测与优化分析[J].计算机研究与发展,2009,46(增刊):307-312.
  • 8Hu Yang, Jiang Hong, Feng Dan, et al. Performance impact and interplay of SSD parallelism through advanced commands, allocation strategy and data granularity [C] // Proc of the 25th Int Conf on Supercomputing. New York: ACM, 2011:96-107.
  • 9Andersen D G, Franklin J, Kaminsky M, et al. FAWN: A fast array of wimpy nodes [C] //Proc of the 22nd ACM Syrup on Operating Systems Principles. New York: ACM, 2009: 1-17.
  • 10Debnath B, Senguptaz S, Liz J. ChunkStash: Speeding up inline storage deduplication using flash memory [C] //Proc of usENIX ATC. Berkeley, CA: USENIX Association, 2010: 1-16.

引证文献5

二级引证文献11

通信学报
2013年 第6期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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