Ruizhen Wu
ABSTRACT
A systematic Vandermonde CODEC PE for erasure codes is proposed in this paper. The algorithm of the proposed CODEC PE is constructed by the Toeplitz matrix's characteristic first. Then split the decoding matrix into several small matrixes based on different scenarios. With that, the decoding operation can optimize to fixed parameters saved in memory and fetch to do the simple calculations when needed. After the combinatorial operation, the CODEC PE will give the final output. The PE is designed to work for both encoding and decoding with the same module but for different data and operations. The PE number is configurable to have the best performance in different erasure codes “r” situations and backward compatible by the control of the config module. The hardware architecture is fully verified at RTL level and synthesized with GF 12nm technology lib and simulation results showed 73.5% to 79.8% speed advantages compared to Gaussian elimination.
- Erik M. Ferragut. 2009. A dynamic erasure code for multicasting live data. In Proceedings of the 5th Annual Workshop on Cyber Security and Information Intelligence Research: Cyber Security and Information Intelligence Challenges and Strategies (CSIIRW '09>). Association for Computing Machinery, New York, NY, USA, Article 65, 1–4. DOI:https://doi-org.libproxy.berkeley.edu/10.1145/1558607.Google Scholar
- Ojus Thomas Lee, Vijay Sharma, S. D Madhu Kumar, and Priya Chandran. 2019. Modelling multi level consistency in erasure code based storage systems. In Proceedings of the 34th ACM/SIGAPP Symposium on Applied Computing (SAC '19). Association for Computing Machinery, New York, NY, USA, 122–129. DOI:https://doi-org.libproxy.berkeley.edu/10.1145/3297280.3297294Google ScholarDigital Library
- Luigi Rizzo. 1997. Effective erasure codes for reliable computer communication protocols. SIGCOMM Comput. Commun. Rev. 27, 2 (Apr. 1997), 24–36. DOI:https://doi-org.libproxy.berkeley.edu/10.1145/263876.263881Google ScholarDigital Library
- James Hendricks, Gregory R. Ganger, and Michael K. Reiter. 2007. Verifying distributed erasure-coded data. In Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing (PODC '07). Association for Computing Machinery, New York, NY, USA, 139–146. DOI:https://doi-org.libproxy.berkeley.edu/10.1145/1281100.1281122Google Scholar
- Tianli Zhou and Chao Tian. 2020. Fast Erasure Coding for Data Storage: A Comprehensive Study of the Acceleration Techniques. ACM Trans. Storage 16, 1, Article 7 (April 2020), 24 pages. DOI:https://doi-org.libproxy.berkeley.edu/10.1145/3375554Google ScholarDigital Library
- Ruizhen Wu, Lin Wang, and Yan Wu. 2020. A High-Speed Cauchy CODEC Algorithm for Distributed Storage System. Proceedings of the 2020 International Conference on Internet Computing for Science and Engineering. Association for Computing Machinery, New York, NY, USA, 20–24. DOI:https://doi.org/10.1145/3424311.3424313Google ScholarDigital Library
- Vinay Amatya, Abhinav Vishnu, Charles Siegel, and Jeff Daily. 2017. What does fault tolerant deep learning need from MPI? In Proceedings of the 24th European MPI Users' Group Meeting (EuroMPI '17). Association for Computing Machinery, New York, NY, USA, Article 13, 1–11. DOI:https://doi-org.libproxy.berkeley.edu/10.1145/3127024.3127037Google ScholarDigital Library
- Marco Scavuzzo, Damian A. Tamburri, and Elisabetta Di Nitto. 2016. Providing big data applications with fault-tolerant data migration across heterogeneous NoSQL databases. In Proceedings of the 2nd International Workshop on BIG Data Software Engineering (BIGDSE '16). Association for Computing Machinery, New York, NY, USA, 26–32. DOI:https://doi-org.libproxy.Google ScholarDigital Library
- b Arun Subbiah and Douglas M. Blough. 2005. An approach for fault tolerant and secure data storage in collaborative work environments. In Proceedings of the 2005 ACM workshop on Storage security and survivability (StorageSS '05). Association for Computing Machinery, New York, NY, USA, 84–93. DOI:https://doi-org.libproxy.berkeley.edu/10.1145/1103780.1103793 erkeley.edu/10.1145/2896825.2896831Google Scholar
- Arun Subbiah and Douglas M. Blough. 2005. An approach for fault tolerant and secure data storage in collaborative work environments. In Proceedings of the 2005 ACM workshop on Storage security and survivability (StorageSS '05). Association for Computing Machinery, New York, NY, USA, 84–93. DOI:https://doi-org.libproxy.berkeley.edu/10.1145/1103780.1103793Google Scholar
- Qing Liu, Dan Feng, Hong Jiang, Yuchong Hu, and Tianfeng Jiao. 2017. Systematic Erasure Codes with Optimal Repair Bandwidth and Storage. ACM Trans. Storage 13, 3, Article 26 (October 2017), 27 pages. DOI:https://doi-org.libproxy.berkeley.edu/10.1145/3109479Google ScholarDigital Library
- Michael Luby, Roberto Padovani, Thomas J. Richardson, Lorenz Minder, and Pooja Aggarwal. 2019. Liquid Cloud Storage. ACM Trans. Storage 15, 1, Article 2 (April 2019), 49 pages. DOI:https://doi-org.libproxy.berkeley.edu/10.1145/3281276Google ScholarDigital Library
- Michael P. Mesnier and Jason B. Akers. 2011. Differentiated storage services. SIGOPS Oper. Syst. Rev. 45, 1 (January 2011), 45–53. DOI:https://doi-org.libproxy.berkeley.edu/10.1145/1945023.1945030Google ScholarDigital Library
- Kishori M. Konwar, N. Prakash, Nancy Lynch, and Muriel Médard. 2017. A Layered Architecture for Erasure-Coded Consistent Distributed Storage. In Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC '17. Association for Computing Machinery, New York, NY, USA, 63–72. DOI:https://doi-org.libproxy.berkeley.edu/10.1145/3087801.3087832Google ScholarDigital Library
- N Nagendra Prasad and J Rajesh Kumar, " High Speed Error Detection and Data Recovery Architecture for Video Applications," International Journal of Electrical and Electronic Engineering & Telecommunications, Vol. 2, No. 4, pp. 62-75, October 2013.Google Scholar
- Ghania Zerari, Abderrezak Guessoum, and Rachid Beguenane, "A New Design for Reducing Logic Utilizations in FPGA-Based Stochastic LDPC Decoders," International Journal of Electrical and Electronic Engineering & Telecommunications, Vol. 6, No. 4, pp. 1-5, October 2017. DOI: 10.18178/ijeetc.6.4.1-5. DOI:10.18178/ijeetc.6.4.1-5Google Scholar
Recommendations
Erasure Decoding for Gabidulin Codes
We present a new approach of the decoding algorithm for Gabidulin Codes. In the same way as efficient erasure decoding for Generalized Reed Solomon codes by using the structure of the inverse of the VanderMonde matrices, we show that, the erasure(t ...
Symmetric functions and the Vandermonde matrix
This work deduces the lower and the upper triangular factors of the inverse of the Vandermonde matrix using symmetric functions and combinatorial identities. The <i>L</i> and <i>U</i> matrices are in turn factored as bidiagonal matrices. The elements of ...
Burst erasure correcting LDPC codes
In this paper low-density parity-check (LDPC) codes are designed for burst erasure channels. Firstly, lower bounds for the maximum length erasure burst that can always be corrected with message-passing decoding are derived as a function of the parity-...
Comments