Sang H. Son and Seog Park*
Department of Computer Science
University of Virginia
Charlottesville, Virginia 22903, USA.
*Department of Computer Science
Database systems for real-time applications must satisfy timing constraints associated with transactions, in addition to maintaining the consistency of data. In this paper, we propose a priority-based scheduling algorithm for real-time database systems. We show that this algorithm is deadlock-free, and in addition, that a high priority transaction is not blocked by uncommitted lower priority transactions. The algorithm does not assume any knowledge about the data requirements or the execution time of each transaction. This makes the algorithm widely applicable since in many actual environments such information may not be readily available.
Keywords: real-time, scheduling, concurrency, deadline, transaction
Received August 3, 1993; revised August 31, 1994.
Communicated by Wei-Pang Yang.