Dynamic real-time optimistic concurrency control

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...

Full description

Saved in:
Bibliographic Details
Published in[1990] Proceedings 11th Real-Time Systems Symposium pp. 94 - 103
Main Authors Haritsa, J.R., Carey, M.J., Livny, M.
Format Conference Proceeding
LanguageEnglish
Published IEEE Comput. Soc. Press 1990
Subjects
Availability
Concurrency control
Concurrent computing
Database systems
Delay
Optimization methods
Performance gain
Protocols
Real time systems
Timing
Online AccessGet full text

Cover

More Information
Summary: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.< >
ISBN:9780818621123
0818621125
DOI:10.1109/REAL.1990.128734