article

Free access

On the analytical modeling of database concurrency control

Authors:

Daniel M. Dias,

Stephen S. LavenbergAuthors Info & Claims

Journal of the ACM (JACM), Volume 40, Issue 4

Pages 831 - 872

https://doi.org/10.1145/153724.153733

Published: 01 September 1993 Publication History

Abstract

The Concurrency Control (CC) scheme employed can profoundly affect the performance of transaction-processing systems. In this paper, a simple unified approximate analysis methodology to model the effect on system performance of data contention under different CC schemes and for different system structures is developed. This paper concentrates on modeling data contention and then, as others have done in other papers, the solutions of the data contention model are coupled with a standard hardware resource contention model through an iteration. The methodology goes beyond previously published methods for analyzing CC schemes in terms of the generality of CC schemes and system structures that are handled. The methodology is applied to analyze the performance of centralized transaction processing systems using various optimistic- and pessimistic-type CC schemes and for both fixed-length and variable-length transactions. The accuracy of the analysis is demonstrated by comparison with simulations. It is also shown how the methodology can be applied to analyze the performance of distributed transaction-processing systems with replicated data.

References

[1]

~BARBARA, D., AND GARCIA-MOLINA, H. HOW expensive is data replication? An example. In ~Proceedmgs of the 2nd Intemattonal Conference on Dtstrlbuted Computing ~~'stems (Feb.) IEEE ~Computer Society Press, Los Alamltos, Cahf., 1982, pp. 263 268

[2]

~BERNSTEIN, P. A., HADZILACOS, V., AND GOODMAN, N. ConcttlTencv Control and Recoce~~ tn ~Database Systems. Addison-Wesley, Reading, Mass., 1987

[3]

~BOKSENBAUM, C., CART, M., FERRIE, J., AND PONS, J.-F. Concurrent certifications by ~intervals of timestamps in distributed database systems. IEEE Trans. Sofiw. Eng. SE-13, 4 ~(Apr. 1987), 409-419.

[4]

~CAREY, M. J., AND LIVNY, M Distributed concurrency control performance: A study of ~algorithms, distribution, and replication. In Proceedings of the 14th Annual Conference on I, Tety ~Large Data Bases. Morgan Kaufmann, San Mateo, Cahf., 1988, pp 13 25.

[5]

~CELLARY, W., GELENBE, E., AND TADEUSZ, M. ConcurrenO, Con~rol Itl Dzstnbuted Database ~&'stems. North-Holland, Amsterdam, The Netherlands, 1988.

[6]

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

[7]

~CICIANI, B., DIAS, m. M., IYER, B. R, AND YU, P.S. m hybrid distributed centralized system ~structure for transaction processing. 1EEE Trans. Softw. Eng. SE-}6, 8 (199(I), 791 8(/6.

[8]

~CICIANI, m., DiAS, D. M., AND YU, P.S. Analysis of concurrency-coherency control protocols ~for distributed transaction processing systems with regional locality. 1EEE Trans. Sofiw. Eng. ~SE-18, 10 (Oct. 1992), 889 914.

[9]

~CICIANI, B., DIAS, D. M., AND YU, P. S. Analysis of replication m distributed database ~systems. IEEE Trans. Knowledge Data Eng. 2, 2 (June 1990), 247-261.

[10]

~}CORNELL, D. W., DIAS, D. M, AND YU, P. S. On multisystem couphng through functlon ~request shipping. IEEE Trans. So~tw. Eng. SE-}2, 10 (Oct. 1986), 1006-1017.

[11]

~DAN, A., DIAS, D. M., AND YU, P.S. The effect of skewed data access on buffer hits and data ~contention m a data sharing environment. In Proceedings of the }6th Internanonal Conference ~on Very La~e Databases (Brisbane, Australia, Aug.). Morgan Kaufmann, San Mateo, Calif, ~1990, pp. 419-431.

[12]

~DAN, A., TOWSLEY, D. F., AND KOHLER, W.H. Modeling the effects of data and resource ~contention on the performance of optimistic concurrency control protocols. In Proceedtng~ of ~the 4th International Conference on Data Engineering (Los Angeles, Calif., Feb.). IEEE ~Computer Society Press, Los Alamitos, Calif., 1988, pp. 418-425.

