English
Related papers

Related papers: A Modeling Framework for Reliability of Erasure Co…

200 papers

Maximum distance separable (MDS) codes are optimal error-correcting codes in the sense that they provide the maximum failure-tolerance for a given number of parity nodes. Suppose that an MDS code with $k$ information nodes and $r=n-k$…

Information Theory · Computer Science 2016-04-11 Min Ye , Alexander Barg

Fault tolerance is increasingly being use to design Dependable Digital Systems (DDS), which refers to the capability of a system to keep performing its intended functions in existence of faults. DDS are typically used in Safety-critical…

Hardware Architecture · Computer Science 2021-04-20 Farah Natiq Kassab bashi , Shawkat S Khairullah

The emergence of Deep Neural Networks (DNNs) in mission- and safety-critical applications brings their reliability to the front. High performance demands of DNNs require the use of specialized hardware accelerators. Systolic array…

Hardware Architecture · Computer Science 2025-11-05 Natalia Cherezova , Artur Jutman , Maksim Jenihhin

Log-Structured Merge trees (LSM trees) are increasingly used as the storage engines behind several data systems, frequently deployed in the cloud. Similar to other database architectures, LSM trees take into account information about the…

Databases · Computer Science 2021-11-04 Andy Huynh , Harshal A. Chaudhari , Evimaria Terzi , Manos Athanassoulis

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

In this paper we study array-based codes over graphs for correcting multiple node failures. These codes have applications to neural networks, associative memories, and distributed storage systems. We assume that the information is stored on…

Information Theory · Computer Science 2018-12-24 Lev Yohananov , Yuval Efron , Eitan Yaakobi

This paper introduces several techniques that improve the scalability of the deductive verification of data-level programs working on arrays and matrices. First of all, we introduce a technique to rewrite expressions with (nested)…

Software Engineering · Computer Science 2026-05-14 Lars B. van den Haak , Anton Wijs , Marieke Huisman

Streaming codes are a class of packet-level erasure codes that are designed with the goal of ensuring recovery in low-latency fashion, of erased packets over a communication network. It is well-known in the streaming code literature, that…

Information Theory · Computer Science 2021-09-08 Vinayak Ramkumar , Myna Vajha , P. Vijay Kumar

This paper aims to go beyond resilience into the study of security and local-repairability for distributed storage systems (DSS). Security and local-repairability are both important as features of an efficient storage system, and this paper…

Information Theory · Computer Science 2016-11-17 Ankit Singh Rawat , O. Ozan Koyluoglu , Natalia Silberstein , Sriram Vishwanath

DNA is emerging as an increasingly attractive medium for data storage due to a number of important and unique advantages it offers, most notably the unprecedented durability and density. While the technology is evolving rapidly, the…

Emerging Technologies · Computer Science 2022-05-03 Dehui Lin , Yasamin Tabatabaee , Yash Pote , Djordje Jevdjic

As the size of data storing arrays of disks grows, it becomes vital to protect data against double disk failures. A popular method of protection is via the Reed-Solomon (RS) code with two parity words. In the present paper we construct…

Information Theory · Computer Science 2010-03-30 R. Jackson , D. Rumynin , O. Zaboronski

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

Compared to replication-based storage systems, erasure-coded storage incurs significantly higher overhead during data updates. To address this issue, various parity logging methods have been pro- posed. Nevertheless, due to the long update…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-04-25 Zheng Wei , Jing Xing , Yida Gu , Wenjing Huang , Dong Dai , Guangming Tan , Dingwen Tao

Regenerating codes enable trading off repair bandwidth for storage in distributed storage systems (DSS). Due to their distributed nature, these systems are intrinsically susceptible to attacks, and they may also be subject to multiple…

Information Theory · Computer Science 2014-07-10 O. Ozan Koyluoglu , Ankit Singh Rawat , Sriram Vishwanath

Data-driven fault detection has been regarded as a 3D image segmentation task. The models trained from synthetic data are difficult to generalize in some surveys. Recently, training 3D fault segmentation using sparse manual 2D slices is…

Computer Vision and Pattern Recognition · Computer Science 2024-10-28 Yimin Dou , Kewen Li , Jianbing Zhu , Timing Li , Shaoquan Tan , Zongchao Huang

This paper summarizes our work on experimentally characterizing, mitigating, and recovering read disturb errors in multi-level cell (MLC) NAND flash memory, which was published in DSN 2015, and examines the work's significance and future…

Hardware Architecture · Computer Science 2018-05-10 Yu Cai , Yixin Luo , Saugata Ghose , Erich F. Haratsch , Ken Mai , Onur Mutlu

This work investigates a new erase scheme in NAND flash memory to improve the lifetime and performance of modern solid-state drives (SSDs). In NAND flash memory, an erase operation applies a high voltage (e.g., > 20 V) to flash cells for a…

Hardware Architecture · Computer Science 2024-04-17 Sungjun Cho , Beomjun Kim , Hyunuk Cho , Gyeongseob Seo , Onur Mutlu , Myungsuk Kim , Jisung Park

Erasure correcting codes are widely used to ensure data persistence in distributed storage systems. This paper addresses the simultaneous repair of multiple failures in such codes. We go beyond existing work (i.e., regenerating codes by…

Information Theory · Computer Science 2013-09-18 Anne-Marie Kermarrec , Gilles Straub , Nicolas Le Scouarnec

Raw bit errors are common in NAND flash memory and will increase in the future. These errors reduce flash reliability and limit the lifetime of a flash memory device. We aim to improve flash reliability with a multitude of low-cost…

Hardware Architecture · Computer Science 2018-08-16 Yixin Luo

The rise of transient faults in modern hardware requires system designers to consider errors occurring at runtime. Both hardware- and software-based error handling must be deployed to meet application reliability requirements. The level of…

Distributed, Parallel, and Cluster Computing · Computer Science 2016-08-23 Björn Bönninghoff , Horst Schirmeier