[1] |
Brown B, Chui M,Manyika J. Are you ready for the era of ‘big data’?[J].McKinsey & Quarterly, 2011, 4(1):24-35.
|
[2] |
Li Q, Xiang Q, Wang Y X, et al. More than capacity: Performance-oriented evolution of Pangu in Alibaba[C]∥Proc of the 21st USENIX Conference on File and Storage Technologies, 2023:331-345.
|
[3] |
Li P F, Hua Y, Zuo P F, et al. ROLEX:A scalable RDMA-oriented learned key-value store for disaggregated memory systems[C]∥Proc of the 21st USENIX Conference on File and Storage Technologies, 2023:99-114.
|
[4] |
Zhang F, Wan W T, Zhang C Y, et al. CompressDB:Ena- bling efficient compressed data direct processing for various databases[C]∥Proc of the 2022 International Conference on Management of Data, 2022:1655-1669.
|
[5] |
Nygren E, Sitaraman R K, Sun J. The Akamai network:A platform for high-performance Internet applications[J]. ACM SIGOPS Operating Systems Review, 2010, 44(3):2-19.
|
[6] |
Benson T,Akella A, Maltz D A. Network traffic characteristics of data centers in the wild[C]∥Proc of the 10th ACM SIGCOMM Conference on Internet Measurement, 2010:267-280.
|
[7] |
罗象宏, 舒继武. 存储系统中的纠删码研究综述[J]. 计算机研究与发展, 2012, 49(1):1-11.
|
|
Luo Xiang-hong, Shu Ji-wu. Summary of research for erasure code in storage system [J]. Journal of Computer Research and Development, 2012, 49(1):1-11.
|
[8] |
许方亮,王意洁,裴晓强. NTar:基于网络拓扑的纠删码树型修复方法[J]. 计算机研究与发展, 2013, 50(Suppl.):37-44.
|
|
Xu Fang-liang, Wang Yi-jie, Pei Xiao-qiang. NTar:Network topology-based tree-structured data reconstruction scheme for erasure codes [J]. Journal of Computer Research and Development, 2013, 50(Suppl.):37-44.
|
[9] |
Mitra S, Panta R, Ra M R, et al. Partial-parallel-repair (PPR):A distributed technique for repairing erasure coded storage[C]∥Proc of the 11th European Conference on Computer Systems, 2016:1-16.
|
[10] |
Li X, Yang Z, Li J, et al. Repair pipelining for erasure- coded storage:Algorithms and evaluation[J].ACM Tran- sactions on Storage, 2021, 17(2):1-29.
|
[11] |
Dimakis A G, Godfrey P B, Wu Y, et al. Network coding for distributed storage systems[J]. IEEE Transactions on Information Theory, 2010, 56(9):4539-4551.
|
[12] |
Lee S J , Sharma P , Banerjee S ,et al. Measuring bandwidth between PlanetLab nodes[C]∥Proc of Passive and Active Network Measurement, 2005:292-305.
|
[13] |
Qian Yu, Maddah-Ali M A, Avestimehr A S. Straggler mitigation in distributed matrix multiplication:Fundamental limits and optimal coding[J].IEEE Transactions on Information Theory, 2020, 66(3):1920-1933.
|
[14] |
Dimakis A G, Ramchandran K, Wu Y, et al. A survey on network codes for distributed storage[J]. Proceedings of the IEEE, 2011, 99(3):476-489.
|
[15] |
Rashmi K V, Shah N B, Kumar P V, et al. Optimal exact-regenerating codes for distributed storage at the MSR and MBR points via a product-matrix construction[J]. IEEE Transactions on Information Theory, 2011, 57(8):5227-5239.
|
[16] |
Wang Y, Wei D S, Yin X R, et al. Heterogeneity-aware data regeneration in distributed storage systems[C]∥Proc of IEEE Conference on Computer Communications, 2014:1878-1886.
|
[17] |
Li X L, Cheng K Y, Tang K C, et al. ParaRC:Embracing sub-packetization for repair parallelization in MSR-coded storage[C]∥Proc of the 21st USENIX Conference on File and Storage Technologies, 2023:17-32.
|
[18] |
Vajha M , Ramkumar V , Puranik B ,et al. Clay codes:Moulding MDS codes to yield an MSR code[C]∥Proc of the 16th USENIX Conference on File and Storage Technologies, 2018:139-153.
|
[19] |
Li J, Yang S, Wang X, et al. Tree-structured data regene- ration in distributed storage systems with regenerating codes[C]∥Proc of IEEE Conference on Computer Communications, 2010:1-9.
|
[20] |
Kundur V. Prims algorithm[EB/OL]. [2023-07-26]. http://en.wikipedia.org/wiki/Primsalgorithm.
|
[21] |
Duminuco A, Biersack E. A practical study of regenerating codes for peer-to-peer backup systems[C]∥Proc of the 29th IEEE International Conference on Distributed Computing Systems, 2009:376-384.
|