Software-Based Erasure Codes for Scalable Distributed Storage

Authors:
Joseph A. Cooley;Jeremy L. Mineweaser;Leslie D. Servi;Eushiuan T. Tsung
Affiliations:
-;-;-;-
Venue:
MSS '03 Proceedings of the 20 th IEEE/11 th NASA Goddard Conference on Mass Storage Systems and Technologies (MSS'03)
Year:
2003

Citing 5
Cited 1

A case for redundant arrays of inexpensive disks (RAID)

SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Practical loss-resilient codes

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
OceanStore: an architecture for global-scale persistent storage

ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
Active Disks for Large-Scale Data Processing

Computer
Erasure Coding Vs. Replication: A Quantitative Comparison

IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems

A three-tier information management architecture for mobile grid environments

Proceedings of the 6th International Conference on Advances in Mobile Computing and Multimedia

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a new class of erasure codes, Lincoln Erasure codes (LEC), applicable to large-scale distributed storage that includes thousands of disks attached to multiple networks. A high-performance software implementation that demonstrates the capability to meet these anticipated requirements is described. A framework for evaluation of candidate codes wasdeveloped to support in-depth analysis. When compared with erasure codes based on the work of Reed-Solomon and Luby, tests indicate LEC has a higher throughput for encoding and decoding and lower probability of failure across a range of test conditions. Strategies are described for integration with storage-related hardware and software.