Concurrency Control Using Priority-Based Locking

Time~critical scheduling in real-time database systems has two components: real-time transaction level scheduling, which is similar to task scheduling in real - time operating systems, and concurrency control, which can be considered as operation level scheduling. Most current research in this area only focuses on the transaction scheduling part and rely on the existing classical non-real-time methods for concurrency control. In this paper, a new concurrency control protocol for real-time database systems is introduced, in which real~time scheduling and concurrency control are integrated. The method is purely priority-based and does not assume knowledge of any information about data requirements or execution time of each transaction. This makes the protocol suitable even for non-real~time conventional database systems.
Note: Abstract extracted from PDF file via OCR

Son, Sang, and Yi Lin. "Concurrency Control Using Priority-Based Locking." University of Virginia Dept. of Computer Science Tech Report (1990).