DocumentCode :
2178865
Title :
SpreadStore: A LDPC Erasure Code Scheme for Distributed Storage System
Author :
Harihara, S.G. ; Janakiram, Balaji ; Chandra, M. Girish ; Aravind, K.G. ; Kadhe, Swanand ; Balamuralidhar, P. ; Adiga, B.S.
Author_Institution :
Innovations Lab., Tata Consultancy Services, Bangalore, India
fYear :
2010
fDate :
9-10 Feb. 2010
Firstpage :
154
Lastpage :
158
Abstract :
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.
Keywords :
Reed-Solomon codes; computational complexity; parity check codes; LDPC erasure code scheme; RS erasure codes; Reed-Solomon erasure codes; SpreadStore; computational complexity; distributed storage system; low density parity check codes; spread store; Data engineering; Decoding; Encoding; Fault tolerant systems; Local area networks; Memory; Parity check codes; Prototypes; Reed-Solomon codes; Robustness; Distributed storage systems; Erasure codes; Low density parity check codes;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Data Storage and Data Engineering (DSDE), 2010 International Conference on
Conference_Location :
Bangalore
Print_ISBN :
978-1-4244-5678-9
Type :
conf
DOI :
10.1109/DSDE.2010.61
Filename :
5452613
Link To Document :
بازگشت