English
Related papers

Related papers: Optimizing Apportionment of Redundancies in Hierar…

200 papers

Distributed data storage systems are essential to deal with the need to store massive volumes of data. In order to make such a system fault-tolerant, some form of redundancy becomes crucial, incurring various overheads - most prominently in…

Distributed, Parallel, and Cluster Computing · Computer Science 2011-12-25 Frederique Oggier , Anwitaman Datta

Digital contents in large scale distributed storage systems may have different reliability and access delay requirements, and for this reason, erasure codes with different strengths need to be utilized to achieve the best storage…

Information Theory · Computer Science 2016-04-29 Chao Tian , Tie Liu

In large data centers, storage nodes are organized in racks, and the cross-rack transmission dominates the bandwidth cost. For the repair of single node failures, codes achieving the tradeoff between the storage redundancy and cross-rack…

Information Theory · Computer Science 2022-05-19 Liyang Zhou , Zhifang Zhang

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

Due to individual unreliable commodity components, failures are common in large-scale distributed storage systems. Erasure codes are widely deployed in practical storage systems to provide fault tolerance with low storage overhead. However,…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-04-15 Liangliang Xu , Min Lyu , Zhipeng Li , Yongkun Li , Yinlong Xu

Distributed storage systems provide reliable access to data through redundancy spread over individually unreliable nodes. Application scenarios include data centers, peer-to-peer storage systems, and storage in wireless networks. Storing…

Networking and Internet Architecture · Computer Science 2008-03-06 Alexandros G. Dimakis , P. Brighten Godfrey , Yunnan Wu , Martin J. Wainwright , Kannan Ramchandran

In an $(n,k,d)$ rack-aware storage model, the system consists of $n$ nodes uniformly distributed across $\bar{n}$ successive racks, such that each rack contains $u$ nodes of equal capacity and the reconstructive degree satisfies…

Information Theory · Computer Science 2025-11-25 Hengming Zhao , Dianhua Wu , Minquan Cheng

In this paper, we discuss codes for distributed storage systems with hierarchical repair properties. Specifically, we devote attention to the repair problem of the rack-aware storage model with locality, aiming to enhance the system's…

Information Theory · Computer Science 2024-01-30 Yumeng Yang , Han Cai , Xiaohu Tang

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

Distributed storage systems often introduce redundancy to increase reliability. When coding is used, the repair problem arises: if a node storing encoded information fails, in order to maintain the same level of reliability we need to…

Information Theory · Computer Science 2010-04-27 Alexandros G. Dimakis , Kannan Ramchandran , Yunnan Wu , Changho Suh

Blockchain is a distributed ledger with wide applications. Due to the increasing storage requirement for blockchains, the computation can be afforded by only a few miners. Sharding has been proposed to scale blockchains so that storage and…

Cryptography and Security · Computer Science 2020-11-13 Divija Swetha Gadiraju , V. Lalitha , Vaneet Aggarwal

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

When a node in a distributed storage system fails, it needs to be promptly repaired to maintain system integrity. While typical erasure codes can provide a significant storage advantage over replication, they suffer from poor repair…

Information Theory · Computer Science 2018-07-10 Geonu Kim , Jungwoo Lee

A family of codes with a natural two-dimensional structure is presented, inspired by an application of RAID type of architectures whose units are solid state drives (SSDs). Arrays of SSDs behave differently to arrays of hard disk drives…

Information Theory · Computer Science 2014-09-12 Mario Blaum , James Lee Hafner , Steven Hetzler

The issue of repairing Reed-Solomon codes currently employed in industry has been sporadically discussed in the literature. In this work we carry out a systematic study of these codes and investigate important aspects of repairing them…

Information Theory · Computer Science 2022-05-24 Thi Xinh Dinh , Luu Y Nhi Nguyen , Lakshmi J. Mohan , Serdar Boztas , Tran Thi Luong , Son Hoang Dau

The exponential growth of data necessitates distributed storage models, such as peer-to-peer systems and data federations. While distributed storage can reduce costs and increase reliability, the heterogeneity in storage capacity, I/O…

The traditional definition of Integrated Interleaved (II) codes generally assumes that the component nested codes are either Reed-Solomon (RS) or shortened Reed-Solomon codes. By taking general classes of codes, we present a recursive…

Information Theory · Computer Science 2020-10-01 Mario Blaum

Solid-State Drives (SSDs) have significant performance advantages over traditional Hard Disk Drives (HDDs) such as lower latency and higher throughput. Significantly higher price per capacity and limited lifetime, however, prevents…

Hardware Architecture · Computer Science 2021-11-08 Shahriar Ebrahimi , Reza Salkhordeh , Seyed Ali Osia , Ali Taheri , Hamid Reza Rabiee , Hossein Asadi

Verification is a key bottleneck in improving inference speed while maintaining distribution fidelity in Speculative Decoding. Recent work has shown that sequence-level verification leads to a higher number of accepted tokens compared to…

Artificial Intelligence · Computer Science 2026-03-03 Yuxuan Zhou , Fei Huang , Heng Li , Fengyi Wu , Tianyu Wang , Jianwei Zhang , Junyang Lin , Zhi-Qi Cheng

In distributed storage systems built using commodity hardware, it is necessary to have data redundancy in order to ensure system reliability. In such systems, it is also often desirable to be able to quickly repair storage nodes that fail.…

Information Theory · Computer Science 2012-01-24 Joseph C. Koo , John Gill