论文信息 - A simple analysis of exclusive and shared lock contention in a database system

A simple analysis of exclusive and shared lock contention in a database system

We consider a probabilistic model of locking in a database system in which an arriving transaction is blocked and lost when its lock requests conflict with the locks held by currently executing transactions. Both exclusive and shared locks are considered. We derive a simple asymptotic expression for the probability of blocking which is exact to order 1/N where N is the number of lockable items in the database. This expression reduces to one recently derived by Mitra and Weinberger for the special case where all locks are exclusive.

Stephen S. Lavenberg

[1] Y. C. Tay,et al. A simple analytic model for performance of exclusive locking in database systems , 1983, PODS '83.

[2] Y. C. Tay,et al. A mean value performance model for locking in databases: the waiting case , 1984, PODS '84.

[3] Y. C. Tay,et al. A mean value performance model for locking in databases: the no-waiting case , 1985, JACM.

[4] Debasis Mitra,et al. Probabilistic Models of Database Locking: Solutions, Computational Algorithms, and Asymptotics , 1984, JACM.

[5] Erol Gelenbe,et al. On the modeling of parallel access to shared data , 1983, CACM.

[6] Debasis Mitra,et al. Some Results on Database Locking: Solutions, Computational Algorithms and Asymptotics , 1983, Computer Performance and Reliability.

[7] Arthur M. Langer,et al. The distribution of granule accesses made by database transactions , 1982, CACM.

[8] Debasis Mitra,et al. Probabilistic Models and Asymptotic Results for Concurrent Processing with Exclusive and Non-Exclusive Locks , 1985, SIAM J. Comput..

[9] Dominique Potier,et al. Analysis of locking policies in database management systems , 1980, CACM.