A mean value performance model for locking in databases: the waiting case

Authors:
Y. C. Tay;R. Suri;N. Goodman
Affiliations:
Harvard University and National University of Singapore;Harvard University;Boston University
Venue:
PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
Year:
1984

Citing 10
Cited 2

A variable buffer-size model and its use in analyzing closed queueing networks with blocking

Management Science
On the modeling of parallel access to shared data

Communications of the ACM
Concurrency in database systems: a simulation study

SIGMOD '77 Proceedings of the 1977 ACM SIGMOD international conference on Management of data
Queueing network models for concurrent transaction processing in a database system

SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
A simple analytic model for performance of exclusive locking in database systems

PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
Some Results on Database Locking: Solutions, Computational Algorithms and Asymptotics

Proceedings of the International Workshop on Computer Performance and Reliability
A Transaction Model

Proceedings of the 7th Colloquium on Automata, Languages and Programming
Notes on Data Base Operating Systems

Operating Systems, An Advanced Course
Why control of the concurrency level in distributed systems is more fundamental than deadlock management

PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Performance analysis of distributed database systems

Performance analysis of distributed database systems

A mean value performance model for locking in databases: the no-waiting case

Journal of the ACM (JACM)
Performance and resource modeling in highly-concurrent OLTP workloads

Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data

Quantified Score

Hi-index	0.00

Visualization

Abstract

An earlier paper introduced a simple performance model for studying the behaviour of locking. That paper treats a highly simplified form of locking, called the no waiting case, in which transactions restart when they request locks that are already held by others. This analysis is now extended to the more realistic waiting case, in which transactions are allowed to wait for conflicting locks, and restart only if there is a deadlock. The analysis begins with a system that has uniform access and exclusive locks only. The model's predictions for this base system agree well with simulation results. Next, a system with nonuniform access and another with shareable locks are each shown to be reducible to the base system. A comparison of the waiting and no waiting cases yields a surprising result: the throughput for the no waiting case is often better than for the waiting case, and never much worse.