[13]

~DATB, C.J. /In Introducuon to Database S~wtems. Vol. 2. Addison-Wesley, Reading, Mass., ~1983.

[14]

~DIAS, D. M., IYER, B. R, AND YU, P. S. Trade-offs between coupling small and large ~processors for transaction processing. IEEE Trans. Compttt. 37, 3 (Mar. 1988), 310-320.

[15]

~DIAS, D. M., Yu, P. S, AND BENNE'rT, B.T. On centralized versus geographically distributed ~database systems. In Proceedings of the 7th htternational Conference on Distributed Computing ~&'stems (Berlin, West Germany, Sept.). IEEE Computer Society Press, Los Alamitos, Calif., ~1987, pp. 64 71.

[16]

~FRANASZEK, P. A., ~,ND ROBINSON, J. T Limitations of concurrency m transactions process- ~lng. ACM Trans. Datab. Syst. 10, 1 (Mar. 1985), 1-28.

[17]

~FRANASZEK, P. A., ROBINSON, J. T. AND THOMASIAN, A. Access invanance and its use in ~high contention environments. In Proceedings of the 6th Intemauonal Conference on Data ~Engmeertng (Los Angeles, Calif.). IEEE Computer Society Press, Los Alamitos, Calif., 1990, ~pp. 47-55.

[18]

~FRANASZEK, P. A., ROBINSON, J. T., AND THOMASIAN, A. Wait depth limited concurrency ~control. In Proceedings of the 7th International Conference on Data Engineoing (Kobe, Japan). ~IEEE Computer Society Press, Los Alamitos, Calif., 1991, pp. 92-101.

[19]

~GARCIA-MOLINA, H. Performance of update algorithms for replicated data in a distributed ~database. Ph.D. dissertation. Computer Science Dept., Stanford Univ., Stanford, Calif., June ~1979.

[20]

~GRAY, J. N. An approach to decentralized computer systems. IEEE Trans. Softiv. Eng. ~SE-12, 6 (June 1986), 684-692.

[21]

~GRAY, J., HOMAN, P., OBERMARCK, R., AND KORTH, H. A straw man analysis of probability ~of waiting and deadlock. IBM Res. Rep. RJ 3066. IBM, Yorktown Heights, N.Y., 1981.

[22]

~HARTZMAN, C.S. The delay due to dynamic two-phase locking. IEEE Trans. Soft. Eng. 15, 1 ~(Jan. 1989), 72-82.

[23]

~Hsu, M., AND SHANG, g. Modeling performance impact of hotspots. Tech. Rep. TR-08-88. ~Aiken Computation Laboratory, Harvard University, Cambridge, Mass., Apr. 1988.

[24]

~IYER, B.R. Limits in transaction throughput--Why big is better. IBM Res. Rep. RJ 6584. ~IBM, Yorktown Heights, N.Y., Nov. 1988.

[25]

~KUNG, n. T., AND ROBINSON, J.T. On optimistic methods for concurrency control. ACM ~Trans. Datab. Syst. 6, 2 (June 1981), 213-226.

[26]

~LAVENBERG, S. S. (ED.) Computer Perfornzance Modehng Handbook. Academic Press, Or- ~lando, Fla., 1983.

[27]

~MENASCE, m. A., AND NAKANISHI, T. Performance evaluation of a two-phase commit based ~protocol for DDBs. In Proceedmgs of the ACM Symposium oil Principles of Database Systems ~(Los Angeles, Calif., Mar. 29-31). ACM, New York, 1982, pp. 247-255.

[28]

~MORRIS, R. J. T., AND WONG, W. S. Performance analysis of locking and optimistic ~concurrency control algorithms. Pelf. Et,al. 5 (1985), 105-t18.

[29]

~ROSENKRANTZ, D. J., STEARNS, R. E., AND LEWIS, P. M., II System level concurrency control ~for distributed database systems. ACM Trans. Datab. Syst. 3, 2 (June 1978), 178 198.

[30]

