Space Bounds for Reliable Storage
- Submitting institution
-
The University of Surrey
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 9027032_2
- Type
- E - Conference contribution
- DOI
-
10.1145/2933057.2933104
- Title of conference / published proceedings
- Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing - PODC '16
- First page
- 0
- Volume
- 0
- Issue
- 0
- ISSN
- -
- Open access status
- -
- Month of publication
- -
- Year of publication
- 2016
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
-
- Research group(s)
-
-
- Citation count
- 1
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- Erasure codes are widely used as a more efficient alternative to replication in reliable storage services. We study the inherent space requirements of the erasure coding-based storage algorithms in asynchronous fault-prone distributed systems. Our results demonstrate that, somewhat surprisingly, full replication is unavoidable in some scenarios thus highlighting fundamental limitations of the erasure coding techniques. This work has attracted significant interest in both the coding and distributed computing research communities with the world-leading experts, e.g., Meddard (MIT), Lynch (MIT) and Cadambe (Penn State), publishing follow-up studies in premier venues including ACM PODC'16 and '17, IEEE IPDPS'16, and IEEE ToC'20.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -