English
Related papers

Related papers: Optimizing Apportionment of Redundancies in Hierar…

200 papers

A novel technique for construction of minimum storage regenerating (MSR) codes is presented. Based on this technique, three explicit constructions of MSR codes are given. The first two constructions provide access-optimal MSR codes, with…

Information Theory · Computer Science 2016-01-29 Netanel Raviv , Natalia Silberstein , Tuvi Etzion

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

Runtime variability in computing systems causes some tasks to straggle and take much longer than expected to complete. These straggler tasks are known to significantly slowdown distributed computation. Job execution with speculative…

Performance · Computer Science 2019-06-14 Mehmet Fatih Aktas , Emina Soljanin

We study the inherent space requirements of shared storage algorithms in asynchronous fault-prone systems. Previous works use codes to achieve a better storage cost than the well-known replication approach. However, a closer look reveals…

Distributed, Parallel, and Cluster Computing · Computer Science 2015-07-21 Alexander Spiegelman , Yuval Cassuto , Gregory Chockler , Idit Keidar

Reed-Solomon codes have found many applications in practical storage systems, but were until recently considered unsuitable for distributed storage applications due to the widely-held belief that they have poor repair bandwidth. The work of…

Information Theory · Computer Science 2017-05-16 Hoang Dau , Olgica Milenkovic

We consider the design of regenerating codes for distributed storage systems at the minimum bandwidth regeneration (MBR) point. The codes allow for a repair process that is exact and uncoded, but table-based. These codes were introduced in…

Information Theory · Computer Science 2012-11-19 Oktay Olmez , Aditya Ramamoorthy

In order to provide high data reliability, distributed storage systems disperse data with redundancy to multiple storage nodes. Regenerating codes is a new class of erasure codes to introduce redundancy for the purpose of improving the data…

Information Theory · Computer Science 2015-03-18 Kenneth W. Shum , Yuchong Hu

Practical storage systems often adopt erasure codes to tolerate device failures and sector failures, both of which are prevalent in the field. However, traditional erasure codes employ device-level redundancy to protect against sector…

Information Theory · Computer Science 2014-06-24 Mingqiang Li , Patrick P. C. Lee

Several self-supervised learning (SSL) approaches have shown that redundancy reduction in the feature embedding space is an effective tool for representation learning. However, these methods consider a narrow notion of redundancy, focusing…

Machine Learning · Computer Science 2024-12-10 David Zollikofer , Béni Egressy , Frederik Benzing , Matthias Otth , Roger Wattenhofer

Single Event Upsets (SEU) as well as permanent faults can significantly affect the correct on-line operation of digital systems, such as memories and microprocessors; a memory can be made resilient to permanent and transient faults by using…

Information Theory · Computer Science 2011-11-09 L. Schiano , M. Ottavi , F. Lombardi , S. Pontarelli , A. Salsano

Stopping sets play a crucial role in failure events of iterative decoders over a binary erasure channel (BEC). The $\ell$-th stopping redundancy is the minimum number of rows in the parity-check matrix of a code, which contains no stopping…

Information Theory · Computer Science 2018-10-02 Yauhen Yakimenka , Vitaly Skachek , Irina E. Bocharova , Boris D. Kudryashov

Distributed storage infrastructures require the use of data redundancy to achieve high data reliability. Unfortunately, the use of redundancy introduces storage and communication overheads, which can either reduce the overall storage…

Distributed, Parallel, and Cluster Computing · Computer Science 2015-03-19 Lluis Pamies-Juarez , Ernst Biersack

Large-scale classification of data where classes are structurally organized in a hierarchy is an important area of research. Top-down approaches that exploit the hierarchy during the learning and prediction phase are efficient for large…

Machine Learning · Computer Science 2017-06-06 Azad Naik , Huzefa Rangwala

Spinal codes is a new family of capacity-achieving rateless codes that has been shown to achieve better rate performance compared to Raptor codes, Strider codes, and rateless Low-Density Parity-Check (LDPC) codes. This correspondence…

Information Theory · Computer Science 2025-10-14 Aimin Li , Shaohua Wu , Xiaomeng Chen , Sumei Sun

Space Cyber-Physical Systems (S-CPS) such as spacecraft and satellites strongly rely on the reliability of onboard computers to guarantee the success of their missions. Relying solely on radiation-hardened technologies is extremely…

Systems and Control · Electrical Eng. & Systems 2024-01-12 Michael Rogenmoser , Yvan Tortorella , Davide Rossi , Francesco Conti , Luca Benini

Motivated by customer loyalty plans and scholarship programs, we study tie-breaker designs which are hybrids of randomized controlled trials (RCTs) and regression discontinuity designs (RDDs). We quantify the statistical efficiency of a…

Methodology · Statistics 2020-08-03 Art B. Owen , Hal Varian

In distributed storage systems, locally repairable codes (LRCs) are introduced to realize low disk I/O and repair cost. In order to tolerate multiple node failures, the LRCs with \emph{$(r, \delta)$-locality} are further proposed. Since hot…

Information Theory · Computer Science 2017-05-03 Bin Chen , Shu-Tao Xia , Jie Hao

The quality of industrial components is critical to the production of special equipment such as robots. Defect inspection of these components is an efficient way to ensure quality. In this paper, we propose a hybrid network, SSD-Faster Net,…

Computer Vision and Pattern Recognition · Computer Science 2022-07-05 Jingyao Wang , Naigong Yu

Locally repairable codes (LRCs) have recently been widely used in distributed storage systems and the LRCs with $(r,\delta)$-locality ($(r,\delta)$-LRCs) attracted a lot of interest for tolerating multiple erasures. Ge et al. constructed…

Information Theory · Computer Science 2023-04-28 Yaxin Wang , Siman Yang

The rack-aware storage model improves repair efficiency by exploiting locality within racks to minimize cross-rack traffic in a distributed storage system. While the partially cooperative repair model presents a solution for multiple node…

Information Theory · Computer Science 2025-09-30 Hengming Zhao , Dianhua Wu , Minquan Cheng