Close category search window
 

SpreadStore: A LDPC Erasure Code Scheme for Distributed Storage System

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

7 Author(s)
Harihara, S.G. ; Innovations Lab., Tata Consultancy Services, Bangalore, India ; Janakiram, B. ; Chandra, M.G. ; Aravind, K.G.
more authors

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.

Published in:
Data Storage and Data Engineering (DSDE), 2010 International Conference on

Date of Conference: 9-10 Feb. 2010

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.