article

Free access

Locking performance in centralized databases

Authors:

Nathan Goodman,

R. SuriAuthors Info & Claims

ACM Transactions on Database Systems (TODS), Volume 10, Issue 4

Pages 415 - 462

https://doi.org/10.1145/4879.4880

Published: 01 December 1985 Publication History

Abstract

An analytic model is used to study the performance of dynamic locking. The analysis uses only the steady-state average values of the variables. The solution to the model is given by a cubic, which has exactly one valid root for the range of parametric values that is of interest. The model's predictions agree well with simulation results for transactions that require up to twenty locks. The model separates data contention from resource contention, thus facilitating an analysis of their separate effects and their interaction. It shows that systems with a particular form of nonuniform access, or with shared locks, are equivalent to systems with uniform access and only exclusive locks.

Blocking due to conflicts is found to impose an upper bound on transaction throughput; this fact leads to a rule of thumb on how much data contention should be permitted in a system. Throughput can exceed this bound if a transaction is restarted whenever it encounters a conflict, provided restart costs and resource contention are low. It can also be exceeded by making transactions predeclare their locks. Raising the multiprogramming level to increase throughput also raises the number of restarts per completion. Transactions should minimize their lock requests, because data contention is proportional to the square of the number of requests. The choice of how much data to lock at a time depends on which part of a general granularity curve the system sees.

References

[1]

AGRAWAL, R., CAREY, M. J., AND LIVNY, M. Models for studying concurrency control performance: Alternatives and implications. In Proceedings of the A CM SIGMOD International Conference on Management of Data (Austin, Tex., May 1985), ACM, New York.

Digital Library

[2]

BALTER, R., BERARD, P., AND DECITRE, P. Why control of concurrency level in distributed systems is more fundamental than deadlock management. In Proceedings of the ACM SIGACT- SIGOPS Symposium on Principles of Distributed Computing (Ottawa, Can., Aug. 1982), ACM, New York, pp. 183-193.

Digital Library

[3]

BASKETT, F., CHANDY, K. M., MUNTZ, R. R., AND PALACIOS, F.G. Open, closed and mixed networks with different classes of customers. J. ACM 22, 2 (Apr. 1975), 248-260.

Digital Library

[4]

BEERI, C., AND OBERMARCK, R. A resource class independent deadlock detection algorithm. In Proceedings of the International Conference on Very Large Data Bases (Cannes, France, Sept. 1981), pp. 166-178.

[5]

BERNSTEIN, P. A., AND GOODMAN, N. Concurrency control in distributed database systems. ACM Comput. Surv. 13, 2 (June 1981), 185-221.

Digital Library

[6]

CAREV, M. Modeling and evaluation of database concurrency control algorithms. Ph.D. Dissertation (UCB/ERL 83/56), University of California, Berkeley, Calif., Sept. 1983.

Digital Library

[7]

CAREY, M., AND STONEBRAKER, M. The performance of concurrency control algorithms for DBMSs. In Proceedings of the International Conference on Very Large Data Bases (Singapore, Aug. 1984), pp. 107-118.

Digital Library

[8]

CHAMBERLIN, D. D., BO~CE, R. F., AND TRAIGER, I.L. A deadlock-free scheme for resource allocation in a database environment. In Info. Proc. 74, North-Holland, Amsterdam, 1974, 340-343.

[9]

CHESNAIS, A., GELENBE, E., AND MITRANI, I. On the modelling of parallel access to shared data. Commun. ACM 26, 3 (Mar. 1983), 196-202.

Digital Library

[10]

DANTAS, J. E.R. Performance analysis of distributed database systems. Ph.D. Dissertation, Computer Science Department, University of California, Los Angeles, Calif., 1980.

Digital Library

[11]

DENNING, P. J., AND BUZEN, J. 1). The operational analysis of queuing network models. A CM Comput. Surv. 10, 3 {Sept. 1978), 225-262.

Digital Library

[12]

DENNING, P. J., KAHN, K. C., LEROUDIER, J., POTIER, D., AND SURI, R. Optimal multiprogramming. Acta In}:. 7, 2 (1976), 197-216.

[13]

DEVOR, C., AND CARLSON, C.a. Structural locking mechanisms and their effect on database management system performance. Inf. Syst. 7, 4 (1982), 345-358.

[14]

ESWARAN, K. P., GRAY, J. N., LORIE, R. A., AND TRMGER, I.L. The notions of consistency and predicate locks in a database system. Commun. ACM 19, 11 (Nov. 1976), 624-633.

Digital Library

[15]

GALLER, B. I., AND BOS, L. A model of transaction blocking in databases. Performance Eval. 3 (1983), 95-122.

[16]

GRAY, J. Notes on data base operating systems. In Operating Systems--An Advanced Course, R. Bayer, R. M. Graham, and G. Seegmuller, Eds. Springer Verlag, New York, 1978, pp. 393-481.

