Electrical Engineering
      and Computer Sciences

Electrical Engineering and Computer Sciences

COLLEGE OF ENGINEERING

UC Berkeley

Coding Techniques for Handling Failures in Large Disk Arrays

Garth A. Gibson, Lisa Hellerstein, Richard M. Karp, Randy H. Katz and David A. Patterson

EECS Department
University of California, Berkeley
Technical Report No. UCB/CSD-88-477
December 1988

http://www.eecs.berkeley.edu/Pubs/TechRpts/1988/CSD-88-477.pdf

The ever increasing need for I/O bandwidth will be met with ever larger arrays of disks. These arrays require redundancy to protect against data loss. This paper examines alternative choices for encodings, or codes, that reliably store information in disk arrays. Codes are selected to maximize mean time to data loss or minimize disks containing redundant data, but are all constrained to minimize performance penalties associated with updating information or recovering from catastrophic disk failures. We show codes that give highly reliable data storage with low redundant data overhead for arrays of 1000 information disks.


BibTeX citation:

@techreport{Gibson:CSD-88-477,
    Author = {Gibson, Garth A. and Hellerstein, Lisa and Karp, Richard M. and Katz, Randy H. and Patterson, David A.},
    Title = {Coding Techniques for Handling Failures in Large Disk Arrays},
    Institution = {EECS Department, University of California, Berkeley},
    Year = {1988},
    Month = {Dec},
    URL = {http://www.eecs.berkeley.edu/Pubs/TechRpts/1988/6055.html},
    Number = {UCB/CSD-88-477},
    Abstract = {The ever increasing need for I/O bandwidth will be met with ever larger arrays of disks. These arrays require redundancy to protect against data loss. This paper examines alternative choices for encodings, or codes, that reliably store information in disk arrays. Codes are selected to maximize mean time to data loss or minimize disks containing redundant data, but are all constrained to minimize performance penalties associated with updating information or recovering from catastrophic disk failures. We show codes that give highly reliable data storage with low redundant data overhead for arrays of 1000 information disks.}
}

EndNote citation:

%0 Report
%A Gibson, Garth A.
%A Hellerstein, Lisa
%A Karp, Richard M.
%A Katz, Randy H.
%A Patterson, David A.
%T Coding Techniques for Handling Failures in Large Disk Arrays
%I EECS Department, University of California, Berkeley
%D 1988
%@ UCB/CSD-88-477
%U http://www.eecs.berkeley.edu/Pubs/TechRpts/1988/6055.html
%F Gibson:CSD-88-477