@inproceedings{87b9cfd613ec4ff294d47b2f1c72ea31,
title = "Integrated bounds for disintegrated storage",
abstract = "We point out a somewhat surprising similarity between non-authenticated Byzantine storage, coded storage, and certain emulations of shared registers from smaller ones. A common characteristic in all of these is the inability of reads to safely return a value obtained in a single atomic access to shared storage. We collectively refer to such systems as disintegrated storage, and show integrated space lower bounds for asynchronous regular wait-free emulations in all of them. In a nutshell, if readers are invisible, then the storage cost of such systems is inherently exponential in the size of written values; otherwise, it is at least linear in the number of readers. Our bounds are asymptotically tight to known algorithms, and thus justify their high costs.",
keywords = "Coding, Lower bounds, Register emulations, Space complexity, Storage",
author = "Alon Berger and Idit Keidar and Alexander Spiegelman",
note = "Publisher Copyright: {\textcopyright} Alon Berger, Idit Keidar, and Alexander Spiegelman.; 32nd International Symposium on Distributed Computing, DISC 2018 ; Conference date: 15-10-2018 Through 19-10-2018",
year = "2018",
month = oct,
day = "1",
doi = "https://doi.org/10.4230/LIPIcs.DISC.2018.11",
language = "الإنجليزيّة",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
editor = "Ulrich Schmid and Josef Widder",
booktitle = "32nd International Symposium on Distributed Computing, DISC 2018",
}