Digital Library

[17]

GRAY, J. A transaction model. In Lecture Notes in Computer Science 85, G. Goos and J. Hartmanis, Eds. Springer Verlag, New York, 1980, pp. 282-298.

Digital Library

[18]

GRAY, J., HOMAN, P., KORTH, H., AND OBERMARCK, R. A straw man analysis of the probability of waiting and deadlock in a database system. Tech. Rep. RJ3066, IBM Research Lab., San Jose, Calif., Feb. 1981.

[19]

IRANI, K. B., AND LIN, H.L. Queueing network models for concurrent transaction processing in a database system. In Proceedings of the ACM SIGMOD International Conference on Management of Data (Boston, Mass., Jan. 1979), ACM, New York, pp. 134-142.

Digital Library

[20]

KIESSLING, W., AND LANDHERR, G. A quantitative comparison of lockprotocols for centralized databases. In Proceedings of the International Conference on Very Large Data Bases {Florence, Italy, Oct. 1983), pp. 120-130.

Digital Library

[21]

KLEINROCK, L. Queueing Systems, Vol. 1: Theory. John Wiley, New York, 1975.

Digital Library

[22]

LAVENBERG, S. S. A simple analysis of exclusive and shared lock contention in a database system. In Proceedings of the ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems (Boston, Mass., Aug. 1984), 143-148.

Digital Library

[23]

LIN, W. K., AND NOLTE, J. Performance of two phase locking. In Proceedings of the 6th Berkeley Workshop on Distributed Data Management and Computer Networks (Berkeley, Calif., Feb. 1982), pp. 131-160.

[24]

MITRA, D. Probabilistic models and asymptotic results for concurrent processing with exclusive and non-exclusive locks. SIAM J. Comput. To be published.

[25]

MORRIS, R. J. T., AND WONG, W.S. Performance analysis of locking and optimistic concurrency control algorithms. Tech. Rep., AT&T Bell Lab.

[26]

MUNZ, R., AND KRENZ, G. Concurrency in database systems--A simulation study, in Proceedings of the A CM SIGMOD International Conference on Management of Data (Toronto, Can., Aug. 1977), pp. 111-120.

Digital Library

[27]

POTIER, D., AND LEBLANC, PH. Analysis of locking policies in database management systems. Commun. ACM 23, 10 {Oct. 1980), 584-593.

Digital Library

[28]

RIES, D.R. The effects of concurrency control on database management system performance. Ph.D. Dissertation (UCB/ERL M79/20), University of California, Berkeley, Calif., Apr. 1979.

Digital Library

[29]

Rvu, I. K., AND THOMASIAN, A. Analysis of database performance with dynamic locking. In preparation.

[30]

