Implementation of resilient, atomic data types
ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
A quorum-consensus replication method for abstract data types
ACM Transactions on Computer Systems (TOCS)
Comparing how atomicity mechanisms support replication
ACM SIGOPS Operating Systems Review
Availability in partitioned replicated databases
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
Exploiting virtual synchrony in distributed systems
SOSP '87 Proceedings of the eleventh ACM Symposium on Operating systems principles
Quorum consensus in nested transaction systems
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Replicated architectures for shared window systems: a critique
COCS '90 Proceedings of the ACM SIGOIS and IEEE CS TC-OA conference on Office information systems
Quorum consensus in nested-transaction systems
ACM Transactions on Database Systems (TODS)
Crumbling walls: a class of practical and efficient quorum systems
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Access control and signatures via quorum secret sharing
CCS '96 Proceedings of the 3rd ACM conference on Computer and communications security
How to be an efficient snoop, or the probe complexity of quorum systems (extended abstract)
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Access Control and Signatures via Quorum Secret Sharing
IEEE Transactions on Parallel and Distributed Systems
Comparing how atomicity mechanisms support replication
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Distributed version management for read-only actions (extended abstract)
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Replicated distributed programs
Proceedings of the tenth ACM symposium on Operating systems principles
Local majorities, coalitions and monopolies in graphs: a review
Theoretical Computer Science
Evaluating quorum systems over the Internet
FTCS '96 Proceedings of the The Twenty-Sixth Annual International Symposium on Fault-Tolerant Computing (FTCS '96)
Compact and localized distributed data structures
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
ExoSnap: a modular approach to semantic synchronization and snapshots
Proceedings of the 2nd workshop on Dependable distributed data management
Byzantine and multi-writer k-quorums
DISC'06 Proceedings of the 20th international conference on Distributed Computing
| Hi-index | 0.00 |
Replication can enhance the availability of data in a distributed system. This thesis introduces a new method for managing replicated data. We propose new techniques to address four problems associated with replication: (i) the representation and manipulation of replicated data, (ii) concurrency control, (iii) on-the-fly reconfiguration, and (iv) enhancing availability in the presence of partitions. Unlike many methods that support replication only for uninterpreted files, our method makes use of type-specific properties of objects (such as sets, queues, or directories) to provide more effective replication. Associated with each operation of the data type is a set of quorums, which are collections of sites whose cooperation suffices to execute the operation. An analysis of the algebraic structure of the data type is used to derive a set of constraints on quorum intersections. Any choice of quorums that satisfies these constraints yields a correct implementation, and it can be shown that no smaller set of constraints guarantees correctness. By taking advantage of type-specific properties in a general and systematic way, our method can realize a wider range of availability properties, more concurrency, more flexible reconfiguration, and better tolerance of partitions than existing replication methods.