Ordering disks for double erasure codes

M. B. Cohen, Charles Colbourn

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Scopus citations

Abstract

Disk arrays have been designed with two competing goals in mind, the ability to reconstruct erased disks (reliability), and the speed with which information can be read, written, and reconstructed (performance). The substantial loss in performance of write operations as reliability requirements increase has resulted in an emphasis on performance at the expense of reliability. This has proved acceptable given the relatively small numbers of disks in current disk arrays. We develop a method for improving the performance of write operations in disk arrays capable of correcting any double erasure, by ordering the columns of the erasure code to minimize the amount of parity information that requires updating. For large disk arrays, this affords a method to support the reliability needed without the generally accepted loss of performance.

Original languageEnglish (US)
Title of host publicationAnnual ACM Symposium on Parallel Algorithms and Architectures
Pages229-236
Number of pages8
StatePublished - 2001
Externally publishedYes
Event13th Annual Symposium on Parallel Algorithms and Architectures (SPAA 2001) - Crete Island, Greece
Duration: Jul 3 2001Jul 6 2001

Other

Other13th Annual Symposium on Parallel Algorithms and Architectures (SPAA 2001)
CountryGreece
CityCrete Island
Period7/3/017/6/01

ASJC Scopus subject areas

  • Software
  • Safety, Risk, Reliability and Quality

Cite this