English
Related papers

Related papers: Deterministic Data Distribution for Efficient Reco…

200 papers

In this paper, we investigate the optimum way to allocate redundancy of finite-length nested codes for modern nonvolatile memories suffering from both permanent defects and transient errors (erasures or random errors). A nested coding…

Information Theory · Computer Science 2018-10-30 Yongjune Kim , B. V. K. Vijaya Kumar

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

Erasure codes provide a storage efficient alternative to replication based redundancy in (networked) storage systems. They however entail high communication overhead for maintenance, when some of the encoded fragments are lost and need to…

Distributed, Parallel, and Cluster Computing · Computer Science 2010-11-24 Frederique Oggier , Anwitaman Datta

In a modern distributed storage system, storage nodes are organized in racks, and the cross-rack communication dominates the system bandwidth. In We study the rack-aware storage system where all storage nodes are organized in racks and…

Information Theory · Computer Science 2022-07-18 Liyang Zhou , Zhifang Zhang

Distributed storage systems suffer from significant repair traffic generated due to frequent storage node failures. This paper shows that properly designed low-density parity-check (LDPC) codes can substantially reduce the amount of…

Distributed, Parallel, and Cluster Computing · Computer Science 2017-10-17 Hyegyeong Park , Dongwon Lee , Jaekyun Moon

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

In distributed storage systems that employ erasure coding, the issue of minimizing the total {\it repair bandwidth} required to exactly regenerate a storage node after a failure arises. This repair bandwidth depends on the structure of the…

Information Theory · Computer Science 2011-06-10 Dimitris S. Papailiopoulos , Alexandros G. Dimakis

The majority of works in distributed storage networks assume a simple network model with a collection of identical storage nodes with the same communication cost between the nodes. In this paper, we consider a realistic multi-rack…

Information Theory · Computer Science 2019-03-11 Ali Tebbi , Terence H. Chan , Chi Wan Sung

The robustness of fault detection algorithms against uncertainty is crucial in the real-world industrial environment. Recently, a new probabilistic design scheme called distributionally robust fault detection (DRFD) has emerged and received…

Optimization and Control · Mathematics 2026-01-16 Yulin Feng , Hailang Jin , Steven X. Ding , Hao Ye , Chao Shang

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 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 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

We examine the problem of allocating a given total storage budget in a distributed storage system for maximum reliability. A source has a single data object that is to be coded and stored over a set of storage nodes; it is allowed to store…

Information Theory · Computer Science 2016-11-15 Derek Leong , Alexandros G. Dimakis , Tracey Ho

Peer-to-peer distributed storage systems provide reliable access to data through redundancy spread over nodes across the Internet. A key goal is to minimize the amount of bandwidth used to maintain that redundancy. Storing a file using an…

Information Theory · Computer Science 2007-07-13 Alexandros G. Dimakis , P. Brighten Godfrey , Martin J. Wainwright , Kannan Ramchandran

This paper studies the fundamental problem of data persistency for a general family of redundancy schemes in distributed storage systems, called replicated erasure codes. Namely, we analyze two strategies of replicated erasure codes…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-07-28 Roy Friedman , Rafał Kapelko , Karol Marchwicki

Erasure coding techniques are used to increase the reliability of distributed storage systems while minimizing storage overhead. Also of interest is minimization of the bandwidth required to repair the system following a node failure. In a…

Information Theory · Computer Science 2009-10-06 K. V. Rashmi , Nihar B. Shah , P. Vijay Kumar , Kannan Ramchandran

Spreading and storing erasure-coded data in distributed systems effectively is challenging in real settings. Practical deployments must contend with unpredictable network latencies, particularly when information dispersal is integrated into…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-03-27 Rithwik Kerur , Divyakant Agrawal , Michael K. Reiter , Dahlia Malkhi

The increasing interest in serverless computation and ubiquitous wireless networks has led to numerous connected devices in our surroundings. Among such devices, IoT devices have access to an abundance of raw data, but their inadequate…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-04-12 Ramyad Hadidi , Jiashen Cao , Hyesoon Kim

Distributed storage systems support failures of individual devices by the use of replication or erasure correcting codes. While erasure correcting codes offer a better storage efficiency than replication for similar fault tolerance, they…

Distributed, Parallel, and Cluster Computing · Computer Science 2014-12-10 Nicolas Le Scouarnec

Deep neural networks (DNNs) sustain high performance in today's data processing applications. DNN inference is resource-intensive thus is difficult to fit into a mobile device. An alternative is to offload the DNN inference to a cloud…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-01-18 Beibei Zhang , Tian Xiang , Hongxuan Zhang , Te Li , Shiqiang Zhu , Jianjun Gu