存储系统重构优化技术研究

摘 要：目前海量存储系统规模逐渐增长，存储节点失效是普遍现象。因此存储系统的重构优化问题越来越受到研究人员的关注。综述

>> 虚拟网络存储系统关键技术研究 分布式存储系统建模技术研究 刍议海量数据存储系统的高可靠性关键技术研究与应用 数字射频存储系统关键技术仿真研究 海量数据存储系统研究 存储体系构建和存储系统性能研究 最新SSD技术与PC存储系统结构改进的研究 云存储系统设计的关键技术 计算机存储系统的管理技术探讨 网络财务数据存储系统研究 大规模云存储系统副本布局研究 网络电视台存储系统架构研究 区域医学影像数据存储系统研究 私有云存储系统的研究与意义 云存储系统的分析与应用研究 医疗大数据智能存储系统应用与研究 动态数据安全审计云存储系统研究 存储系统应用实例 昆腾分级存储系统 基于计量管理信息平台的高性能计算系统与数据存储系统分离技术的研究 常见问题解答 当前所在位置：l

[2] Hafner， J. L. Weaver codes： Highly fault tolerant erasure codes for storage systems[C].In Proceedings of the 4th USENIX Conference on File and Storage Technologies.Berkeley，CA，USA， USENIX，2005： 16-26.

[3] Hafner J L. HoVer erasure codes for disk arrays[C].2006 International Conference on Dependable Systems and Networks. IEEE， 2006： 217-226.

[4] Huang C， Chen M， Li J. Pyramid codes： Flexible schemes to trade space for access efficiency in reliable data storage systems[J]. 2007 Sixth IEEE International Symposium on Network Computing and Applications. IEEE， 2007，9（1）： 79-86.

[5] Greenan K M， Li X， Wylie J J. Flat XOR-based erasure codes in storage systems： Constructions， efficient recovery， and tradeoffs[J]. Mass Storage Systems and Technologies，2010，2（1）： 1-14.

[6] Wan S， Cao Q， Xie C， et al.Code-m： A non-mds erasure code scheme to support fast recovery from up to two-disk failures in storage systems[J].2010 IEEE/IFIP International Conference on Dependable Systems and Networks. IEEE， 2010，23（5）： 51-60.

[7] Xie Ping， Huang Jianzhong， Cao Qiang， et al. V2-Code： A new non-MDS array code with optimal reconstruction performance for RAID-6[C].2013 IEEE International Conference on Cluster Computing （CLUSTER’13）. IEEE， 2013： 1-8.

[8] Pinheiro E， Weber W D， Barroso L A. Failure Trends in a Large Disk Drive Population[C]. In Proceedings of the 2007 USENIX Conference on File and Storage Technologies. USENIX， 2007： 17-23.

[9] Blaum M， Brady J， Bruck J， et al. EVENODD： An efficient scheme for tolerating double disk failures in RAID architectures[J]. Acm Sigarch Computer Architecture News， 1995， 22（2）： 245-254.

[10] Corbett P F， English R， Goel A， et al. Row-diagonal parity for double disk failure correction[C].In Proceedings of the 3rd USENIX Conference on File and Storage Technologies. USENIX， 2004： 1-14.

[11] Xiang L， Xu Y， Lui J， et al. A hybrid approach to failed disk recovery using RAID-6 codes： Algorithms and performance evaluation[J]. ACM Transactions on Storage， 2011， 7（3）： 11

[12] Wang Z， Dimakis A G， Bruck J. Rebuilding for array codes in distributed storage systems[C]. 2010 IEEE GLOBECOM Workshops， 2010： 1905-1909.

[13] Khan O， Burns R， Plank J， et al. In search of I/O-optimal recovery from disk failures[C].In Proceedings of the 3rd USENIX conference on Hot topics in storage and file systems. USENIX Association， 2011： 6.

[14] Zhu Y， Lee P P C， Hu Y， et al.On the speedup of single-disk failure recovery in xor-coded storage systems：Theory and practice[J].Mass Storage Systems and Technologies，2012，22（5）：1-12.

[15] Dimakis A G， Godfrey P B， Wu Y， et work coding for distributed storage systems[J]. IEEE Transactions on Information Theory， 2010， 56（9）： 4539-4551.

[16] Rashmi K V， Shah N B， Kumar P V， et al.Explicit construction of optimal exact regenerating codes for distributed storage[C].Allerton 2009：47th Annual Allerton Conference on Communication， Control， and Computing. IEEE， 2009： 1243-1249.

[17] Li J， Wang X， Li B. Pipelined regeneration with regenerating codes for distributed storage systems[C]. 2011 International Symposium on Network Coding. IEEE， 2011： 1-6

