English
Related papers

Related papers: Partial-MDS Codes and their Application to RAID Ty…

200 papers

Partial MDS (PMDS) codes are erasure codes combining local (row) correction with global additional correction of entries, while Sector-Disk (SD) codes are erasure codes that address the mixed failure mode of current RAID systems. It has…

Information Theory · Computer Science 2014-01-21 Mario Blaum , James S. Plank , Moshe Schwartz , Eitan Yaakobi

A construction of Partial Maximum Distance Separable (PMDS) and Sector-Disk (SD) codes extending RAID 5 with two extra parities is given, solving an open problem. Previous constructions relied on computer searches, while our constructions…

Information Theory · Computer Science 2013-05-02 Mario Blaum

As storage systems grow in size, device failures happen more frequently than ever before. Given the commodity nature of hard drives employed, a storage system needs to tolerate a certain number of disk failures while maintaining data…

Information Theory · Computer Science 2014-05-20 Yan Wang , Xunrui Yin , Xin Wang

Partial MDS (PMDS) and sector-disk (SD) codes are classes of erasure correcting codes that combine locality with strong erasure correction capabilities. We construct PMDS and SD codes with local regeneration where each local code is a…

Information Theory · Computer Science 2021-06-14 Lukas Holzbaur , Sven Puchinger , Eitan Yaakobi , Antonia Wachter-Zeh

SD codes are erasure codes that address the mixed failure mode of current RAID systems. Rather than dedicate entire disks to erasure coding, as done in RAID-5, RAID-6 and Reed-Solomon coding, an SD code dedicates entire disks, plus…

Information Theory · Computer Science 2013-05-07 Mario Blaum , James S. Plank

Partial MDS (PMDS) and sector-disk (SD) codes are classes of erasure codes that combine locality with strong erasure correction capabilities. We construct PMDS and SD codes where each local code is a bandwidth-optimal regenerating MDS code.…

Information Theory · Computer Science 2020-05-11 Lukas Holzbaur , Sven Puchinger , Eitan Yaakobi , Antonia Wachter-Zeh

This work deals with partial MDS (PMDS) codes, a special class of locally repairable codes, used for distributed storage system. We first show that a known construction of these codes, using Gabidulin codes, can be extended to use any…

Information Theory · Computer Science 2018-01-19 Alessandro Neri , Anna-Lena Horlemann-Trautmann

Partial maximum distance separable (PMDS) codes are a kind of erasure codes where the nodes are divided into multiple groups with each forming an MDS code with a smaller code length, thus they allow repairing a failed node with only a few…

Information Theory · Computer Science 2022-11-15 Jie Li , Xiaohu Tang , Hanxu Hou , Yunghsiang S. Han , Bo Bai , Gong Zhang

Partial-MDS (PMDS) codes are a family of locally repairable codes, mainly used for distributed storage. They are defined to be able to correct any pattern of $s$ additional erasures, after a given number of erasures per locality group have…

Information Theory · Computer Science 2017-07-05 Anna-Lena Horlemann-Trautmann , Alessandro Neri

RAID proposal advocated replacing large disks with arrays of PC disks, but as the capacity of small disks increased 100-fold in 1990s the production of large disks was discontinued. Storage dependability is increased via replication or…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-01-09 Alexander Thomasian

MDS (maximum distance separable) array codes are widely used in storage systems due to their computationally efficient encoding and decoding procedures. An MDS code with r redundancy nodes can correct any r erasures by accessing (reading)…

Information Theory · Computer Science 2011-07-11 Zhiying Wang , Itzhak Tamo , Jehoshua Bruck

Maximum-distance-separable (MDS) codes are a class of erasure codes that are widely adopted to enhance the reliability of distributed storage systems (DSS). In (n, k) MDS coded DSS, the original data are stored into n distributed nodes in…

Information Theory · Computer Science 2017-06-16 Sheng Guan , Haibin Kan , Xin Wang

Storing digital information, ensuring the accuracy, steady and uninterrupted access to the data are considered as fundamental challenges in enterprise-class organizations and companies. In recent years, new types of storage systems such as…

Other Computer Science · Computer Science 2014-05-12 Arash Batni , Farshad Safaei

EVENODD+ codes are binary maximum distance separable (MDS) array codes for correcting double disk failures in RAID-6 with asymptotically optimal encoding/decoding/update complexities. However, the number of bits stored in each disk of…

Information Theory · Computer Science 2024-05-01 Panyu Zhu

This paper describes a non-homogeneous distributed storage systems (DSS), where there is one super node which has a larger storage size and higher reliability and availability than the other storage nodes. We propose three distributed…

Information Theory · Computer Science 2012-08-13 Vo Tam Van , Chau Yuen , Jing Li

Both maximum distance separable (MDS) codes that are not equivalent to generalized Reed-Solomon (GRS) codes (non-GRS MDS codes) and near MDS (NMDS) codes have nice applications in communication and storage systems. In this paper, we…

Information Theory · Computer Science 2025-01-28 Yang Li , Zhonghua Sun , Shixin Zhu

Maximum distance separable (MDS) array codes constitute an important class of error-correcting codes due to their optimal distance properties and their relevance in distributed storage systems. In this paper, we investigate the construction…

Distributed storage codes have important applications in the design of modern storage systems. In a distributed storage system, every storage node has a probability to fail and once an individual storage node fails, it must be reconstructed…

Information Theory · Computer Science 2016-10-27 Chong Shangguan , Gennian Ge

MDS array codes are widely used in storage systems to protect data against erasures. We address the \emph{rebuilding ratio} problem, namely, in the case of erasures, what is the the fraction of the remaining information that needs to be…

Information Theory · Computer Science 2011-03-22 Itzhak Tamo , Zhiying Wang , Jehoshua Bruck

This is a followup to the 1994 tutorial by Berkeley RAID researchers whose 1988 RAID paper foresaw a revolutionary change in storage industry based on advances in magnetic disk technology, i.e., replacement of large capacity expensive disks…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-10-28 Alexander Thomasian
‹ Prev 1 2 3 10 Next ›