Low-Redundancy Two-Dimensional RAID Arrays03/20/2013
Speaker(s) : Prof. Jehan-François Pâris, U. of Houston
Most extant two-dimensional RAID arrays tend to use a square matrix organization such that each row and each column of the array forms a parity stripe. These arrays require 2k parity disks to protect the contents of k^2 data disks against all double disk failures and most triple disk failures. We investigate the reliability of a lesser known organization that allows k parity disks to protect k(k-1)/2 data disks against all double and most triple failures. We found that this organization can provide the same or better mean times to data loss (MTTDLs) than organizations requiring more parity disks to protect the same number of data disks.
Joint work with Ahmed Amer, Santa Clara U., and Thomas J. E. Schwarz, S. J., Universidad Católica del Uruguay.
Jehan-François Pâris is Professor of Computer Science at the University of Houston. He was formerly faculty at Purdue University, West Lafayette, Indiana and the University of California, San Diego. Dr. Pâris received his Ingénieur Civil degree from the Université Libre de Bruxelles, his Diplôme d'Etudes Approfondies from the Université de Paris VI, his Licence et Maîtrise en Informatique from the Facultés Universitaires de Namur and his Ph. D. in EECS from the University of California, Berkeley. His past and present research interests include storage system reliability, scalable reliable multicast protocols, distribution protocols for video-on-demand, and memory hierarchies. He is a member of the ACM and a senior member of the IEEE.
More details here …
Marc.Shapiro (at) nulllip6.fr