Flexible usage of redundancy in disk arrays

DOI10.1007/S002240000132zbMath0933.68007OpenAlexW1964042205WikidataQ127724376 ScholiaQ127724376MaRDI QIDQ1818093

Ian M. Sutherland, Eric J. Schwabe

Publication date: 4 January 2000

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002240000132

zbMATH Keywords

parity declusteringmultiple-fault tolerance

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Computer system organization (68M99)

Related Items (2)

A construction method for optimally universal hash families and its consequences for the existence of RBIBDs ⋮ Optimizing large data transfers in parity-declustered data layouts

Uses Software

• EVENODD

This page was built for publication: Flexible usage of redundancy in disk arrays