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

By Cheng Huang, Minghua Chen, Jin Li. IEEE International Symposium on Network Computing and Applications, 2007

487 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/7b33d4fe4909d758f9f3647c954a8c58a80fdc4c

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

In Computer Networks and Communications

Citations in the corpus

Optimal linear codes with a local-error-correction property (2012, background): “Multiple node failures are not uncommon in distributed data storage, and a number of coding schemes for tolerating such multiple node failures exist in practice [2][3][4].”
Locally Repairable Codes (2012, background): “Codes with small locality were initially introduced in [16,17].”
Rethinking erasure codes for cloud file systems: minimizing I/O for recovery and degraded reads (2012, background): “However, some codes with decreased storage efficiency have much lower recovery costs than MDS [27, 18, 28, 23, 19].”
Locality and Availability in Distributed Storage (2014, methodology): “Note that Construction I differs from the original Pyramid codes [9], as the non-overlapping support requirement on the local parities is not present in [9].”
Erasure Coding in Windows Azure Storage (2012, methodology): “However, the real challenge is to construct a single set of coding equations that achieves the Maximally Recoverable (MR) property [14], or being able to decode all the information-theoretically decodable failure patterns – t he exact goal of LRC.”
Private information retrieval in distributed storage systems using an arbitrary linear code (2016, background): “The codeC1 in the table is from Example 1, C2 is an (11, 6) binary linear code with optimum minimum distance, while codes C3 and C5 are Pyramid codes, taken from [11], of locality of 4 and 6, respectively.”
A Family of Optimal Locally Recoverable Codes (2013, background): “Codes that have good locality properties were initially studied in [10], [11], although the second of these papers considered a slightly different deﬁnition of locality, under which a code is said to have information locality r if the value of any of its information symbols can be recovered by…”
A Performance Evaluation and Examination of Open-Source Erasure Coding Libraries for Storage (2009, background): “And of equal importance, major technology corporations such as Hewlett Packard [34], IBM [12, 13] and Microsoft [ 15 , 16] are performing active research on erasure codes for storage systems.”
Network Coding for Distributed Storage Systems (2007, background): “Many aspects of coding were explored [7], [26]–[28] for networked storage applications.”