[1] |
OUYANG J, LIN S D, JIANG S, et al. SDF: Software-defined flash for web-scale Internet storage systems[C]// Proceedings of the 19th International Conference on Architectural Support for Programming Languages and Operating Systems. 2014:471-484.
|
[2] |
BALAJI S B, KRISHNAN M N, VAJHAM, et al. Erasure coding for distributed storage: An overview[J]. Science China Information Sciences, 2018,61(10):7-51.
|
[3] |
MAHDAVIANI K, KHISTI A, MOHAJER S. Bandwidth adaptive & error resilient MBR exact repair regenerating codes[J]. IEEE Transactions on Information Theory, 2019,65(5):2736-2759.
|
[4] |
LI R H, LI X T, LEEP P C, et al. Repair pipelining for erasure-coded storage [C]// Proceedings of Usenix Technical Conference. 2017:109-115.
|
[5] |
NGUYEN B, TAN H, DAVIS K, et al. Persistent octrees for parallel mesh refinement through non-volatile byte-addressable memory[J]. IEEE Transactions on Parallel and Distributed Systems, 2018,30(3):677-691.
|
[6] |
LI J, YANG S, WANG X, et al. Tree-structured data regeneration with network coding in distributed storage systems[C]// Proceedings of the International Workshop on Quality of Service. 2009:2892-2900.
|
[7] |
LI J, YANG S, WANG X, et al. Tree-structured data regeneration in distributed storage systems with regenerating codes[C]// Proceedings of the 29th IEEE International Conference on Computer Communications, Joint Conference of the IEEE Computer and Communications Societies. 2010:1-9.
|
[8] |
傅颖勋,文士林,马礼,等. 纠删码存储系统单磁盘错误重构优化方法综述[J]. 计算机研究与发展, 2018,55(1):2-3.
|
[9] |
谭子军,何连跃. 分布式存储系统中用户磁盘空间分配策略[J]. 计算机工程, 2010,36(9):44-46.
|
[10] |
DIMAKIS A G, GODFREY P B, WU Y N, et al. Network coding for distributed storage systems[J]. IEEE Transactions on Information Theory, 2010,56(9):4539-4551.
|
[11] |
VAJHA M, RAMKUMAR V, PURANIK B, et al. Clay codes: Moulding MDS codes to yield an MSR code[C]// Proceedings of the 16th USENIX Conference on File and Storage Technologies. 2018:139-154.
|
[12] |
GONG Q Y, WANG J Q, WEI D S, et al. Optimal node selection for data regeneration in heterogeneous distributed storage systems[C]// Proceedings of the 2015 44th International Conference on Parallel Processing. 2015:390-399.
|
[13] |
SUN W D, WANG Y J, PEI X Q. Tree-structured parallel regeneration for multiple data losses in distributed storage systems based on erasure codes[J]. China Communications, 2013,10(4):113-125.
|
[14] |
KENNETH W S. Cooperative regenerating codes for distributed storage systems[C]// 2011 IEEE International Conference on Communications. 2011:1-5.
|
[15] |
PEI X Q, WANG Y J, MA X K, et al. Cooperative repair based on tree structure for multiple failures in distributed storage systems with regenerating codes[C]// Proceedings of the 12th ACM International Conference on Computing Frontiers. 2015:784-792.
|
[16] |
BALAJI S B, KUMARP V. A tight lower bound on the sub-packetization level of optimal-access MSR and MDS codes[C]// 2018 IEEE International Symposium on Information Theory. 2018:2381-2385.
|
[17] |
刘佩,蒋梓逸,曹袖. 一种基于分布式存储系统中多节点修复的节点选择算法[J]. 计算机研究与发展, 2018,55(7):1557-1568.
|
[18] |
郑力明,李晓冬. 面向纠删码的低成本多节点失效修复方法[J]. 计算机工程, 2017(7):110-118.
|
[19] |
AHMAD I, WANG C C. When and by how much can helper node selection improve regenerating codes?[C]// 2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton). 2014:459-466.
|
[20] |
ZHANG H Y, LI H, HOU H X, et al. Concurrent regenerating codes and scalable application in network storage [J]. Information Theory, 2016(2):23-30.
|
[21] |
QU S, ZHANG J B, WANG X B. Asymmetric regenerating codes for heterogeneous distributed storage systems[C]// Proceedings of the IEEE International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks. 2018:1-8.
|
[22] |
RASHMI K V, SHAH N B, GU D, et al. A ‘Hitchhikers’ guide to fast and efficient data reconstruction in erasure-coded data centers[J]. Computer Communication Review, 2014,44(4):331-342.
|