Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Pyramid Codes: Flexible Schemes to Trade Space for Access Efficiency in Reliable Data Storage Systems

Pyramid Codes: Flexible Schemes to Trade Space for Access Efficiency in Reliable Data Storage... Pyramid Codes: Flexible Schemes to Trade Space for Access Efficiency in Reliable Data Storage Systems CHENG HUANG, Microsoft Research MINGHUA CHEN, Chinese University of Hong Kong JIN LI, Microsoft Research We design flexible schemes to explore the tradeoffs between storage space and access efficiency in reliable data storage systems. Aiming at this goal, two new classes of erasure-resilient codes are introduced ­ Basic Pyramid Codes (BPC) and Generalized Pyramid Codes (GPC). Both schemes require slightly more storage space than conventional schemes, but significantly improve the critical performance of read during failures and unavailability. As a by-product, we establish a necessary matching condition to characterize the limit of failure recovery, that is, unless the matching condition is satisfied, a failure case is impossible to recover. In addition, we define a maximally recoverable (MR) property. For all ERC schemes holding the MR property, the matching condition becomes sufficient, that is, all failure cases satisfying the matching condition are indeed recoverable. We show that GPC is the first class of non-MDS schemes holding the MR property. Categories and Subject Descriptors: C.4 [Computer Systems Organization]: Performance of Systems-- Reliability, availability, and serviceability; E.4 [Data]: Coding and Information Theory; E.5 [Data]: Files-- Backup/recovery http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM Transactions on Storage (TOS) Association for Computing Machinery

Pyramid Codes: Flexible Schemes to Trade Space for Access Efficiency in Reliable Data Storage Systems

Download PDF
28 pages

Loading next page...
 
/lp/association-for-computing-machinery/pyramid-codes-flexible-schemes-to-trade-space-for-access-efficiency-in-cWD2Zuk6Cl

References (61)

Publisher
Association for Computing Machinery
Copyright
Copyright © 2013 by ACM Inc.
ISSN
1553-3077
DOI
10.1145/2435204.2435207
Publisher site
See Article on Publisher Site

Abstract

Pyramid Codes: Flexible Schemes to Trade Space for Access Efficiency in Reliable Data Storage Systems CHENG HUANG, Microsoft Research MINGHUA CHEN, Chinese University of Hong Kong JIN LI, Microsoft Research We design flexible schemes to explore the tradeoffs between storage space and access efficiency in reliable data storage systems. Aiming at this goal, two new classes of erasure-resilient codes are introduced ­ Basic Pyramid Codes (BPC) and Generalized Pyramid Codes (GPC). Both schemes require slightly more storage space than conventional schemes, but significantly improve the critical performance of read during failures and unavailability. As a by-product, we establish a necessary matching condition to characterize the limit of failure recovery, that is, unless the matching condition is satisfied, a failure case is impossible to recover. In addition, we define a maximally recoverable (MR) property. For all ERC schemes holding the MR property, the matching condition becomes sufficient, that is, all failure cases satisfying the matching condition are indeed recoverable. We show that GPC is the first class of non-MDS schemes holding the MR property. Categories and Subject Descriptors: C.4 [Computer Systems Organization]: Performance of Systems-- Reliability, availability, and serviceability; E.4 [Data]: Coding and Information Theory; E.5 [Data]: Files-- Backup/recovery

Journal

ACM Transactions on Storage (TOS) – Association for Computing Machinery

Published: Mar 1, 2013

There are no references for this article.