期刊文献+

RAID5小写更新的冗余管理机制 被引量:1

A Redundancy Management Policy For Raind5
下载PDF
导出
摘要 为改进传统RAID5机制小写性能低下问题,提出了一种高性能的冗余数据读写机制RMB(RedundancyManagement for RAID5).RMB采用异步冗余校验方法APC(Asynchronous Parity Calculating),对现有RAID5更新算法的关键步骤进行了优化,将统一计算校验块的同步操作拆分成同步镜像写更新和异步冗余计算更新.该操作分解了数据与其校验数据更新的紧耦合现状,提升了写操作并发度;通过合并多个版本镜像块写操作减少异或计算操作的次数.通过实验验证表,RMB机制,可将小写性能大幅提高,峰值可达4倍以上. To solve the problem that RAID5 performance ineffective for small writes,a new high performance read and write mechanism for redundancy data is brought up,which is called RMB.By Asynchronous Parity Calculating.the mechanism RMR optimized the write-update mechanism of tradition al RAID5 and decomposed the concentrated operations of calculating parity blocks into writing mirror and asynchronous calculating.The new algorithm accomplish the decomposition of the tight data,improve the concurrency state and decrease the count of calculate by the way of merge ring several versions.It shows from experiments that RMR will substantially improve the performance of small writes,the peak value will be over four times as before under the out-of-band mode.
作者 刘秀菊
出处 《微电子学与计算机》 CSCD 北大核心 2012年第7期112-115,共4页 Microelectronics & Computer
基金 山东省自然科学基金项目(Y2011A03)
关键词 磁盘冗余阵列 冗余数据 小写更新 异步冗余计算 RAID redundancy data update small writes asynchronous parity calculating
  • 相关文献

参考文献7

  • 1Sung Hoon Baek, Kyu Ho Park. Matrix-stripe-cache based contiguity transform for fragmented writes in RAID-5[J]. IEEE Transaction Computers, 2009, 56 (8) : 1040-1054.
  • 2Sung Hoon Baek, Kyu Ho Park, Prefetching with a- daptive cache culling for striped disk arrays [C]/// USENIX. Boston, 2008: 363-376.
  • 3John F Gantz, David Reinsel. Extracting value from chaos [M]. Michelle Baiky: Microsoft, IDC white pa- per-sponsored by EM, 2011.
  • 4Andrew W Leung, Shankar Pasupathy, Garth Good- son, et al. Measurement and analysis of large-scale network file system workloads [C]/// USENIX 2008 Annual Technical Conference on Annual Technical Conference. Boston, 2008: 213-226.
  • 5John L Hennessy, David A Patterson. Computer ar- chitecture [M]. 4th ed. A Quantitative Approach, Morgan Kaufmann Publishers, 2009.
  • 6刘军,刘璟.容许多个磁盘故障的RAID编码方法研究[J].微电子学与计算机,2011,28(8):9-11. 被引量:3
  • 7任建奇,蔡皖东,刘卫平.一种虚拟存储系统的设计与实现[J].微电子学与计算机,2006,23(5):152-153. 被引量:3

二级参考文献14

  • 1余胜生,杨光,周敬利,曾东.基于iSCSI的网络级存储虚拟化研究及实现[J].计算机工程与应用,2004,40(14):153-155. 被引量:2
  • 2范里,曾晖,白英彩.网络环境中软件RAID的设计与实现[J].计算机应用与软件,2004,21(6):58-59. 被引量:1
  • 3周敬利,徐锋,余胜生.Linux下基于iSCSI存储系统的实现与性能评测[J].计算机工程与科学,2004,26(6):1-3. 被引量:7
  • 4Chen P M, Lee E K, Gibson G A, et al. RAID: highperformance, reliable secondary storage[J].ACM Com- puting Surveys, 1994, 26(2): 145-185.
  • 5Blahut M. Algebraic codes for data transmission[M] Paris, France: Cambridge University Press, 2003.
  • 6Blaum M, Brady J, Bruck J, et al. EVENODD: an effi- cient scheme for tolerating double disk failures in RAID architectures [J]. IEEE Transactions on Computers, 1995, 44(2) :192-202.
  • 7Lee N K, Yang S B, Lee K W. Efficient parity place- ment schemes for tolerating up to two disk failures in disk arrays[J]. Journal of Systems Architecture, 2000, 46(15) : 1383-1402.
  • 8Park C I. Efficient placement of parity and data to tolerate two disk failures in disk array systems[J]. IEEE Transactions on Parallel and Distributed Systems, 1995, 6(11): 1177-1184.
  • 9Xu L, Bruck J. X--code: MDS array codes with optimal encoding[J]. IEEE Transactions on Information Theo- ry, 1999, 45(1):272-276.
  • 10Xu L, Bohossian V, Bruck J, et al. Lowdensity MDS codes and factors of complete graphs[J]. IEEE Transac- tions on Information Theory, Sept. 1999, 45(6): 1817-1826.

共引文献4

同被引文献12

  • 1Baek S H, Park K H. Matrix-strlpe-cache-based contiguity transform for fragmented writes in RAID-5 [ J ]. IEEE Transaction Computer, 2007,56 ( 8 ) : 1040 - 1054.
  • 2Du Y M, Xiao N ,Liu F ,et aL CSWL: cross-SSD wear-leveling method in SSD-based RAID systems for system endurance and performance[ J ]. Journal of Computer Science and Technology, 2013, 28(1) : 28 -41.
  • 3Chung T S, Park D J, Park S, et al. System software for flash memory: a survey [ C ]//Proceedings of International Conference Embedded and Ubiquitous Computing, 2006 : 394 - 404.
  • 4Baek S H, Park H H. Prefecting with adaptive cache culling for striped disk array[ C ]//Proceedings of USENIX, Boston, 2008 : 363 - 376.
  • 5Li Z,Jin P Q,Su X,et al. CCF-LRU:a new buffer replacement algorithm for flash memory[ J]. IEEE Transaction on Consumer Electronics,2009,55 (3) : 1351 - 1359.
  • 6Woodhouse D. JFFs:the joumaling flash file system[ EB/OL]. 2001 [ 2008 - 12 - 05 ]. http://sources, redhat, com/jffs2/jffs2, pdf.
  • 7Wu C T , He X B. GSR: a global stripe-based redistribution approach to accelerate RA1D5 scaling[ C ]//Proceedings of 41st ICPP,2012:460 - 469.
  • 8Zhang G Y, Zheng W M, Shu J W. ALV: a new data redistribution approach to RAID5 sealing [ J ]. IEEE Transactions on Computer,2010,59 ( 3 ) :345 - 357.
  • 9Kim H, Ahn S. BPLRU: a buffer management scheme for improving random writes in flash storage [ C ]//Proceedings of 6th USENIX Conference on File and Storage Technologies, 2008.
  • 10Buoy J S, Sehindler J, Sehlosser S W, et al. The disksim simulation environment version 4.0 reference manual [ R ]. Carnegie Mellon University Parallel Data Lab Technical Report CMU - PDL -08 - 101 ,2008.

引证文献1

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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