Row-Diagonal Parity for Double Disk Failure Correction (Awarded Best Paper!)

By P. Corbett, Robert English, A. Goel, Tomislav Grcanac, S. Kleiman, James Leong, Sunitha Sankar. USENIX Conference on File and Storage Technologies, 2004

390 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/128e92b3a4207322dd6bc12689209ccdfde573a4

How researchers see this paper

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

Citations in the corpus

Availability in Globally Distributed Storage Systems (2010, methodology): “As with [12], the distributed systems we study use prioritized recovery for stripes with more than one chunk unavailable.”
STAR : An Efficient Coding Scheme for Correcting Triple Storage Node Failures (2005, methodology): “Array codes have been studied extensively [17], [23], [8], [5], [7], [42], [43], [6], [15].”
Rethinking erasure codes for cloud file systems: minimizing I/O for recovery and degraded reads (2012, background): “We compare Rotated Reed-Solomon codes with P Drive recovery and with the best performing optimal recovery codes, Liber8tion for m = 2 and GenRDP for m = 3.”
An analysis of data corruption in the storage stack (2008, background): “This observation implies that (a) data scrubbing should be performed more aggressively, and (b) systems should consider protection against double disk failures [1, 4, 5, 9, 10, 12].”
Optimal linear codes with a local-error-correction property (2012, background): “(1) A class of codes constructed earlier and known as pyramid codes [2] are shown to be(r, d) codes that are optimal with respect to this bound.”