The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Pyramid Codes: Flexible Schemes to Trade Space for Access Efficiency in Reliable Data Storage Systems
Abstract
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).
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Theory of Error-Correcting Codes
(1977) · North-Holland Mathematical Library · doi:10.1016/s0924-6509(08)x7030-8 · Cited by 10,760
Ghemawat, S., Gobioff, H., & Leung, S.-T. (2003) · ACM SIGOPS Operating Systems Review · doi:10.1145/1165389.945450 · Cited by 4,984
Error control coding : fundamentals and applications
Lin, S., & Costello, D. J. (1983) · Medical Entomology and Zoology · Cited by 4,296
Polynomial Codes Over Certain Finite Fields
Reed, I. S., & Solomon, G. (1960) · Journal of the Society for Industrial and Applied Mathematics · doi:10.1137/0108018 · Cited by 3,662
Combinatorial optimization. Polyhedra and efficiency.
Schrijver, A. (2003) · UvA-DARE (University of Amsterdam) · Cited by 3,045
OceanStore: an architecture for global-scale persistent storage
Kubiatowicz, J., Bindel, D., Chen, Y., Czerwinski, S., Eaton, P., Geels, D., Gummadi, R., Rhea, S., Weatherspoon, H., Weimer, W., et al. (2000) · ACM SIGPLAN Notices · doi:10.1145/356989.357007 · Cited by 2,002
Ghemawat, S., Gobioff, H., & Leung, S.-T. A. (2003) · doi:10.1145/945449.945450 · Cited by 1,347
RAID: high-performance, reliable secondary storage
Chen, P. M., Lee, E. K., Gibson, G. A., Katz, R. H., & Patterson, D. A. (1994) · ACM Computing Surveys · doi:10.1145/176979.176981 · Cited by 1,198
Error Control Coding: Fundamentals and Applications
Darnell, M. (1985) · IEE Proceedings F Communications, Radar and Signal Processing · doi:10.1049/ip-f-1.1985.0011 · Cited by 991
OceanStore: an architecture for global-scale persistent storage
Kubiatowicz, J., Bindel, D., Chen, Y., Czerwinski, S., Eaton, P., Geels, D., Gummadi, R., Rhea, S., Weatherspoon, H., Weimer, W., et al. (2000) · Proceedings of the ninth international conference on Architectural support for programming languages and operating systems · doi:10.1145/378993.379239 · Cited by 869
Disk failures in the real world: what does an MTTF of 1,000,000 hours mean to you?
Schroeder, B., & Gibson, G. A. (2007) · Cited by 762
Failure trends in a large disk drive population
Pinheiro, E., Weber, W.-D., & Barroso, L. A. (2007) · Cited by 736
EVENODD: an efficient scheme for tolerating double disk failures in RAID architectures
Blaum, M., Brady, J., Bruck, J., & Menon, J. (1995) · IEEE Transactions on Computers · doi:10.1109/12.364531 · Cited by 689
Row-diagonal parity for double disk failure correction
Corbett, P. F., English, B., Goel, A., Grcanac, T., Kleiman, S. L., Leong, J., & Sankar, S. (2004) · File and Storage Technologies · Cited by 556
A tutorial on Reed-Solomon coding for fault-tolerance in RAID-like systems
Plank, J. S. (1997) · Software: Practice and Experience · doi:10.1002/(sici)1097-024x(199709)27:9<995::aid-spe111>3.0.co;2-6 · Cited by 525
X-code: MDS array codes with optimal encoding
Xu, L., & Bruck, J. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.746809 · Cited by 398
STAR : An Efficient Coding Scheme for Correcting Triple Storage Node Failures
Huang, C., & Xu, L. (2008) · IEEE Transactions on Computers · doi:10.1109/tc.2007.70830 · Cited by 257
Self-citationWEAVER codes: highly fault tolerant erasure codes for storage systems
Hafner, J. L. (2005) · File and Storage Technologies · doi:10.5555/1251028.1251044 · Cited by 186
Coding techniques for handling failures in large disk arrays
Hellerstein, L., Gibson, G. A., Karp, R. M., Katz, R. H., & Patterson, D. A. (1994) · Algorithmica · doi:10.1007/bf01185210 · Cited by 143
HoVer Erasure Codes For Disk Arrays
Hafner, J. L. (2006) · International Conference on Dependable Systems & Networks/Proceedings · doi:10.1109/dsn.2006.40 · Cited by 133
An Architecture for Modular Data Centers.
Hamilton, J. R. (2006) · Conference on Innovative Data Systems Research · Cited by 65
Architecture for Modular Data CentersPreprint
Hamilton, J. R. (2006) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0612110 · Cited by 49
Cited by
Network Coding for Distributed Storage Systems
Dimakis, A. G., Godfrey, P. B., Wu, Y., Wainwright, M. J., & Ramchandran, K. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2054295 · Cited by 1,914
On the Locality of Codeword Symbols
Gopalan, P., Huang, C., Simitci, H., & Yekhanin, S. (2012) · IEEE Transactions on Information Theory · doi:10.1109/tit.2012.2208937 · Cited by 831
Self-citationSpeeding Up Distributed Machine Learning Using Codes
Lee, K., Lam, M., Pedarsani, R., Papailiopoulos, D., & Ramchandran, K. (2018) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2736066 · Cited by 829
XORing elephants: novel erasure codes for big data
Sathiamoorthy, M., Asteris, M., Papailiopoulos, D., Dimakis, A. G., Vadali, R., Chen, S., & Borthakur, D. (2013) · Proceedings of the VLDB Endowment · doi:10.14778/2535573.2488339 · Cited by 689
Optimal linear codes with a local-error-correction property
Prakash, N., Kamath, G. M., Lalitha, V., & Kumar, P. V. (2012) · 2012 IEEE International Symposium on Information Theory Proceedings · doi:10.1109/isit.2012.6284028 · Cited by 295
Metadata
- Authors
- Huang, C., Chen, M., & Li, J.
- Venue
- Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007)
- Publisher
- IEEE
- Published
- 2007-07
- Pages
- 79-86
- OpenAlex
- W2099837838
- Cited by
- 298
- References
- 22
- FWCI
- 5.34
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.