Performance analysis of the basic timestamp ordering algorithm via Markov modeling
- 1 January 1991
- journal article
- Published by Elsevier in Performance Evaluation
- Vol. 12 (1) , 17-41
- https://doi.org/10.1016/0166-5316(91)90013-s
Abstract
No abstract availableThis publication has 16 references indexed in Scilit:
- A probabilistic analysis of a database systemACM SIGMETRICS Performance Evaluation Review, 1986
- Locking performance in centralized databasesACM Transactions on Database Systems, 1985
- Performance analysis of locking and optimistic concurrency control algorithmsPerformance Evaluation, 1985
- Probabilistic Models of Database LockingJournal of the ACM, 1984
- On the modeling of parallel access to shared dataCommunications of the ACM, 1983
- Optimistic versus pessimistic concurrency control mechanisms in database management systemsInformation Systems, 1982
- Concurrency Control in Distributed Database SystemsACM Computing Surveys, 1981
- A Survey of Techniques for Synchronization and Recovery in Decentralized Computer SystemsACM Computing Surveys, 1981
- Analysis of locking policies in database management systemsCommunications of the ACM, 1980
- Open, Closed, and Mixed Networks of Queues with Different Classes of CustomersJournal of the ACM, 1975