article

Free access

Analysis of some optimistic concurrency control schemes based on certification

Authors:

Alexander Thomasian,

In Kyung RyuAuthors Info & Claims

ACM SIGMETRICS Performance Evaluation Review, Volume 13, Issue 2

Pages 192 - 203

https://doi.org/10.1145/317786.317824

Published: 01 August 1985 Publication History

PDF eReader

Abstract

Optimistic Concurrency Control-OCC schemes based on certification are analyzed in this paper. We allow two types of data access schemes referred to as static and dynamic. According to the first (second) scheme a transaction reads all the required data items at the beginning of its processing (on demand during its processing), respectively. After completing its processing, each transaction is checked as to whether it has encountered a data conflict. Validated transactions commit; otherwise, they are restarted. A variant of the regular (silent) commit scheme where a committing transaction notifies conflicted transactions to restart immediately (broadcast commit scheme) is also considered. We use an iterative method to analyze the performance of OCC schemes in the framework of a system with a fixed number of transactions in multiple classes with given probabilities for their occurrence. The iterative method is validated against simulation and shown to be highly accurate even for high data contention. We present graphs/tables, which are used to determine how system performance is affected by: (i) various OCC schemes, (ii) transaction size, i.e., number of data items accessed, (iii) number of transactions, (iv) the distribution of transaction processing time requirements, (v) the throughput characteristic of the system, and (vi) granule placement.

References

[1]

Carey, M. Modeling and evaluation of database concurrency control algorithms. Ph.D. Th., University of California, Berkeley, September 198,3.

Digital Library

Google Scholar

[2]

Galler, B.I. Concurrency control performance issues. CSRG-147, Computer Sytems Research Group, University of Toronto, September, 1982.

Google Scholar

[3]

Kleinrock, L. Queueing Systems, Vol.l: Theory. John Wiley, New York, 1975.

Digital Library

Google Scholar

[4]

Kung, H.T. and Robinson, J.T. ~On optimistic methods for concurrency control'. Trans. Database Systems 6, 2 (June 1081), 21~-226.

Digital Library

Google Scholar

[5]

Menasce, D.A. and Nakanishi, T. wOptimistic versus pessimistic concurrency control mechanisms in database management systems~. Information systems 7, 1 (1982), 13-27.

Google Scholar

[6]

Morris, R.J.T. and Wong, W.S. Performance analysis of locking and optimistic concurrency control alogorithms. Submitted to Performance Evaluation.

Google Scholar

[7]

Morris, R.J.T. and Wong, W.S. Performance of concurrency control algorithms with nonexclusive accesses. In Performance '8~, North-Holland, Paris, France, 1084.

Digital Library

Google Scholar

[8]

Potier, D. and Leblanc, P. "Analysis of locking policies in database management systems'. Comm. AGM P.~, 10 (October :oso), 5s4-503.

Digital Library

Google Scholar

[9]

Robinson, J.T. Design of concurrency controls for transaction processin~ systems. Ph.D. Th., Carnegie-Mellon University, 1982.

Digital Library

Google Scholar

[10]

Ryu, I.K. Performace evaluation of concurrency control in database systems. Ph.D. Th., Dept EE-Systems, University of Southern California, 1985.

Google Scholar

[11]

Tay, Y.C., Goodman, N., and Suri, R. Performance evaluation of locking in a database: A survey. TR-17-84, Harvard University, 1984.

Google Scholar

Cited By

View all

Yu PDias DLavenberg S(1993)On the analytical modeling of database concurrency controlJournal of the ACM10.1145/153724.15373340:4(831-872)Online publication date: 1-Sep-1993
https://dl.acm.org/doi/10.1145/153724.153733
Yu PDias D(1993)Performance Analysis of Concurrency Control Using Locking with Deferred BlockingIEEE Transactions on Software Engineering10.1109/32.24574019:10(982-996)Online publication date: 1-Oct-1993
https://dl.acm.org/doi/10.1109/32.245740
Yu P(1993)Modeling and analysis of transaction processing systemsPerformance Evaluation of Computer and Communication Systems10.1007/BFb0013872(651-675)Online publication date: 1993
https://doi.org/10.1007/BFb0013872
Show More Cited By

Index Terms

Analysis of some optimistic concurrency control schemes based on certification

Recommendations

Analysis of some optimistic concurrency control schemes based on certification
SIGMETRICS '85: Proceedings of the 1985 ACM SIGMETRICS conference on Measurement and modeling of computer systems

Optimistic Concurrency Control-OCC schemes based on certification are analyzed in this paper. We allow two types of data access schemes referred to as static and dynamic. According to the first (second) scheme a transaction reads all the required data ...
Distributed optimistic concurrency control with reduced rollback

