Minimum density RAID-6 codes

Plank, James S.; Buchsbaum, Adam L.; Zanden, Bradley T. Vander

doi:10.1145/1970338.1970340

Cited by 15 publications

(7 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Also, Figure 6 compares the reliability of our in-memory approach with the one achieved by stable storage; the disk AFRs are according to [36]. We observe that for a group size of 7, DARE can achieve higher reliability than disks with RAID-5 [7], while 11 servers are sufficient to overpass the reliability of disks with RAID-6 [37].…”

Section: Fine-grained Failure Modelmentioning

confidence: 99%

Dare

Poke

Hoefler

2015

Proceedings of the 24th International Symposium on High-Performance Parallel and Distributed Computing

View full text Add to dashboard Cite

The increasing amount of data that needs to be collected and analyzed requires large-scale datacenter architectures that are naturally more susceptible to faults of single components. One way to offer consistent services on such unreliable systems are replicated state machines (RSMs). Yet, traditional RSM protocols cannot deliver the needed latency and request rates for future large-scale systems. In this paper, we propose a new set of protocols based on Remote Direct Memory Access (RDMA) primitives. To asses these mechanisms, we use a strongly consistent key-value store; the evaluation shows that our simple protocols improve RSM performance by more than an order of magnitude. Furthermore, we show that RDMA introduces various new options, such as log access management. Our protocols enable operators to fully utilize the new capabilities of the quickly growing number of RDMA-capable datacenter networks.

show abstract

Section: Fine-grained Failure Modelmentioning

confidence: 99%

Dare

Poke

Hoefler

2015

Proceedings of the 24th International Symposium on High-Performance Parallel and Distributed Computing

View full text Add to dashboard Cite

show abstract

“…In particular, data layouts are systematic array codes, in which the original data is stored in unencoded form somewhere in the disk array. Plank gives an overview of single-and multiple-fault-tolerant array codes [13], including EVENODD codes [5,6], Blaum-Roth codes [7], RDP codes [8,4], STAR codes [11], and Liberation codes [14].…”

Section: Data Layouts For Disk Arraysmentioning

confidence: 99%

“…For example, EVENODD, RDP and Liberation codes can tolerate up to two disk failures [5,8,14], and generalized EVENODD codes and STAR codes can tolerate up to three disk failures [6,11]. Even higher levels of fault tolerance are possible for Generalized RDP codes and Blaum-Roth codes in some cases [7,4].…”

Section: Kφ(v)mentioning

confidence: 99%

Optimizing large data transfers in parity-declustered data layouts

Schwabe

Sutherland²

2015

Journal of Computer and System Sciences

View full text Add to dashboard Cite

Disk arrays allow faster access to users' data by distributing the data among a collection of disks and allowing parallel access. Fault tolerance in a disk array can be achieved by using a data layout, and the technique of parity declustering allows faster failure recovery at the cost of additional space dedicated to redundant information. A collection of six performance conditions that parity-declustered data layouts should satisfy has guided most previous work; however two of these conditions (Maximal parallelism and Large write optimization) cannot be jointly satisfied in most cases. This limits the ability of parity-declustered data layouts to take full advantage of the available parallelism during large data transfers. We present data layouts that approximately satisfy these two conditions simultaneously for all possible array configurations, and bound the deviations from complete satisfaction. Our results yield improved performance guarantees for large data transfers in parity-declustered data layouts.

show abstract

“…The reason is that each C-Code instance always has a twin instance (see Theorem 4). In the previous section, we have obtained C-Codes for some sporadic even lengths listed as follows: 4, 6, 10, 12,14,16,18,20,22,24,26,28,30,32,34,36,38,50. Then, we may wonder if there exists an infinite family of C-Codes.…”

Section: Definitionmentioning

confidence: 99%

On cyclic lowest density MDS array codes constructed using starters

Shu

2010

2010 IEEE International Symposium on Information Theory

View full text Add to dashboard Cite

In this paper, we present a systematic study on cyclic lowest density MDS array codes constructed using starters. We first show that all cyclic lowest density MDS array codes of distance 3 and length 2n can be constructed using normalized cyclic bipyramidal starters in the additive group of congruence classes modulo 2n. We then discuss when and how to transform non-cyclic lowest density MDS array codes constructed using other starters (including even starters and patterned starters) to cyclic codes. Finally, we also discuss how to construct quasi-cyclic lowest density MDS array codes using multi-starters for an even length when no cyclic lowest density MDS array code exists for this even length.

show abstract

Minimum density RAID-6 codes

Cited by 15 publications

References 20 publications

Dare

Dare

Optimizing large data transfers in parity-declustered data layouts

On cyclic lowest density MDS array codes constructed using starters

Contact Info

Product

Resources

About