Space Complexity of Fault-Tolerant Register Emulations
- Submitting institution
-
Royal Holloway and Bedford New College
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 28992818
- Type
- E - Conference contribution
- DOI
-
10.1145/3087801.3087824
- Title of conference / published proceedings
- PODC '17 : Proceedings of the ACM Symposium on Principles of Distributed Computing
- First page
- 83
- Volume
- -
- Issue
- -
- ISSN
- -
- Open access status
- -
- Month of publication
- July
- Year of publication
- 2017
- 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
-
1
- Research group(s)
-
-
- Citation count
- 0
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This paper is the first to establish tight bounds on the space complexity of a replicated distributed storage constructed using read/write primitives. The results shed light on the inherent complexity tradeoffs exhibited by the existing cloud storage services as well as the choice of the underlying primitives being used by their implementations. The research has influenced joint work by Technion and VMWare, see Spiegelman et al (DISC'17) and Berger et al (DISC'18). ACM PODC is a premier distributed computing theory conference.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -