Book ChapterDOI
Commutativity-Based Locking for Nested Transactions
Alan Fekete,Nancy Lynch,Michael Merritt,William E. Weihl +3 more
- pp 319-340
Reads0
Chats0
TLDR
A new algorithm for concurrency control in nested transaction systems that uses semantic information about an object (commutativity of operations) to obtain more concurrency than is available with Moss’ locking algorithm.Abstract:
We introduce a new algorithm for concurrency control in nested transaction systems. The algorithm uses semantic information about an object (commutativity of operations) to obtain more concurrency than is available with Moss’ locking algorithm which is currently used as the default in systems like Argus and Camelot. We define “dynamic atomicity”, a local property of an object, and prove that dynamic atomicity of each object guarantees the correctness of the whole system. Objects implemented using the commutativity-based locking algorithm are dynamic atomic.read more
Citations
More filters
Journal ArticleDOI
ARIES: a transaction recovery method supporting fine-granularity locking and partial rollbacks using write-ahead logging
TL;DR: ARIES as discussed by the authors is a database management system applicable not only to database management systems but also to persistent object-oriented languages, recoverable file systems and transaction-based operating systems.
Journal ArticleDOI
Principles and realization strategies of multilevel transaction management
TL;DR: A family of concurrency control strategies based on the theoretical notion of multilevel serializability and a series of measurements has been performed in order to compare several strategies, indicating considerable performance gains of the multileVEL transaction approach.
Journal ArticleDOI
Local atomicity properties: modular concurrency control for abstract data types
TL;DR: This paper introduces several local constraints on individual objects that suffice to ensure global atomicity of actions and presents three local atomicity properties, each of which is optimal.
Journal ArticleDOI
Concurrency control issues in nested transactions
Theo Härder,Kurt Rothermel +1 more
TL;DR: A model for nested transactions is proposed allowing for effective exploitation of intra-transaction parallelism, and it can be shown how “controlled downward inheritance” for hierarchical objects is achieved in nested transactions.
Proceedings ArticleDOI
Semantic concurrency control in object-oriented database systems
TL;DR: A locking protocol for object-oriented database systems (OODBSs) is presented and it is shown that, using the locking protocol in an open-nested transaction, the locks of a subtransactions are released when the subtransaction completes, and only a semantic lock is held further by the parent of the subTransaction.
References
More filters
Book
Nested Transactions: An Approach to Reliable Distributed Computing
TL;DR: The method for implementing nested transactions is novel in that it uses locking for concurrency control and the necessary algorithms for locking, recovery, distributed commitment, and distributed deadlock detection for a nested transaction system are presented.
Proceedings ArticleDOI
Hierarchical correctness proofs for distributed algorithms
Nancy Lynch,Mark R. Tuttle +1 more
TL;DR: This thesis introduces a new model for distributed computation in asynchronous networks, the input-output automaton, which captures in a novel way the game-theoretical interaction between a system and its environment and allows fundamental properties of distributed computation to be naturally expressed.
Journal ArticleDOI
Distributed programming in Argus
TL;DR: Argus as mentioned in this paper is a programming language and system developed to support the implementation and execution of distributed programs and provides mechanisms that help programmers cope with the special problems that arise in distributed programs, such as network partitions and crashes of remote nodes.
Specification and implementation of atomic data types
TL;DR: This dissertation explores an approach in which atomicity is ensured by the data objects shared by concurrent activities; such objects are called Atomic objects, and data types whose objects are atomic are called atomic types.
On the Correctness of Orphan Elimination Algorithms.
TL;DR: This paper analyzes two orphan elimination algorithms that have been proposed for nested transaction systems, describes the algorthms formally, and presents complete detailed proofs of correctness.