A case for redundant arrays of inexpensive disks (RAID)
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Efficient dispersal of information for security, load balancing, and fault tolerance
Journal of the ACM (JACM)
A tutorial on Reed-Solomon coding for fault-tolerance in RAID-like systems
Software—Practice & Experience
LH*RS: a high-availability scalable distributed data structure using Reed Solomon Codes
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Erasure Coding Vs. Replication: A Quantitative Comparison
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
LH*RS---a highly-available scalable distributed data structure
ACM Transactions on Database Systems (TODS)
Efficient Updates in Highly Available Distributed Random Access Memory
ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
LH*RSP2P: a scalable distributed data structure for P2P environment
NOTERE '08 Proceedings of the 8th international conference on New technologies in distributed systems
HDDBrs middleware for implementing highly available distributed databases
Proceedings of the 18th ACM conference on Information and knowledge management
Maintaining and checking parity in highly available Scalable Distributed Data Structures
Journal of Systems and Software
DBISP2P'05/06 Proceedings of the 2005/2006 international conference on Databases, information systems, and peer-to-peer computing
| Hi-index | 0.01 |
The ideal storage system is always available and incrementally expandable. Existing storage systems fall far from this ideal. Affordable computers and high-speed networks allow us to investigate storage architectures closer to the ideal. Our demo, present a prototype implementation of LH*RS: a highly available scalable and distributed data structure.