Erasure codes with small overhead factor and their distributed storage applications

Forty-first Annual Conference on Information Sciences and Systems, CISS 2007 - Proceedings

Volumn , Issue , 2007, Pages 80-85

  Kameyama, H ^a   Sato, Y ^a  

^a FUJITSU LABORATORIES LTD   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED STORAGE APPLICATIONS; PARITY CHECK MATRICES;

APPROXIMATION THEORY; DISTRIBUTED COMPUTER SYSTEMS; INFORMATION MANAGEMENT; MATRIX ALGEBRA; MONTE CARLO METHODS;

CODES (SYMBOLS);

EID: 44049097729     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CISS.2007.4298277     Document Type: Conference Paper

References (12)

1. Mario Blaum, Jim Brady, Jehoshua Bruck, and Jai Menon, EVENODD: An Efficient Scheme for Tolerating Double Disk Failures in RAID Architectures. IEEE Transactions on Computers, 44(2): 192-202, February 1995.
2. Peter M. Chen, Edward K. Lee, Garth A. Gibson, Randy H. Katz, and David A. Patterson, RAID: High-performance, reliable secondary storage, ACM Computing Surveys, 26(2): 145-185, 1994.
3. Juan A. Garay, Rosario Gennaro, Charanjit Jutla, and Tal Rabin. Secure distributed storage and retrieval, In Mavronicolas, M. and Tsigas, Ph., editors, Lecture Notes in Computer Science: Distributed Algorithms, Proc. of 11th International Workshop, WDAG'97, Saarbrucken, Germany, volume 1320, pages 275-289, Springer, September 1997.
4. James Lee Hafner. WEAVER Codes: Highly fault tolerant erasure codes for storage systems. In FAST-2005: 4th Usenix Conference on File and Storage Technologies, San Francisco, December 2005.
5. James Lee Hafner. Hover erasure codes for disk arrays. In 2006 International Conference on Dependable Systems and Networks (DSN 2006), pages 25-28, Philadelphia, Pennsylvania, June 2006.
6. C. Huang and L. Xu. STAR: An Efficient Coding Scheme for Correcting Triple Storage Node Failures, In 2005 USENIX Conference on File and Storage Technologies (FAST 2005), San Francisco, CA, Dec 2005.
7. Hugo Krawczyk. Distributed fingerprints and secure information dispersal. In PODC '93: Proceedings of the twelfth annual. ACM symposium on Principles: of distributed computing, pages 207-218, New York, NY, USA, 1993. ACM Press.
8. Luby, Mitzenmacher, and Shokrollahi. Analysis of Random Processes via And-Or Tree Evaluation, In SODA: ACM-SIAM Symposium on Discrete Algorithms (A Conference on Theoretical and Experimental Analysis of Discrete Algorithms), 1998.
9. J. S. Plank, A. L. Buchsbaurn, R. L. Collins, and M. G. Thomason, Small Parity-Check Erasure Codes - Exploration and Observations. In PSN-05: International Conference on Dependable Systems and Networks, Yokohama, Japan, 2005, IEEE.
10. J. S. Plank and M. G:. Thomason. On the Practical Use of LDPC Erasure Codes for Distributed Storage Applications. Technical/Report CS-03-510, University of Tennessee, September 2003.
11. James S, Plank and Lihao Xu. Optimizing Cauchy Reed-Solomon Codes for Fault-Tolerant Network Storage Applications. In NCA '06: Proceedings of the Fifth IEEE: International Symposium on Network Computing and Applications, pages 173-180, Washington, DC, USA, 2006. IEEE Computer Society.
12. Michael O, Rabin, Efficient dispersal of information for security, load balancing, and fault tolerance. J. ACM, 36(2):335-348, 1989.