Abstract
An examination is made of 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. The authors show codes that give highly reliable data storage with low redundant data overhead for arrays of 1000 information disks.
Original language | English (US) |
---|---|
Title of host publication | Unknown Host Publication Title |
Pages | 123-132 |
Number of pages | 10 |
DOIs | |
State | Published - 1989 |
Event | Third International Conference on Architectural Support for Programming Languages and Operating Systems - Boston, MA, USA Duration: Apr 3 1989 → Apr 6 1989 |
Other
Other | Third International Conference on Architectural Support for Programming Languages and Operating Systems |
---|---|
City | Boston, MA, USA |
Period | 4/3/89 → 4/6/89 |
ASJC Scopus subject areas
- Engineering(all)