Article

Free access

Optimistic concurrency control for abstract data types

Author:

Maurice HerlihyAuthors Info & Claims

PODC '86: Proceedings of the fifth annual ACM symposium on Principles of distributed computing

Pages 206 - 217

https://doi.org/10.1145/10590.10608

Published: 01 November 1986 Publication History

PDF eReader

References

[1]

R. Agrawal. Concurrency centre/and recovery in multiprocessor database machines: design and performance evaluation. PhD thesis, University of Wisconsin, 1983.]]

Digital Library

Google Scholar

[2]

D.Z. Badal. Concurrency Control overhead or closer look at blocking vs. non-blocking concurrency control mechanisms. In Proceedings of the 5th Berkeley Workshop, pages 55-103. 1981.]]

Google Scholar

[3]

M. Carey. Modeling and Evaluation of Database Concurrency ControlAIgorithms. PhD thesis, University of California, Berkeley, September, 1983.]]

Digital Library

Google Scholar

[4]

S. Ceri and S. Owicki. On the use of optimistic methods for concurrency control in distributed databases. In Proceedings of the 6th Berkeley Workshop, pages 117-130. 1982.]]

Google Scholar

[5]

A. Chan, S. Fox, W. T. Lin, A. Neff, and D. Ries. The implementation of an integrated concurrency control and recovery scheme. In Proceedings el the 1982 SlGMOD Conference. ACM GIGMOD, 1982.]]

Digital Library

Google Scholar

[6]

D.J. Dubourdieu. Implementation of distributed transactions. In Proceedings 1982 Berkeley Workshop on Distributed Data Management and Computer Networks, pages 81.94. 1982.]]

Google Scholar

[7]

C. Dwork and D. Skeen. The Inherent Cost of Nonblocking Commitment. In Proceedings of the Second Annual Symposium on Principles of Distributed Computing, pages 1-11. ACM, August, 1983.]]

Digital Library

Google Scholar

[8]

K.P. Eswaran, J. N. Gray, R. A. Lode, and I. L. Traiger. The notion of consistency and predicate locks in a database system. CommunicationsACM 19(11):624-633, November, 1976.]]

Digital Library

Google Scholar

[9]

P. Franaszek, and J. T. Robinson. Limitations of concurrency in transaction processing. ACM Transactions on Database Systems 10(1):1-28, March, 1985.]]

Digital Library

Google Scholar

[10]

D. Gawlick. Processing 'hot spots' in high performance systems. In Proceedings COMPCON'85. 19855.]]

Google Scholar

[11]

J. Gray. Notes on Database Operating Systems. Lecture Notes in Computer Science 60. Springer-Verlag, Berlin, 1978, pages 393-481.]]

Digital Library

Google Scholar

[12]

T. Hrder. Observations on optimistic concurrency control schemes. Information Systems 9:111-120, June, 1984.]]

Digital Library

Google Scholar

[13]

M.P. Herlihy. Comparing how atomicity mechanisms support replication. In Proceedings of the 4th annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing. August, 1985.]]

Digital Library

Google Scholar

[14]

M.P. Herlihy. Availability vs. atomicity: concurrency control for replicated.data. Technical Report CMU- CS-85-108, Carnegie-Mellon University, February, 1985.]]

Google Scholar

[15]

M.P. Herlihy. A quorum-consensus replication method for abstract data types. ACM Transactions on Computer Systems 4(1), February, 1986.]]

Digital Library

Google Scholar

[16]

H.F. Korth. Locking primitives in a database system. Journal of the ACM 30(1), January, 1983.]]

Digital Library

Google Scholar

[17]

H.T. Kung and J. T. Robinson. On optimistic methods for concurrency control. ACM Transactions on Database Systems 6:213-226, June, 1981.]]

Digital Library

Google Scholar

[18]

L. Lamport. Time, clocks, and the ordering of events in a distributed system. Communications of the ACM 21 (7):558-565, July, 1978.]]

