论文信息 - SpreadStore: A LDPC Erasure Code Scheme for Distributed Storage System

SpreadStore: A LDPC Erasure Code Scheme for Distributed Storage System

A wide proliferation of distributed storage systems call for more robust and efficient systems than regular replication based storage systems. The Low density parity check (LDPC) codes have become a popular alternative to traditional Reed-Solomon (RS) erasure codes due to their low computational complexity. In this paper we propose, Spread Store- a distributed storage system based on LDPC code. Also, a brief analysis is made by examining different LDPC codes from the perspective of their efficiency and erasure handling capabilities.

[1] Robert G. Gallager,et al. Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[2] Michael Luby,et al. LT codes , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[3] Nuno Santos,et al. Exploring high performance distributed file storage using LDPC codes , 2006, Parallel Comput..

[4] David J. C. MacKay,et al. Information Theory, Inference, and Learning Algorithms , 2004, IEEE Transactions on Information Theory.

[5] Sarah J. Johnson,et al. Practical Interleavers for Systematic Repeat-Accumulate Codes , 2006, 2006 IEEE 63rd Vehicular Technology Conference.

[6] Dariush Divsalar,et al. Coding theorems for 'turbo-like' codes , 1998 .

[7] Randy H. Katz,et al. Patterson: "raid: high-performance, reliable secondary storage , 1994 .

[8] J. Plank,et al. On the Practical Use of LDPC Erasure Codes for Distributed Storage Applications , 2003 .

[9] Garth A. Gibson,et al. RAID: high-performance, reliable secondary storage , 1994, CSUR.

[10] Sarah J. Johnson. Introducing Low-Density Parity-Check Codes , 2008 .

[11] Daniel A. Spielman,et al. Efficient erasure correcting codes , 2001, IEEE Trans. Inf. Theory.

[12] Yu Kou,et al. Low Density Parity Check Codes Based on Finite Geometries: A Rediscovery and More , 1999 .