Synchronizing shared abstract types
ACM Transactions on Computer Systems (TOCS)
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
Extending Multiversion Time-Stamping Protocols to Exploit Type Information
IEEE Transactions on Computers
Commutativity-based concurrency control for abstract data types
Proceedings of the Twenty-First Annual Hawaii International Conference on Software Track
Local atomicity properties: modular concurrency control for abstract data types
ACM Transactions on Programming Languages and Systems (TOPLAS)
On optimistic methods for concurrency control
ACM Transactions on Database Systems (TODS)
A Majority consensus approach to concurrency control for multiple copy databases
ACM Transactions on Database Systems (TODS)
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
Distributed Systems - Architecture and Implementation, An Advanced Course
INTERNAL CONSISTENCY OF A DISTRIBUTED TRANSACTION SYSTEM WITH ORPHAN DETECTION
INTERNAL CONSISTENCY OF A DISTRIBUTED TRANSACTION SYSTEM WITH ORPHAN DETECTION
SPECIFICATION AND IMPLEMENTATION OF ATOMIC DATA TYPES
SPECIFICATION AND IMPLEMENTATION OF ATOMIC DATA TYPES
Remote procedure call
Local atomicity properties: modular concurrency control for abstract data types
ACM Transactions on Programming Languages and Systems (TOPLAS)
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)
ACTA: a framework for specifying and reasoning about transaction structure and behavior
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Extracting concurrency from objects: a methodology
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
Concurrency control in advanced database applications
ACM Computing Surveys (CSUR)
ACM Transactions on Database Systems (TODS)
Semantics-based concurrency control: beyond commutativity
ACM Transactions on Database Systems (TODS)
Adaptable concurrency control for atomic data types
ACM Transactions on Computer Systems (TOCS)
Towards a unified theory of concurrency control and recovery
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Synthesis of extended transaction models using ACTA
ACM Transactions on Database Systems (TODS)
Propagation of authorizations in distributed database systems
CCS '94 Proceedings of the 2nd ACM Conference on Computer and communications security
Bounded ignorance: a technique for increasing concurrency in a replicated system
ACM Transactions on Database Systems (TODS)
A new conflict relation for concurrency control and recovery in object-based databases
CIKM '96 Proceedings of the fifth international conference on Information and knowledge management
PRO-MOTION: management of mobile transactions
SAC '97 Proceedings of the 1997 ACM symposium on Applied computing
Using Metaobject Protocols to Implement Atomic Data Types
ECOOP '95 Proceedings of the 9th European Conference on Object-Oriented Programming
A Formalism for Extended Transaction Model
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
A taxonomy of correctness criteria in database applications
The VLDB Journal — The International Journal on Very Large Data Bases
Optimistic parallelism requires abstractions
Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation
Transaction independence: The road to cooperative systems
Mathematical and Computer Modelling: An International Journal
| Hi-index | 0.00 |
We define a new locking protocol that permits more concurrency than existing commutativity-based protocols. The protocol uses timestamps generated when transactions commit to provide more information about the serialization order of transactions, and hence to weaken the constraints on conflicts. In addition, the protocol permits operations to be both partial and non-deterministic, and it permits results of operations to be used in choosing locks. The protocol exploits type-specific properties of objects, necessary and sufficient constraints on lock conflicts are defined directly from a data type specification. We give a complete formal description of the protocol, encompassing both concurrency control and recovery, and prove that the protocol satisfies hybrid atomicity, a local atomicity property that combines aspects of static and dynamic atomic protocols. We also show that the protocol is optimal in the sense that no hybrid atomic locking scheme can permit more concurrency.