Digital Library

Google Scholar

[19]

G. Lausen. Concurrency control in data base systems: a step towards the integration of optimistic methods and locking. In Proceedings el ACM '82. 1982.]]

Digital Library

Google Scholar

[20]

G. Lausen. Formal Aspects of optimistic concurrency control in a multiversion data base system. Information Systems 8(4):291-301, 1983.]]

Crossref

Google Scholar

[21]

D.A. Menasce, and N. Nakanishi. Optimistic versus pessimistic concurrency control mechanisms in data base management systems. /nformation Systems 7(1):13-27, 1982.]]

Google Scholar

[22]

J.E.B. Moss. Nested Transactions: An Approach to Reliable Distributed Computing. Technical Report MIT/LCS/TR-260, Massachusetts Institute of Technology Laboratory for Computer Science, April, 1981.]]

Digital Library

Google Scholar

[23]

C.H. Papadimitriou. The serializability of concurrent database updates. Journal of the ACM 26(4):631-653, October, 1979.]]

Digital Library

Google Scholar

[24]

D. Reed. Implementing atomic actions on decentralized data. ACM Transactions on Computer Systems 1 (1):3-23, February, 1983.]]

Digital Library

Google Scholar

[25]

Y.C. Tay, N. Goodman, and R. Suri. Perforrnance evaluation of locking in databases: a survey. Technical Report TR-17-84, Harvard Aiken Laboratory, 1984.]]

Google Scholar

[26]

R.H. Thomas. A solution to the concurrency control problem for multiple copy databases. In Prec. 16th IEEE Comput. Soc. Int. Conf. (COMPCON). Spring, 1978.]]

Google Scholar

[27]

W. Weihl. Data-Dependent concurrency control and recovery. In Proceedings of the 2nd annua/ ACM S/GACT- SIGOPS Symposium on Principles of Distributed Computing. August, 1983.]]

Digital Library

Google Scholar

Cited By

View all

Beck MBhat KStričević LChen GBehrens DFu MVafeiadis VChen HHärtig HAamodt TJerger NSwift M(2023)AtoMig: Automatically Migrating Millions Lines of Code from TSO to WMMProceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 210.1145/3575693.3579849(61-73)Online publication date: 27-Jan-2023
https://dl.acm.org/doi/10.1145/3575693.3579849
Zhang ILebeck NFonseca PHolt BCheng RNorberg AKrishnamurthy ALevy HKeeton KRoscoe T(2016)DiamondProceedings of the 12th USENIX conference on Operating Systems Design and Implementation10.5555/3026877.3026933(723-738)Online publication date: 2-Nov-2016
https://dl.acm.org/doi/10.5555/3026877.3026933
Alvaro PBailis PConway NHellerstein JLohman G(2013)Consistency without bordersProceedings of the 4th annual Symposium on Cloud Computing10.1145/2523616.2523632(1-10)Online publication date: 1-Oct-2013
https://dl.acm.org/doi/10.1145/2523616.2523632
Show More Cited By

Index Terms

Recommendations

Apologizing versus asking permission: optimistic concurrency control for abstract data types

An optimistic concurrency control technique is one that allows transactions to execute without synchronization, relying on commit-time validation to ensure serializability. Several new optimistic concurrency control techniques for objects in ...
Optimistic concurrency control for abstract data types

A concurrency control technique is optimistic if it allows transactions to execute without synchronization, relying on commit-time validation to ensure serializability. This paper describes several new optimistic concurrency control techniques for ...
Adaptable concurrency control for atomic data types

In many distributed systems concurrent access is required to a shared object, where abstract object servers may incorporate type-specific properties to define consistency requirements. Each operation and its outcome is treated as an event, and conflicts ...

Comments

Information & Contributors

Information

Published In

PODC '86: Proceedings of the fifth annual ACM symposium on Principles of distributed computing

November 1986

293 pages

ISBN:0897911989

