Implementation of resilient, atomic data types
ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
Nested transactions: an approach to reliable distributed computing
Nested transactions: an approach to reliable distributed computing
The theory of database concurrency control
The theory of database concurrency control
Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Concurrency control in distributed database systems
Concurrency control in distributed database systems
Using histories to implement atomic objects
ACM Transactions on Computer Systems (TOCS)
On optimistic methods for concurrency control
ACM Transactions on Database Systems (TODS)
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)
CASCON '92 Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 2
| Hi-index | 0.02 |
Nested transactions [6, 5] provide fine grain atomicity, efficient recovery control, and structural modularity. In distributed environments, they provide a natural and semantically clean way of modeling computations. However, the characteristics of nested transactions are sufficiently different from those of traditional single-level transactions that concurrency control for nested transactions should be reconsidered in order to exploit all its advantages.In this paper, we investigate a new concurrency control protocol for nested transactions, and introduce the notion of a request list for that purpose. Our objectives are to provide shorter transaction turn-around times and better system throughput. These goals are accomplished by exploiting intra-transaction concurrency and by reducing the time a transaction has to wait for consistent data states.