A quorum-consensus replication method for abstract data types
ACM Transactions on Computer Systems (TOCS)
Optimistic concurrency control for abstract data types
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
On Concurrency Control by Multiple Versions
ACM Transactions on Database Systems (TODS)
The serializability of concurrent database updates
Journal of the ACM (JACM)
Comparing how atomicity mechanisms support replication
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Recovery Techniques for Database Systems
ACM Computing Surveys (CSUR)
Concurrency Control in Distributed Database Systems
ACM Computing Surveys (CSUR)
Implementing atomic actions on decentralized data
ACM Transactions on Computer Systems (TOCS)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
The notions of consistency and predicate locks in a database system
Communications of the ACM
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
Data-dependent concurrency control and recovery (Extended Abstract)
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Concurrency versus availability: atomicity mechanisms for replicated data
ACM Transactions on Computer Systems (TOCS)
Local atomicity properties: modular concurrency control for abstract data types
ACM Transactions on Programming Languages and Systems (TOPLAS)
Preserving and using context information in interprocess communication
ACM Transactions on Computer Systems (TOCS)
Concurrency and availability as dual properties of replicated atomic data
Journal of the ACM (JACM)
Apologizing versus asking permission: optimistic concurrency control for abstract data types
ACM Transactions on Database Systems (TODS)
Performance evaluation of semantics-based multilevel concurrency control protocols
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Quorum consensus in nested-transaction systems
ACM Transactions on Database Systems (TODS)
Applying formal methods to semantic-based decomposition of transactions
ACM Transactions on Database Systems (TODS)
Hybrid concurrency control for abstract data types
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A Theory of Timestamp-Based Concurrency Control for Nested Transactions
VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
Using Formal Methods to Reason about Semantics-Based Decompositions of Transactions
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Real-time update of access control policies
Data & Knowledge Engineering
| Hi-index | 14.98 |
Atomic transactions are a widely accepted approach to implementing and reasoning about fault-tolerant distributed programs. This paper shows how multiversion time-stamping protocols for atomicity can be extended to induce fewer delays and restarts by exploiting semantic information about objects such as queues, directories, or counters. This technique relies on static preanalysis of conflicts between operations, and incurs no additioiwal runtime overhead. This technique is deadlock-free, and it is applicable to objects of arbitrary type.