Loughborough University
Leicestershire, UK
LE11 3TU
+44 (0)1509 263171
Loughborough University

Loughborough University Institutional Repository

Please use this identifier to cite or link to this item: https://dspace.lboro.ac.uk/2134/28399

Title: Computing the probability for data loss in two-dimensional parity RAIDs
Authors: Nagel, Lars
Suss, Tim
Keywords: RAID
Data loss
Tutte polynomial
Counting problem
Issue Date: 2017
Publisher: © Institute of Electrical and Electronics Engineers (IEEE)
Citation: NAGEL, L. and SUSS, T., 2017. Computing the probability for data loss in two-dimensional parity RAIDs. Presented at the 2017 13th European Dependable Computing Conference (EDCC 2017), Geneva, Switzerland, 4-8 Sept , pp. 58-65.
Abstract: Parity RAIDs are used to protect storage systems against disk failures. The idea is to add redundancy to the system by storing the parity of subsets of disks on extra parity disks. A simple two-dimensional scheme is the one in which the data disks are arranged in a rectangular grid, and every row and column is extended by one disk which stores the parity of it. In this paper we describe several two-dimensional parity RAIDs and analyse, for each of them, the probability for data loss given that f random disks fail. This probability can be used to determine the overall probability using the model of Hafner and Rao. We reduce subsets of the forest counting problem to the different cases and show that the generalised problem is #Phard. Further we adapt an exact algorithm by Stones for some of the problems whose worst-case runtime is exponential, but which is very efficient for small fixed f and thus sufficient for all real-world applications.
Description: © 2017 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
Sponsor: This work was partly developed in the ADA-FS project funded by the DFG Priority Program “Software for Exascale Computing” (SPPEXA, SPP 1648).
Version: Accepted for publication
DOI: 10.1109/EDCC.2017.14
URI: https://dspace.lboro.ac.uk/2134/28399
Publisher Link: https://doi.org/10.1109/EDCC.2017.14
ISBN: 9781538606025
Appears in Collections:Conference Papers and Presentations (Computer Science)

Files associated with this item:

File Description SizeFormat
main.pdfAccepted version375.6 kBAdobe PDFView/Open


SFX Query

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.