Integrated bounds for disintegrated storage

DOI10.4230/LIPICS.DISC.2018.11MaRDI QIDQ5090901zbMATH OpenFDO

Authors Alon Berger, Idit Keidar, Alexander Spiegelman

Publication date 21 July 2022

Full work available at URL https://arxiv.org/abs/1805.06265

zbMATH Keywords

lower boundsspace complexitystoragecodingregister emulations

Mathematics Subject Classification ID

Distributed systems (68M14)

Recommendations

• Information-theoretic lower bounds on the storage cost of shared memory emulation
• Bounded Wait-Free Implementation of Optimally Resilient Byzantine Storage Without (Unproven) Cryptographic Assumptions
• Bounded wait-free implementation of optimally resilient byzantine storage without (unproven) cryptographic assumptions
• Space bounds for reliable storage: fundamental limits of coding
• Remote storage with Byzantine servers

Cites work

• scientific article; zbMATH DE number 2013839 (Why is no real title available?)
• Amnesic Distributed Storage
• Byzantine disk paxos: optimal resilience with Byzantine shared memory
• Concurrent Reading While Writing
• Fault-tolerant wait-free shared objects
• Information-theoretic lower bounds on the storage cost of shared memory emulation
• On interprocess communication. II: Algorithms
• One-write algorithms for multivalued regular and atomic registers
• Optimistic Erasure-Coded Distributed Storage
• Sharing memory robustly in message-passing systems
• Space Complexity of Fault-Tolerant Register Emulations
• Space bounds for reliable storage: fundamental limits of coding
• Step optimal implementations of large single-writer registers
• Wait-free regular storage from Byzantine components

Cited in

(3)

• Space bounds for reliable storage: fundamental limits of coding
• Information-theoretic lower bounds on the storage cost of shared memory emulation
• Amnesic Distributed Storage

This page was built for publication: Integrated bounds for disintegrated storage

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090901)