[18] Hu Y， Xu Y， Wang X， et al. Cooperative recovery of distributed storage systems from multiple losses with network coding[J]. IEEE Journal on Selected Areas in Communications， 2010， 28（2）： 268-276.

[19] Kermarrec A M， Le Scouarnec N， Straub G. Repairing multiple failures with coordinated and adaptive regenerating codes[C].2011 International Symposium on Network Coding. IEEE， 2011： 1-6.

[20] Zhu Y， Lee P P C， Xiang L， et al. A cost-based heterogeneous recovery scheme for distributed storage systems with RAID-6 codes[C].2012 42nd Annual IEEE/IFIP International Conference on Dependable Systems and Networks， 2012： 1-12.

[21] K. V. Rashmi， Preetum Nakkiran， Jingyan Wang，et al. Having Your Cake and Eating It Too： Jointly Optimal Erasure Codes for I/O， Storage and Network-bandwidth[C]. In Proceedings of the 2015 USENIX Conference on File and Storage Technologies. USENIX， 2015：81-94.

[22] Luo X， Shu J.Load-Balanced Recovery Schemes for Single-Disk Failure in Storage Systems with Any Erasure Code[C]. 2013 42nd International Conference on Parallel Processing， 2013： 552-561.

[23] Wan J， Wang J， Yang Q， et al.S2-RAID：A new RAID architecture for fast data recovery[C]. 2010 IEEE 26th Symposium on Mass Storage Systems and Technologies， 2010： 1-9.

[24] Hou R Y， Menon J， Patt Y N. Balancing I/O response time and disk rebuild time in a RAID5 disk array[C].In Proceeding of the Twenty-Sixth Hawaii International Conference on System Sciences. IEEE， 1993： 70-79.

[25] Holland M， Gibson G A， Siewiorek D P. Architectures and algorithms for on-line failure recovery in redundant disk arrays[J].Distributed and Parallel Databases， 1994， 2（3）： 295-335.

[26] Holland M， Gibson G A， Siewiorek D P. Fast， on-line failure recovery in redundant disk arrays[C].The Twenty-Third International Symposium on Fault-Tolerant Computing， 1993： 422-431.

[27] Tian L， Feng D， Jiang H， et al. PRO： A Popularity-based Multi-threaded Reconstruction Optimization for RAID-Structured Storage Systems[C].In Proceedings of the 2007 USENIX Conference on File and Storage Technologies. USENIX， 2007：277-290.

[28] Wu S， Jiang H， Feng D， et al. WorkOut： I/O Workload Outsourcing for Boosting RAID Reconstruction Performance[C]. In Proceedings of the 2009 USENIX Conference on File and Storage Technologies. USENIX 2009： 239-252.

[29] Shenggang Wan， Xubin He， Jianzhong Huang，et al.An Efficient Penalty-Aware Cache to Improve the Performance of Parity-Based Disk Arrays under Faulty Conditions[J].IEEE Transactions on Parallel Distributed Systems，2013，24（8）： 1500-1513.

[30] Xu L， Bruck J. X-code： MDS array codes with optimal encoding[J].IEEE Transactions on Information Theory， 1999， 45（1）： 272-276.

[31] Xie T， Wang H. MICRO： A multilevel caching-based reconstruction optimization for mobile storage systems[J].IEEE Transactions on Computers， 2008， 57（10）： 1386-1398.

[32] Guide P. Multiple （Nested） RAID Levels[EB/OL]. http：///ref/hdd/perf/raid/levels/mult.htm

[33] Jin C， Jiang H， Feng D， et al. P-Code： A new RAID-6 code with optimal properties[C].In Proceedings of the 23rd international conference on Supercomputing. ACM， 2009： 360-369.

[34] Li M， Shu J， Zheng W. GRID codes： Strip-based erasure codes with high fault tolerance for storage systems[J]. ACM Transactions on Storage， 2009， 4（4）： 1-22.

[35] Shiyi Li， Xubin He， Shenggang Wan， et al. Exploiting Decoding Computational Locality to Improve the I/O Performance of an XOR-Coded Storage Cluster under Concurrent Failures[J]. SRDS 2014（1）： 125-135.

[36] Shiyi Li，Qiang Cao，Shenggang Wan，et al.PPM： A Partitioned and Parallel Matrix Algorithm to Accelerate Encoding/Decoding Process of Asymmetric Parity Erasure Codes[C]. International Conference on Parallel Processing，2015：460-469.

[37] Jianzhong Huang， Er-wei Dai， Changsheng Xie， et al.CoRec： A Cooperative Reconstruction Pattern for Multiple Failures in Erasure-Coded Storage Clusters[C].International Conference on Parallel Processing，2015： 470-479.