Efficient dispersal of information for security, load balancing, and fault tolerance
Journal of the ACM (JACM)
RAID: high-performance, reliable secondary storage
ACM Computing Surveys (CSUR)
LH*—a scalable, distributed data structure
ACM Transactions on Database Systems (TODS)
OceanStore: an architecture for global-scale persistent storage
ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
Myriad: Cost-Effective Disaster Tolerance
FAST '02 Proceedings of the Conference on File and Storage Technologies
Distributed RAID - A New Multiple Copy Algorithm
Proceedings of the Sixth International Conference on Data Engineering
The Performance of Concurrency Control Algorithms for Database Management Systems
VLDB '84 Proceedings of the 10th International Conference on Very Large Data Bases
Improving Performance in Replicated Databases through Relaxed Coherency
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
The failure and recovery problem for replicated databases
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
A Decentralized Algorithm for Erasure-Coded Virtual Disks
DSN '04 Proceedings of the 2004 International Conference on Dependable Systems and Networks
Efficient Byzantine-Tolerant Erasure-Coded Storage
DSN '04 Proceedings of the 2004 International Conference on Dependable Systems and Networks
Evaluation of Distributed Recovery in Large-Scale Storage Systems
HPDC '04 Proceedings of the 13th IEEE International Symposium on High Performance Distributed Computing
Using Erasure Codes Efficiently for Storage in a Distributed System
DSN '05 Proceedings of the 2005 International Conference on Dependable Systems and Networks
LH*RS---a highly-available scalable distributed data structure
ACM Transactions on Database Systems (TODS)
Erasure Codes for Increasing the Availability of Grid Data Storage
AICT-ICIW '06 Proceedings of the Advanced Int'l Conference on Telecommunications and Int'l Conference on Internet and Web Applications and Services
Scalable, distributed data structures for internet service construction
OSDI'00 Proceedings of the 4th conference on Symposium on Operating System Design & Implementation - Volume 4
Concurrency Control and Consistency of Multiple Copies of Data in Distributed Ingres
IEEE Transactions on Software Engineering
LH*RS: a highly available distributed data storage
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Maintaining and checking parity in highly available Scalable Distributed Data Structures
Journal of Systems and Software
| Hi-index | 0.00 |
With increased network speeds and throughputs, multicomputers (a system of computers connected by a high-speed network) have become an attractive alternative to store important data in their collective random access memory. Erasure codes provide spaceoptimal data redundancy to protect this type of storage from node unavailability. They have been used in LH*RS, the scalable high availability, distributed version of Linear Hashing. We present and evaluate a technique that uses the property of linear erasure correcting codes to make updates transactional and concurrent with recovery from one or more node availabilities without locks or two-phase commits. The technique significantly improves on previous work in update speed and also allows for serializable updates to a bucket that is in the process of being recovered.