Integrated bounds for disintegrated storage

Alon Berger, Idit Keidar, Alexander Spiegelman

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publication32nd International Symposium on Distributed Computing, DISC 2018
EditorsUlrich Schmid, Josef Widder
ISBN (Electronic)9783959770927
DOIs
StatePublished - 1 Oct 2018
Event32nd International Symposium on Distributed Computing, DISC 2018 - New Orleans, United States
Duration: 15 Oct 201819 Oct 2018

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume121

Conference

Conference32nd International Symposium on Distributed Computing, DISC 2018
Country/TerritoryUnited States
CityNew Orleans
Period15/10/1819/10/18

Keywords

  • Coding
  • Lower bounds
  • Register emulations
  • Space complexity
  • Storage

All Science Journal Classification (ASJC) codes

  • Software

Fingerprint

Dive into the research topics of 'Integrated bounds for disintegrated storage'. Together they form a unique fingerprint.

Cite this