Optimistic Erasure-Coded Distributed Storage
From MaRDI portal
Publication:3540229
Recommendations
- Space bounds for reliable storage: fundamental limits of coding
- A Layered Architecture for Erasure-Coded Consistent Distributed Storage
- Radon: repairable atomic data object in networks
- A coded shared atomic memory algorithm for message passing architectures
- scientific article; zbMATH DE number 1931818
Cites work
- scientific article; zbMATH DE number 996442 (Why is no real title available?)
- scientific article; zbMATH DE number 2013839 (Why is no real title available?)
- Byzantine disk paxos: optimal resilience with Byzantine shared memory
- On interprocess communication. I: Basic formalism
- Optimistic Erasure-Coded Distributed Storage
- Polynomial Codes Over Certain Finite Fields
- Reliable and total order broadcast in the crash-recovery model
- Sharing memory robustly in message-passing systems
- The collective memory of amnesic processes
- Verifying distributed erasure-coded data
Cited in
(10)- Sparsity exploiting erasure coding for distributed storage of versioned data
- scientific article; zbMATH DE number 1931818 (Why is no real title available?)
- Radon: repairable atomic data object in networks
- Fragmented objects: boosting concurrency of shared large objects
- A Layered Architecture for Erasure-Coded Consistent Distributed Storage
- Integrated bounds for disintegrated storage
- Optimistic Erasure-Coded Distributed Storage
- Brief Announcement: CausalEC: A Causally Consistent Data Storage Algorithm based on Cross-Object Erasure Coding
- Space bounds for reliable storage: fundamental limits of coding
- A coded shared atomic memory algorithm for message passing architectures
This page was built for publication: Optimistic Erasure-Coded Distributed Storage
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3540229)