English
Related papers

Related papers: Convertible Codes: Efficient Conversion of Coded D…

200 papers

The increase in data storage and power consumption at data-centers has made it imperative to design energy efficient Distributed Storage Systems (DSS). The energy efficiency of DSS is strongly influenced not only by the volume of data,…

Distributed, Parallel, and Cluster Computing · Computer Science 2015-05-25 Akshay Kumar , Ravi Tandon , T. Charles Clancy

In order to scale economically, data centers are increasingly evolving their data storage methods from the use of simple data replication to the use of more powerful erasure codes, which provide the same level of reliability as replication…

Information Theory · Computer Science 2013-11-12 Nihar B. Shah , Kangwook Lee , Kannan Ramchandran

In distributed storage systems that use coding, the issue of minimizing the communication required to rebuild a storage node after a failure arises. We consider the problem of repairing an erased node in a distributed storage system that…

Information Theory · Computer Science 2010-09-20 Zhiying Wang , Alexandros G. Dimakis , Jehoshua Bruck

Erasure coding is a storage-efficient alternative to replication for achieving reliable data backup in distributed storage systems. During the storage process, traditional erasure codes require a unique source node to create and upload all…

Distributed, Parallel, and Cluster Computing · Computer Science 2015-03-19 Lluis Pamies-Juarez , Anwitaman Datta , Frédérique Oggier

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

Erasure codes are an integral part of many distributed storage systems aimed at Big Data, since they provide high fault-tolerance for low overheads. However, traditional erasure codes are inefficient on reading stored data in degraded…

Distributed, Parallel, and Cluster Computing · Computer Science 2013-06-27 Kyumars Sheykh Esmaili , Lluis Pamies-Juarez , Anwitaman Datta

The distributed data storage systems are constructed by large number of nodes which are interconnected over a network. Each node in such peer-to-peer network is vulnerable and at a potential risk for attack. The attackers can eavesdrop the…

Information Theory · Computer Science 2016-02-08 Ninoslav Marina , Aneta Velkoska , Natasa Paunkoska

Scientific computing workflows generate enormous distributed data that is short-lived, yet critical for job completion time. This class of data is called intermediate data. A common way to achieve high data availability is to replicate…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-04-14 Zhe Zhang , Brian Bockelman , Derek Weitzel , David Swanson

Data storage systems are more reliable than their individual components. In order to build highly reliable systems out of less reliable parts, systems introduce redundancy. In replicated systems, objects are simply copied several times with…

Information Theory · Computer Science 2013-08-13 John Cook , Robert Primmer , Ab de Kwant

Modern distributed storage systems apply redundancy coding techniques to stored data. One form of redundancy is based on regenerating codes, which can minimize the repair bandwidth, i.e., the amount of data transferred when repairing a…

Information Theory · Computer Science 2013-01-23 Yuchong Hu , Patrick P. C. Lee , Kenneth W. Shum

This chapter deals with the topic of designing reliable and efficient codes for the storage and retrieval of large quantities of data over storage devices that are prone to failure. For long, the traditional objective has been one of…

Information Theory · Computer Science 2020-10-06 Vinayak Ramkumar , Myna Vajha , S. B. Balaji , M. Nikhil Krishnan , Birenjith Sasidharan , P. Vijay Kumar

Regenerating codes are a class of codes proposed for providing reliability of data and efficient repair of failed nodes in distributed storage systems. In this paper, we address the fundamental problem of handling errors and erasures during…

Information Theory · Computer Science 2015-03-20 K. V. Rashmi , Nihar B. Shah , Kannan Ramchandran , P. Vijay Kumar

In cloud computing, storage area networks, remote backup storage, and similar settings, stored data is modified with updates from new versions. Representing information and modifying the representation are both expensive. Therefore it is…

Information Theory · Computer Science 2011-05-11 Lav R. Varshney , Julius Kusuma , Vivek K Goyal

This paper presents flexible storage codes, a class of error-correcting codes that can recover information from a flexible number of storage nodes. As a result, one can make a better use of the available storage nodes in the presence of…

Information Theory · Computer Science 2021-06-23 Weiqi Li , Zhiying Wang , Taiting Lu , Hamid Jafarkhani

In this paper, we consider the convertible codes with the maximum distance separable (MDS) property, which can adjust the code rate according to the failure rates of devices. We first extend the notion of convertible codes to allow initial…

Information Theory · Computer Science 2024-07-22 Songping Ge , Han Cai , Xiaohu Tang

Encoding data as a set of unordered strings is receiving great attention as it captures one of the basic features of DNA storage systems. However, the challenge of constructing optimal redundancy codes for this channel remained elusive. In…

Information Theory · Computer Science 2023-08-16 Jin Sima , Netanel Raviv , Jehoshua Bruck

Training a machine learning model is both compute and data-intensive. Most of the model training is performed on high performance compute nodes and the training data is stored near these nodes for faster training. But there is a growing…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-10-24 Zhifeng Lin , Krishna Giri Narra , Mingchao Yu , Salman Avestimehr , Murali Annavaram

Erasure codes are an efficient means of storing data across a network in comparison to data replication, as they tend to reduce the amount of data stored in the network and offer increased resilience in the presence of node failures. The…

Information Theory · Computer Science 2016-11-17 K. V. Rashmi , Nihar B. Shah , P. Vijay Kumar

For high-rate maximum distance separable (MDS) codes, most of them are designed to optimally repair a single failed node by connecting all the surviving nodes. However, in practical systems, sometimes not all the surviving nodes are…

Information Theory · Computer Science 2021-07-22 Yi Liu , Jie Li , Xiaohu Tang

Data centres that use consumer-grade disks drives and distributed peer-to-peer systems are unreliable environments to archive data without enough redundancy. Most redundancy schemes are not completely effective for providing high…

Distributed, Parallel, and Cluster Computing · Computer Science 2018-10-09 Vero Estrada-Galiñanes , Ethan Miller , Pascal Felber , Jehan-François Pâris