Optimistic Erasure-Coded Distributed Storage
From MaRDI portal
Publication:3540229
DOI10.1007/978-3-540-87779-0_13zbMath1161.68334OpenAlexW1946439947MaRDI QIDQ3540229
Ron Levy, Partha Sharathi Dutta, Rachid Guerraoui
Publication date: 20 November 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-87779-0_13
Related Items (5)
Brief Announcement: CausalEC: A Causally Consistent Data Storage Algorithm based on Cross-Object Erasure Coding ⋮ Optimistic Erasure-Coded Distributed Storage ⋮ A coded shared atomic memory algorithm for message passing architectures ⋮ Unnamed Item ⋮ Fragmented objects: boosting concurrency of shared large objects
Cites Work
- Unnamed Item
- Unnamed Item
- On interprocess communication. I: Basic formalism
- Byzantine disk paxos: optimal resilience with Byzantine shared memory
- Reliable and total order broadcast in the crash-recovery model
- Polynomial Codes Over Certain Finite Fields
- Optimistic Erasure-Coded Distributed Storage
- Sharing memory robustly in message-passing systems
- The collective memory of amnesic processes
- Verifying distributed erasure-coded data
This page was built for publication: Optimistic Erasure-Coded Distributed Storage