Concurrency control algorithms have traditionally been based on locking and timestamp ordering mechanisms. Recently optimistic schemes have been proposed. In this paper a distributed, multi-version, optimistic concurrency control scheme is described ...
Semantics-based concurrency control: beyond commutativity

The concurrency of transactions executing on atomic data types can be enhanced through the use of semantic information about operations defined on these types. Hitherto, commutativity of operations has been exploited to provide enchanced concurrency ...

Comments

Information & Contributors

Information

Published In

cover image ACM SIGMETRICS Performance Evaluation Review

ACM SIGMETRICS Performance Evaluation Review Volume 13, Issue 2

Aug. 1985

205 pages

ISSN:0163-5999

DOI:10.1145/317786

Chairmen:
Herbert D. Schwetman
MCC
,
Jeffrey A. Brumfield
Univ. of Texas
,
Daniel A. Reed
Univ. of Illinois
,
Editor:
Blaine D. Gaither
New Mexico Institute of Technology, Socorro

Issue’s Table of Contents

SIGMETRICS '85: Proceedings of the 1985 ACM SIGMETRICS conference on Measurement and modeling of computer systems
August 1985
203 pages
ISBN:0897911695
DOI:10.1145/317795
Chairmen:
Herbert D. Schwetman
MCC, Austin, TX
,
Jeffrey A. Brumfield
Univ. of Texas
,
Daniel A. Reed
Univ. of Illinois
,
Editor:
Blaine D. Gaither
New Mexico Institute of Technology, Socorro

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 August 1985

Published in SIGMETRICS Volume 13, Issue 2

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

10
Total Citations
View Citations
379
Total Downloads

Downloads (Last 12 months)37
Downloads (Last 6 weeks)5

Reflects downloads up to 09 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Yu PDias DLavenberg S(1993)On the analytical modeling of database concurrency controlJournal of the ACM10.1145/153724.15373340:4(831-872)Online publication date: 1-Sep-1993
https://dl.acm.org/doi/10.1145/153724.153733
Yu PDias D(1993)Performance Analysis of Concurrency Control Using Locking with Deferred BlockingIEEE Transactions on Software Engineering10.1109/32.24574019:10(982-996)Online publication date: 1-Oct-1993
https://dl.acm.org/doi/10.1109/32.245740
Yu P(1993)Modeling and analysis of transaction processing systemsPerformance Evaluation of Computer and Communication Systems10.1007/BFb0013872(651-675)Online publication date: 1993
https://doi.org/10.1007/BFb0013872
Yu PDias D(1992)Analysis of Hybrid Concurrency Control Schemes for a High Data Contention EnvironmentIEEE Transactions on Software Engineering10.1109/32.12175418:2(118-129)Online publication date: 1-Feb-1992
https://dl.acm.org/doi/10.1109/32.121754
Yu PDias D(1991)Performance analysis of optimistic concurrency control schemes with different rerun policies[1991] Proceedings The Fifteenth Annual International Computer Software & Applications Conference10.1109/CMPSAC.1991.170192(294-300)Online publication date: 1991
https://doi.org/10.1109/CMPSAC.1991.170192
Yu PDias D(1990)Impact of large memory on the performance of optimistic concurrency control schemesProceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications10.1109/PARBSE.1990.77120(86-90)Online publication date: 1990
https://doi.org/10.1109/PARBSE.1990.77120
Dan ADias DYu P(1990)Database buffer model for the data sharing environment[1990] Proceedings. Sixth International Conference on Data Engineering10.1109/ICDE.1990.113508(538-544)Online publication date: 1990
https://doi.org/10.1109/ICDE.1990.113508
Singhal M(1991)Analysis of the Probability of Transaction Abort and Throughput of Two Timestamp Ordering Algorithms for Database SystemsIEEE Transactions on Knowledge and Data Engineering10.1109/69.880073:2(261-266)Online publication date: 1-Jun-1991
https://dl.acm.org/doi/10.1109/69.88007
Ryu IThomasian A(1990)Performance Analysis of Dynamic Locking with the No-Waiting PolicyIEEE Transactions on Software Engineering10.1109/32.5609516:7(684-698)Online publication date: 1-Jul-1990
https://dl.acm.org/doi/10.1109/32.56095
Dan ATowsley DKohler W(1988)Modeling the effects of data and resource contention on the performance of optimistic concurrency control protocolsProceedings. Fourth International Conference on Data Engineering10.1109/ICDE.1988.105486(418-425)Online publication date: 1988
https://doi.org/10.1109/ICDE.1988.105486

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.

Abstract

References

Cited By

Index Terms

Recommendations