DOI:10.1145/10590

Chairman:
Joseph Halpern

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 November 1986

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

PODC86

Sponsor:

SIGOPS

PODC86: The Fifth Annual ACM Symposium on Principles of Distributed Computing

August 11 - 13, 1986

Alberta, Calgary, Canada

Acceptance Rates

Overall Acceptance Rate 740 of 2,477 submissions, 30%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

16
Total Citations
View Citations
445
Total Downloads

Downloads (Last 12 months)64
Downloads (Last 6 weeks)6

Reflects downloads up to 10 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Beck MBhat KStričević LChen GBehrens DFu MVafeiadis VChen HHärtig HAamodt TJerger NSwift M(2023)AtoMig: Automatically Migrating Millions Lines of Code from TSO to WMMProceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 210.1145/3575693.3579849(61-73)Online publication date: 27-Jan-2023
https://dl.acm.org/doi/10.1145/3575693.3579849
Zhang ILebeck NFonseca PHolt BCheng RNorberg AKrishnamurthy ALevy HKeeton KRoscoe T(2016)DiamondProceedings of the 12th USENIX conference on Operating Systems Design and Implementation10.5555/3026877.3026933(723-738)Online publication date: 2-Nov-2016
https://dl.acm.org/doi/10.5555/3026877.3026933
Alvaro PBailis PConway NHellerstein JLohman G(2013)Consistency without bordersProceedings of the 4th annual Symposium on Cloud Computing10.1145/2523616.2523632(1-10)Online publication date: 1-Oct-2013
https://dl.acm.org/doi/10.1145/2523616.2523632
Parrington GShrivastava S(2000)Implementing Concurrency Control in Reliable Distributed Object-Oriented SystemsECOOP ’88 European Conference on Object-Oriented Programming10.1007/3-540-45910-3_14(233-249)Online publication date: 25-Aug-2000
https://doi.org/10.1007/3-540-45910-3_14
Satyanarayanan MKistler JMummert LEbling MKumar PLu Q(1996)Experience with Disconnected Operation in a Mobile Computing EnvironmentMobile Computing10.1007/978-0-585-29603-6_20(537-570)Online publication date: 1996
https://doi.org/10.1007/978-0-585-29603-6_20
Crichlow J(1994)Combining optimism and pessimism to produce high availability in distributed transaction processingACM SIGOPS Operating Systems Review10.1145/182110.18211528:3(43-64)Online publication date: 1-Jul-1994
https://dl.acm.org/doi/10.1145/182110.182115
Satyanarayanan MKistler JMummert LEbling MKumar PLu Q(1993)Experience with disconnected operation in a mobile computing environmentMobile & Location-Independent Computing Symposium on Mobile & Location-Independent Computing Symposium10.5555/1287073.1287075(2-2)Online publication date: 2-Aug-1993
https://dl.acm.org/doi/10.5555/1287073.1287075
Lomet D(1993)Using timestamping to optimize two phase commit[1993] Proceedings of the Second International Conference on Parallel and Distributed Information Systems10.1109/PDIS.1993.253073(48-55)Online publication date: 1993
https://doi.org/10.1109/PDIS.1993.253073
Badrinath BRamamritham K(1990)Performance evaluation of semantics-based multilevel concurrency control protocolsACM SIGMOD Record10.1145/93605.9872619:2(163-172)Online publication date: 1-May-1990
https://dl.acm.org/doi/10.1145/93605.98726
Badrinath BRamamritham KGarcia-Molina H(1990)Performance evaluation of semantics-based multilevel concurrency control protocolsProceedings of the 1990 ACM SIGMOD international conference on Management of data10.1145/93597.98726(163-172)Online publication date: 1-May-1990
https://dl.acm.org/doi/10.1145/93597.98726
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Apologizing versus asking permission: optimistic concurrency control for abstract data types

Optimistic concurrency control for abstract data types

Adaptable concurrency control for atomic data types