Dynamic real-time optimistic concurrency control
- 1 January 1990
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
The authors (1990) have shown that in real-time database systems that discard late transactions, optimistic concurrency control outperforms locking. Although the optimistic algorithm used in that study, OPT-BC, did not factor in transaction deadlines in making data conflict resolution decisions, it still outperformed a deadline-cognizant locking algorithm. A discussion is presented of why adding deadline information to optimistic algorithms is a nontrivial problem, and some alternative methods of doing so are described. A new real-time optimistic concurrency control algorithm, WAIT-50, is presented that monitors transaction conflict states and gives precedence to urgent transactions in a controlled manner. WAIT-50 is shown to provide significant performance gains over OPT-BC under a variety of operating conditions and workloads.Keywords
This publication has 6 references indexed in Scilit:
- On being optimistic about real-time constraintsPublished by Association for Computing Machinery (ACM) ,1990
- Dynamic real-time optimistic concurrency controlPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1990
- Concurrency control performance modeling: alternatives and implicationsACM Transactions on Database Systems, 1987
- Optimistic versus pessimistic concurrency control mechanisms in database management systemsInformation Systems, 1982
- On optimistic methods for concurrency controlACM Transactions on Database Systems, 1981
- The notions of consistency and predicate locks in a database systemCommunications of the ACM, 1976