DdlRT: A deterministic data layout for efficient redundancy transitioning in erasure-coded systems
Open Access
- 27 September 2026
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 584-594
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- ElasticEC: Achieving Fast and Elastic Redundancy Transitioning in Erasure-Coded ClustersIEEE Transactions on Computers, 2025
- Achieving Tunable Erasure Coding with Cluster-Aware Redundancy TransitioningACM Transactions on Architecture and Code Optimization, 2024
- StripeMerge: Efficient Wide-Stripe Generation for Large-Scale Erasure-Coded Storage2021
- Enabling I/O-Efficient Redundancy Transitioning in Erasure-Coded KV Stores via Elastic Reed-Solomon Codes2020
- Fast and strongly-consistent per-item resilience in key-value stores2018
- The Hadoop Distributed File System2010
- Combinatorial designsACM SIGACT News, 2008
- Note: Correction to the 1997 tutorial on Reed-Solomon codingSoftware: Practice and Experience, 2005
- Systematic MDS Erasure Codes Based on Vandermonde MatricesIEEE Communications Letters, 2004
- The AETG system: an approach to testing based on combinatorial designIEEE Transactions on Software Engineering, 1997