Extending Multiversion Time-Stamping Protocols to Exploit Type Information

1 April 1987

journal article
Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers

Vol. C-36 (4) , 443-448
https://doi.org/10.1109/tc.1987.1676926

Abstract

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.

Keywords

This publication has 12 references indexed in Scilit:

A quorum-consensus replication method for abstract data types
ACM Transactions on Computer Systems, 1986
Optimistic concurrency control for abstract data types
Published by Association for Computing Machinery (ACM) ,1986
Comparing how atomicity mechanisms support replication
Published by Association for Computing Machinery (ACM) ,1985
On Concurrency Control by Multiple Versions
ACM Transactions on Database Systems, 1984
Implementing atomic actions on decentralized data
ACM Transactions on Computer Systems, 1983
The serializability of concurrent database updates
Journal of the ACM, 1979
Weighted voting for replicated data
Published by Association for Computing Machinery (ACM) ,1979
Recovery Techniques for Database Systems
ACM Computing Surveys, 1978
Notes on data base operating systems
Published by Springer Nature ,1978
The notions of consistency and predicate locks in a database system
Communications of the ACM, 1976