~RYU, I. K., AND THOMASIAN, A. Performance analysis of centralized databases with opti- ~mistic concurrency control. Pelf. EL,al. 7 (1987), 195-211.

[31]

~SEVCm, K. C. Comparison of concurrency control methods using analytic models. In ~Information Processing 83, R. E. A. Mason, ed. North-Holland, Amsterdam, The Netherlands, ~1983, pp. 847-858.

[32]

~SINGHAL, M., AND YESHA, Y. A polynomial algorithm for computation of the probability of ~conflicts in a database under arbitrary data access distribution. Inf. Proc. Lett. 27, 2 (Feb. ~1988), 69 74.

[33]

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

[34]

~TAY, Y.C. Issues in modelling locking performance. In Stochastic Analysis of Computer and ~Communication Systems, H. Takagi, ed. North-Holland, Amsterdam, The Netherlands, 1990, ~pp. 631 655.

[35]

~TAY, Y. C., GOODMAN, N., AND SURI, R. Locking performance in centralized databases. ~ACM D'ans. Datab. Syst. 10, 4 (Dec. 1985), 415-462.

[36]

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

[37]

~THANOS, C., BERTINO, C., AND CARLESI, C. The effects of two-phase locking on the ~performance of a distributed database management system. Peq'. Et,aI. 8 (1988), 129-157.

[38]

~THOMASIAN, A. An iterative solution to the queueing network model of a DBMS with ~dynamic locking. In Proceedmgsof the 13th CMG Conference. Computer Measurement Group, ~Alexandria, Va., 1982, pp. 252 261.

[39]

~THOMASIAN, A., AND RYU, I. K. Analysis of some optimistic concurrency control schemes ~based on certification. Perf. Ecal. Ret,. 13, 2 (Proceedings of 1985 ~4CM S1GMETRICS), pp. ~192-203.

[40]

~THOiVlASIAN, A., AND RYU, I. K. Performance analysis of two-phase locking. IEEE T~:rms. ~Softw. Eng. 17, 5 (May 1991), 386-401.

[41]

~Yu, P. ~5., AND DIAS, D.M. Fertormance analysib of optimistic concurrency control achcmca ~for systems with large memory. IBM Res. Rep. RC 13976. IBM, Yorktown Heights, N.Y., ~Mar. 1988.

[42]

~Yu, P. S., AND DIAS, D. M. Concurrency control using locking with deferred blocking. In ~Proceedmgs oJ the 6th International Conj'krence on Data Engineering (Los Angeles, Calif.). IEEE ~Computer Society Press, Los Alamltos, Calif. 1990, pp. 30-36.

[43]

~Yu, P. S., AND DIAS, D.M. Analysis of hybrid concurrency control schemes for a high data ~contention environment. IEEE Trans. Sofiw. Eng. 18, 2 (Feb. 1992), 118-129.

[44]

~Yu, P. S., D~AS, D. M., CORNELL, D. W., AND IYER, B.R. Analysis of affinity based routing in ~multi-system data sharing. Perf. Et;al. 7, 2 (June 1987), 87-109.

[45]

~Yu, P. S., DIAS, D. M., ROBINSON, J. T., IYER, g. R., AND CORNELL, D. W. Modelhng of ~centralized concurrency control in a multi-system environment. Perf. ~vaL Rec. 13, 2 ~(Proceedings of 1985 ACM SIGMETR1CS), 183-191.

[46]

