Probabilistic Models of Database Locking: Solutions, Computational Algorithms, and Asymptotics
Journal of the ACM (JACM)
A mean value performance model for locking in databases: the no-waiting case
Journal of the ACM (JACM)
IEEE Transactions on Software Engineering
System level concurrency control for distributed database systems
ACM Transactions on Database Systems (TODS)
The serializability of concurrent database updates
Journal of the ACM (JACM)
Concurrency Control in Distributed Database Systems
ACM Computing Surveys (CSUR)
Analysis of locking policies in database management systems
Communications of the ACM
Choice and Performance in Locking for Databases
VLDB '84 Proceedings of the 10th International Conference on Very Large Data Bases
A decomposition solution to the queueing network model of the centralized DBMS with static locking
SIGMETRICS '83 Proceedings of the 1983 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Modeling and evaluation of database concurrency control algorithms
Modeling and evaluation of database concurrency control algorithms
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
The Performance of an Efficient Distributed Synchronization and Recovery Algorithm
The Journal of Supercomputing
Performance Modeling of Distributed and Replicated Databases
IEEE Transactions on Knowledge and Data Engineering
Performance Analysis of Distributed Deadlock Detection Algorithms
IEEE Transactions on Knowledge and Data Engineering
Asynchronous Operations in Distributed Concurrency Control
IEEE Transactions on Knowledge and Data Engineering
Non-blocking concurrency control in distributed database systems
PAS '95 Proceedings of the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis
High performance scientific and engineering computing
Distributed real time database systems: background and literature review
Distributed and Parallel Databases
| Hi-index | 14.98 |
A queueing model is used to approximate static locking in distributed database systems without deadlocks. Then a random graph model to find the deadlock probability of each transaction is proposed. Finally, the above two models are integrated, so that given the transaction arrival rate, the response time and the effective throughput can be calculated.