Parity lost and parity regained

  • Authors:

  • Andrew Krioukov;Lakshmi N. Bairavasundaram;Garth R. Goodson;Kiran Srinivasan;Randy Thelen;Andrea C. Arpaci-Dusseau;Remzi H. Arpaci-Dussea

  • Affiliations:

  • University of Wisconsin-Madison;University of Wisconsin-Madison;Network Appliance, Inc.;Network Appliance, Inc.;Network Appliance, Inc.;University of Wisconsin-Madison;University of Wisconsin-Madison

  • Venue:
  • FAST'08 Proceedings of the 6th USENIX Conference on File and Storage Technologies
  • Year:
  • 2008

Quantified Score

Hi-index 0.02

Visualization

Abstract

RAID storage systems protect data from storage errors, such as data corruption, using a set of one or more integrity techniques, such as checksums. The exact protection offered by certain techniques or a combination of techniques is sometimes unclear. We introduce and apply a formal method of analyzing the design of data protection strategies. Specifically, we use model checking to evaluate whether common protection techniques used in parity-based RAID systems are sufficient in light of the increasingly complex failure modes of modern disk drives. We evaluate the approaches taken by a number of real systems under single-error conditions, and find flaws in every scheme. In particular, we identify a parity pollution problem that spreads corrupt data (the result of a single error) across multiple disks, thus leading to data loss or corruption. We further identify which protection measures must be used to avoid such problems. Finally, we show how to combine real-world failure data with the results from the model checker to estimate the actual likelihood of data loss of different protection strategies.