~Yu, P. S., alAS, D. M., ROBINSON, J. T., IYER, m. R., AND CORNELL, D.W. On coupling ~multi-systems through data sharing. Proc. IEEE 75, 5 (May 1987l, 573 587

[47]

~Yu, P. S., HEISS, H., AND DIAS, D.M. Modelling and analys~s of a time-stamp history based ~certification protocol for concurrency control. IEEE Trans. Knowl. Data Eng. 3, 4 (Dec. ~1991), 525 537.

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
Waudby JEzhilchelvan PMitrani IWebber J(2022)A Performance Study of Epoch-based Commit Protocols in Distributed OLTP Databases2022 41st International Symposium on Reliable Distributed Systems (SRDS)10.1109/SRDS55811.2022.00026(189-200)Online publication date: Sep-2022
https://doi.org/10.1109/SRDS55811.2022.00026
Pandey SShanker U(2022)RAPID: A real time commit protocolJournal of King Saud University - Computer and Information Sciences10.1016/j.jksuci.2020.04.00634:6(2916-2925)Online publication date: Jun-2022
https://doi.org/10.1016/j.jksuci.2020.04.006
Show More Cited By

Index Terms

On the analytical modeling of database concurrency control

Recommendations

Multiversion Cautious Schedulers for Database Concurrency Control

Let MC stand for a class of logs (i.e. sequences of read/write steps of transactions) that are serializable when multiple versions of the data items are maintained. The multiversion cautious scheduler, MCS(MC) which is introduced, outputs a sequence ...
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 ...
Optimistic concurrency control algorithms for distributed database systems

Comments

Information & Contributors

Information

Published In

cover image Journal of the ACM

Journal of the ACM Volume 40, Issue 4

Sept. 1993

200 pages

ISSN:0004-5411

EISSN:1557-735X

DOI:10.1145/153724

Issue’s Table of Contents

Copyright © 1993 ACM.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 September 1993

Published in JACM Volume 40, 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

63
Total Citations
View Citations
882
Total Downloads

Downloads (Last 12 months)73
Downloads (Last 6 weeks)14

Reflects downloads up to 30 Aug 2024

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
Waudby JEzhilchelvan PMitrani IWebber J(2022)A Performance Study of Epoch-based Commit Protocols in Distributed OLTP Databases2022 41st International Symposium on Reliable Distributed Systems (SRDS)10.1109/SRDS55811.2022.00026(189-200)Online publication date: Sep-2022
https://doi.org/10.1109/SRDS55811.2022.00026
Pandey SShanker U(2022)RAPID: A real time commit protocolJournal of King Saud University - Computer and Information Sciences10.1016/j.jksuci.2020.04.00634:6(2916-2925)Online publication date: Jun-2022
https://doi.org/10.1016/j.jksuci.2020.04.006
Pandey SShanker U(2022)STEP: A Concomitant Protocol for Real Time ApplicationsWireless Personal Communications: An International Journal10.1007/s11277-021-09112-9122:4(3795-3832)Online publication date: 1-Feb-2022
https://dl.acm.org/doi/10.1007/s11277-021-09112-9
Hepsiba PGrace Mary Kanaga E. (2020)An Osmosis-Based Intelligent Agent Scheduling Framework for Cloud Bursting in a Hybrid CloudInternational Journal of Distributed Systems and Technologies10.4018/IJDST.202007010411:3(68-88)Online publication date: 1-Jul-2020
https://dl.acm.org/doi/10.4018/IJDST.2020070104
Zamanian EShun JBinnig CKraska TMaier DPottinger RDoan ATan WAlawini ANgo H(2020)Chiller: Contention-centric Transaction Execution and Data Partitioning for Modern NetworksProceedings of the 2020 ACM SIGMOD International Conference on Management of Data10.1145/3318464.3389724(511-526)Online publication date: 11-Jun-2020
https://dl.acm.org/doi/10.1145/3318464.3389724
Di Sanzo PPellegrini ASannicandro MCiciani BQuaglia F(2020)Adaptive Model-Based Scheduling in Software Transactional MemoryIEEE Transactions on Computers10.1109/TC.2019.295413969:5(621-632)Online publication date: 1-May-2020
https://doi.org/10.1109/TC.2019.2954139
Economo SSilvestri EDi Sanzo PPellegrin AQuaglia F(2018)Model-Based Proactive Read-Validation in Transaction Processing Systems2018 IEEE 24th International Conference on Parallel and Distributed Systems (ICPADS)10.1109/PADSW.2018.8644605(481-488)Online publication date: Dec-2018
https://doi.org/10.1109/PADSW.2018.8644605
Di Sanzo P(2017)Analysis, Classification and Comparison of Scheduling Techniques for Software Transactional MemoriesIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2017.274028528:12(3356-3373)Online publication date: 1-Dec-2017
https://dl.acm.org/doi/10.1109/TPDS.2017.2740285
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
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