The Community for Technology Leaders
2016 IEEE 35th International Performance Computing and Communications Conference (IPCCC) (2016)
Las Vegas, NV, USA
Dec. 9, 2016 to Dec. 11, 2016
ISSN: 2374-9628
ISBN: 978-1-5090-5253-0
pp: 1-8
Vero Estrada-Galifianes , Computer Science Department, University of Neuchâtel, Neuchâtel, NE, Switzerland
Jehan-Francois Paris , Department of Computer Science, University of Houston, Houston, TX, USA
Pascal Felber , Computer Science Department, University of Neuchâtel, Neuchâtel, NE, Switzerland
ABSTRACT
We study the reliability of open and close entanglements, two simple data distribution layouts for log-structured append-only storage systems. Both techniques use equal numbers of data and parity drives and generate their parity data by computing the exclusive or (XOR) of the most recently appended data with the contents of their last parity drive. While open entanglements maintain an open chain of data and parity drives, closed entanglements include the exclusive or of the contents of their first and last data drives. We evaluate five-year reliabilities of open and closed entanglements, for two different array sizes and drive failure rates. Our results show that open entanglements provide much better five-year reliabilities than mirroring and reduce the probability of a data loss by at least 90 percent over a period of five years. Closed entanglements perform even better and reduce the same probability by at least 98 percent.
INDEX TERMS
Arrays, Reliability, Drives, Organizations, Layout, Computer science, Indexes
CITATION

V. Estrada-Galifianes, J. Paris and P. Felber, "Simple data entanglement layouts with high reliability," 2016 IEEE 35th International Performance Computing and Communications Conference (IPCCC), Las Vegas, NV, USA, 2016, pp. 1-8.
doi:10.1109/PCCC.2016.7820651
88 ms
(Ver 3.3 (11022016))