SEVClK, K.C. Comparison of concurrency control methods using analytic models. In in{o. Proc. 83, R. E. A. Mason, Ed. North-Holland, Amsterdam, 1983, pp. 847-858.

[31]

SHUM, A. W., AND SP|RAKIS, P.G. Performance analysis of concurrency control methods in database systems. Performance 81, F. J. Kylstra, Ed. North-Holland, Amsterdam, 1981, pp. 1- 19.

[32]

SURI, R., AND DIEHL, G.W. A variable buffer-size model and its use in analyzing closed queuing networks with blocking. Submitted for publication.

[33]

TAY, Y. C. A mean value performance model for locking in databases. Ph.D. Dissertation, Harvard Univ., Cambridge, Mass., Feb. 1984.

Digital Library

[34]

TAY, Y. C., GOODMAN, N., AND SUm, R. Performance evaluation of locking in databases: A survey. Tech. Rep. TR 17-84, Aiken Computation Lab., Harvard Univ., Cambridge, Mass., Oct. 1984.

[35]

TAY, Y. C., Sum, R., AND GOODMAN, N. A mean value performance model for locking in databases: The no waiting case. J. ACM 32, 3 (July 1985), 618-651.

Digital Library

[36]

THOMAS|AN, A. An iterative solution to the queuing network model of a DBMS with dynamic locking. In Proceedings of the 13th Computer Measurement Group Conference (San Diego, Calif., Dec. 1982), pp. 252-261.

[37]

THOMASIAN, A., AND RVU, I.K. A decomposition solution to the queuing network model of the centralized DBMS with static locking. In Proceedings of the ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems (Minneapolis, Minn., Aug. 1983), pp. 82-92.

Digital Library

[38]

YAO, S.B. Approximating block accesses in database organization. Commun. ACM 20, 4 (Apr. 1977), 260-261.

Digital Library

Cited By

Sanzo PQuaglia F(2023)On the Effects of Transaction Data Access Patterns on Performance in Lock-Based Concurrency ControlIEEE Transactions on Computers10.1109/TC.2022.322208472:6(1718-1732)Online publication date: 1-Jun-2023
https://dl.acm.org/doi/10.1109/TC.2022.3222084
(2022)BibliographyStorage Systems10.1016/B978-0-32-390796-5.00023-1(641-693)Online publication date: 2022
https://doi.org/10.1016/B978-0-32-390796-5.00023-1
Thomasian A(2022)IntroductionStorage Systems10.1016/B978-0-32-390796-5.00010-3(1-87)Online publication date: 2022
https://doi.org/10.1016/B978-0-32-390796-5.00010-3
Show More Cited By

Index Terms

Locking performance in centralized databases

Recommendations

Design and performance analysis of locking algorithms for distributed databases
Performance Evaluation of Centralized Databases with Static Locking

The performance of transaction processing systems is determined by the contention for hardware as well as software resources (database locks), due to the concurrency control mechanism of the database being accessed by transactions. We consider a ...
Pre-analysis locking: a safe and deadlock free locking policy
VLDB '85: Proceedings of the 11th international conference on Very Large Data Bases - Volume 11

A safe and deadlock free lock policy is introduced, called pre-analysis locking. Pre-analysis locking is based on an efficient geometric algorithm which inserts lock and unlock operations into the transactions. Pre-analysis locking is the first safe and ...

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Database Systems

ACM Transactions on Database Systems Volume 10, Issue 4

Dec. 1985

189 pages

ISSN:0362-5915

EISSN:1557-4644

DOI:10.1145/4879

Issue’s Table of Contents

Copyright © 1985 ACM.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 December 1985

Published in TODS Volume 10, Issue 4

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

193
Total Citations
View Citations
1,483
Total Downloads

Downloads (Last 12 months)352
Downloads (Last 6 weeks)24

Reflects downloads up to

Other Metrics

View Author Metrics

Citations

Cited By

Sanzo PQuaglia F(2023)On the Effects of Transaction Data Access Patterns on Performance in Lock-Based Concurrency ControlIEEE Transactions on Computers10.1109/TC.2022.322208472:6(1718-1732)Online publication date: 1-Jun-2023
https://dl.acm.org/doi/10.1109/TC.2022.3222084
(2022)BibliographyStorage Systems10.1016/B978-0-32-390796-5.00023-1(641-693)Online publication date: 2022
https://doi.org/10.1016/B978-0-32-390796-5.00023-1
Thomasian A(2022)IntroductionStorage Systems10.1016/B978-0-32-390796-5.00010-3(1-87)Online publication date: 2022
https://doi.org/10.1016/B978-0-32-390796-5.00010-3
Magalhaes AMonteiro JBrayner A(2021)Main Memory Database RecoveryACM Computing Surveys10.1145/344219754:2(1-36)Online publication date: 5-Mar-2021
https://dl.acm.org/doi/10.1145/3442197
Pandey SShanker U(2020)Transaction scheduling protocols for controlling priority inversion: A reviewComputer Science Review10.1016/j.cosrev.2019.10021535(100215)Online publication date: Feb-2020
https://doi.org/10.1016/j.cosrev.2019.100215
Tay Y(2018)Analytical Performance Modeling for Computer Systems, Third EditionSynthesis Lectures on Computer Science10.2200/S00859ED3V01Y201806CSL0107:1(1-171)Online publication date: 23-Jul-2018
https://doi.org/10.2200/S00859ED3V01Y201806CSL010
Jepsen Tde Sousa LMoshref MPedone FSoulé R(2018)Infinite Resources for Optimistic Concurrency ControlProceedings of the 2018 Morning Workshop on In-Network Computing10.1145/3229591.3229597(26-32)Online publication date: 7-Aug-2018
https://dl.acm.org/doi/10.1145/3229591.3229597
Castro DRomano PDidona DZwaenepoel W(2017)An Analytical Model of Hardware Transactional Memory2017 IEEE 25th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS)10.1109/MASCOTS.2017.29(221-231)Online publication date: Sep-2017
https://doi.org/10.1109/MASCOTS.2017.29
Suh YSnodgrass RCurrim S(2017)An empirical study of transaction throughput thrashing across multiple relational DBMSesInformation Systems10.1016/j.is.2016.12.00466:C(119-136)Online publication date: 1-Jun-2017
https://dl.acm.org/doi/10.1016/j.is.2016.12.004
Begin TBoukerche ALassous IBarba CRazafindralambo T(2016)A Note on the Causes Degrading Communication between RSUs and Vehicles in Overloaded ConditionsProceedings of the 13th ACM Symposium on Performance Evaluation of Wireless Ad Hoc, Sensor, & Ubiquitous Networks10.1145/2989293.2989298(27-31)Online publication date: 13-Nov-2016
https://dl.acm.org/doi/10.1145/2989293.2989298
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

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

Full Access

Get this Article

Media

Figures

Other

Tables

View Issue’s Table of Contents