Synchronizing shared abstract types
ACM Transactions on Computer Systems (TOCS)
An algorithm for concurrency control and recovery in replicated distributed databases
ACM Transactions on Database Systems (TODS)
A quorum-consensus replication method for abstract data types
ACM Transactions on Computer Systems (TOCS)
Dynamic quorum adjustment for partitioned data
ACM Transactions on Database Systems (TODS)
Concurrency versus availability: atomicity mechanisms for replicated data
ACM Transactions on Computer Systems (TOCS)
A weighted voting algorithm for replicated directories
Journal of the ACM (JACM)
Extending Multiversion Time-Stamping Protocols to Exploit Type Information
IEEE Transactions on Computers
Quorum consensus in nested transaction systems
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Hybrid concurrency control for abstract data types
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On Concurrency Control by Multiple Versions
ACM Transactions on Database Systems (TODS)
Achieving robustness in distributed database systems
ACM Transactions on Database Systems (TODS)
A Majority consensus approach to concurrency control for multiple copy databases
ACM Transactions on Database Systems (TODS)
Reliability mechanisms for SDD-1: a system for distributed databases
ACM Transactions on Database Systems (TODS)
The serializability of concurrent database updates
Journal of the ACM (JACM)
Locking Primitives in a Database System
Journal of the ACM (JACM)
Comparing how atomicity mechanisms support replication
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Replication and fault-tolerance in the ISIS system
Proceedings of the tenth ACM symposium on Operating systems principles
An efficient, fault-tolerant protocol for replicated data management
PODS '85 Proceedings of the fourth ACM SIGACT-SIGMOD symposium on Principles of database systems
Concurrency Control in Distributed Database Systems
ACM Computing Surveys (CSUR)
Guardians and Actions: Linguistic Support for Robust, Distributed Programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Implementing atomic actions on decentralized data
ACM Transactions on Computer Systems (TOCS)
Grapevine: an exercise in distributed computing
Communications of the ACM
The notions of consistency and predicate locks in a database system
Communications of the ACM
The implementation of an integrated concurrency control and recovery scheme
SIGMOD '82 Proceedings of the 1982 ACM SIGMOD international conference on Management of data
Concurrency control for resilient nested transactions
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
Sacrificing serializability to attain high availability of data in an unreliable network
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
Notes on Data Base Operating Systems
Operating Systems, An Advanced Course
Weighted voting for replicated data
SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
A reliable object-oriented data repository for a distributed computer system
SOSP '81 Proceedings of the eighth ACM symposium on Operating systems principles
Data-dependent concurrency control and recovery (Extended Abstract)
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
The failure and recovery problem for replicated databases
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
A principle for resilient sharing of distributed resources
ICSE '76 Proceedings of the 2nd international conference on Software engineering
Availability in partitioned replicated databases
Availability in partitioned replicated databases
NESTED TRANSACTIONS: AN APPROACH TO RELIABLE DISTRIBUTED COMPUTING
NESTED TRANSACTIONS: AN APPROACH TO RELIABLE DISTRIBUTED COMPUTING
SPECIFICATION AND IMPLEMENTATION OF ATOMIC DATA TYPES
SPECIFICATION AND IMPLEMENTATION OF ATOMIC DATA TYPES
INTRODUCTION TO THE THEORY OF NESTED TRANSACTIONS
INTRODUCTION TO THE THEORY OF NESTED TRANSACTIONS
On computing serial dependency relations
Journal of Computer and System Sciences
Data replication for external searching in static tree structures
Proceedings of the ninth international conference on Information and knowledge management
The south zone: distributed algorithms for alliances
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Performance comparison of majority voting with ROWA replication method over planetlab
IWDC'05 Proceedings of the 7th international conference on Distributed Computing
| Hi-index | 0.00 |
A replicated data object is a typed object that is stored redundantly at multiple locations in a distributed system. Each of the object's operations has a set of quorums, which are sets of sites whose cooperation is needed to execute that operation. A quorum assignment associates each operation with its set of quorums. An operation's quorums determine its availability, and the constraints governing an object's quorum assignments determine the range of availability properties realizable by replication.In this paper, the restrictions on quorum assignment imposed by three kinds of atomicity mechanisms found in the literature are analyzed: (1) serial schemes, in which replication and atomicity are implemented independently at different levels in the system, (2) static schemes, in which the transaction serialization order is predetermined, and (3) hybrid schemes in which the serialization order emerges dynamically.The following results are derived: (1) Although serial schemes place the strongest restrictions on concurrency, they place the weakest restrictions on availability. (2) Although hybrid and static mechanisms place incomparable restrictions on concurrency, hybrid mechanisms place weaker restrictions on availability. (3) Bounding the maximum depth of transaction nesting strengthens restrictions on concurrency for all classes, but weakens restrictions on availability for hybrid schemes only. Concurrency and availability are best considered as dual properties: A complete analysis of an atomicity mechanism should take both into account.