Pyramid codes: Flexible schemes to trade space for access efficiency in reliable data storage systems

被引：175

作者：

Huang, Cheng ^{[1
]}

Chen, Minghua ^{[1
]}

Li, Jin ^{[1
]}

机构：

[1] Microsoft Res, Redmond, WA 98052 USA

来源：

SIXTH IEEE INTERNATIONAL SYMPOSIUM ON NETWORK COMPUTING AND APPLICATIONS, PROCEEDINGS | 2007年

关键词：

D O I：

10.1109/NCA.2007.37

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

To flexibly explore the trade-offs between storage space and access efficiency in reliable data storage Systems, we describe two classes of erasure resilient coding schemes: basic and generalized Pyramid Codes. The basic Pyramid Codes can be simply derived from any existing codes, and thus all known efficient encoding/decoding techniques directly apply. The generalized Pyramid Codes are radically advanced new codes, which can further improve access efficiency and/or reliability upon the basic Pyramid Codes. We also establish a necessary condition for any failure pattern to be ever recoverable, and show that the generalized Pyramid Codes are optimal in failure recovery (i.e., the necessary condition is also sufficient, and any failure pattern that is ever recoverable can indeed be recovered).

引用

页码：79 / +

页数：3

共 23 条

[1]

AGUILERA MK, 2005, USING ERASURE CODES

[2] EVENODD - AN EFFICIENT SCHEME FOR TOLERATING DOUBLE-DISK FAILURES IN RAID ARCHITECTURES [J].

BLAUM, M ;

BRADY, J ;

BRUCK, J ;

MENON, J .

IEEE TRANSACTIONS ON COMPUTERS, 1995, 44 (02) :192-202

[3]

CHEN M, 2007, IN PRESS ISIT 2007 N

[4] RAID - HIGH-PERFORMANCE, RELIABLE SECONDARY STORAGE [J].

CHEN, PM ;

LEE, EK ;

GIBSON, GA ;

KATZ, RH ;

PATTERSON, DA .

ACM COMPUTING SURVEYS, 1994, 26 (02) :145-185

[5]

CORBETT P, 2005, FAST 2005 SAN FRANC

[6]

FENG GL, 2005, IEEE T COMPUTERS, V54

[7]

GHEMAWAT S, 2003, SOSP 2003 LAK GEORG

[8]

HAFNER JL, 2005, FAST 2005 SAN FRANC

[9]

HAMILTON J, 2007, CIDR 2007 JAN

[10]

HUANG C, 2005, FAST 2005 SAN FRANC

← 1 2 3 →