Efficient Updates in Highly Available Distributed Random Access Memory
ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
Failure-aware checkpointing in fine-grained cycle sharing systems
Proceedings of the 16th international symposium on High performance distributed computing
Verifying distributed erasure-coded data
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
RobuSTore: a distributed storage architecture with robust and high performance
Proceedings of the 2007 ACM/IEEE conference on Supercomputing
Optimistic Erasure-Coded Distributed Storage
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
GRID codes: Strip-based erasure codes with high fault tolerance for storage systems
ACM Transactions on Storage (TOS)
FALCON: a system for reliable checkpoint recovery in shared grid environments
Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis
Maintaining and checking parity in highly available Scalable Distributed Data Structures
Journal of Systems and Software
Energy-efficient fault-tolerant data storage & processing in dynamic networks
Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing
Exploiting Redundancies and Deferred Writes to Conserve Energy in Erasure-Coded Storage Clusters
ACM Transactions on Storage (TOS)
Trevi: watering down storage hotspots with cool fountain codes
Proceedings of the Twelfth ACM Workshop on Hot Topics in Networks
FAST'14 Proceedings of the 12th USENIX conference on File and Storage Technologies
| Hi-index | 0.01 |
Erasure codes provide space-optimal data redundancy to protect against data loss. A common use is to reliably store data in a distributed system, where erasure-coded data are kept in different nodes to tolerate node failures without losing data. In this paper, we propose a new approach to maintain ensure-encoded data in a distributed system. The approach allows the use of space efficientk-of-n erasure codes where n and k are large and the overhead n-k is small. Concurrent updates and accesses to data are highly optimized: in common cases, they require no locks, no two-phase commits, and no logs of old versions of data. We evaluate our approach using an implementation and simulations for larger systems.