Efficient dispersal of information for security, load balancing, and fault tolerance
Journal of the ACM (JACM)
LH: Linear Hashing for distributed files
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
RAID: high-performance, reliable secondary storage
ACM Computing Surveys (CSUR)
Distributing a search tree among a growing number of processors
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
EVENODD: An Efficient Scheme for Tolerating Double Disk Failures in RAID Architectures
IEEE Transactions on Computers - Special issue on fault-tolerant computing
LH*—a scalable, distributed data structure
ACM Transactions on Database Systems (TODS)
Implementation of the substring test by hashing
Communications of the ACM
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
k-RP*s: a scalable distributed data structure for high-performance multi-attribute access
DIS '96 Proceedings of the fourth international conference on on Parallel and distributed information systems
LH*G: A High-Availability Scalable Distributed Data Structure By Record Grouping
IEEE Transactions on Knowledge and Data Engineering
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
RP*: A Family of Order Preserving Scalable Distributed Data Structures
VLDB '94 Proceedings of the 20th 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
High-Availability LH* Schemes with Mirroring
COOPIS '96 Proceedings of the First IFCIS International Conference on Cooperative Information Systems
The failure and recovery problem for replicated databases
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Algebraic Signatures for Scalable Distributed Data Structures
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
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
Efficient randomized pattern-matching algorithms
IBM Journal of Research and Development - Mathematics and computing
Evaluation of Distributed Recovery in Large-Scale Storage Systems
HPDC '04 Proceedings of the 13th IEEE International Symposium on High Performance Distributed Computing
Disk Scrubbing in Large Archival Storage Systems
MASCOTS '04 Proceedings of the The IEEE Computer Society's 12th Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems
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)
Awarded Best Paper! -- Row-Diagonal Parity for Double Disk Failure Correction
FAST '04 Proceedings of the 3rd USENIX Conference on File and Storage Technologies
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
Store, Forget, and Check: Using Algebraic Signatures to Check Remotely Administered Storage
ICDCS '06 Proceedings of the 26th IEEE International Conference on Distributed Computing Systems
Efficient Updates in Highly Available Distributed Random Access Memory
ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
Linear hashing: a new tool for file and table addressing
VLDB '80 Proceedings of the sixth international conference on Very Large Data Bases - Volume 6
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
Pergamum: replacing tape with energy efficient, reliable, disk-based archival storage
FAST'08 Proceedings of the 6th USENIX Conference on File and Storage Technologies
| Hi-index | 0.01 |
Access to data stored in distributed main memory is much faster than access to local disks. Highly available, Scalable Distributed Data Structures (SDDS) utilize this fast access. They counteract the effects of failed or unavailable nodes by storing data redundantly. Since main memory per node is limited, they generate this redundancy by storing parity data calculated with erasure correcting codes instead of using replication. We present here a way to maintain parity that is about 10 times faster than using the traditional 2PC scheme. We also present a scheme that can diagnose a mismatch between parity and user data with very little network traffic.