Scheduling real-time transactions

Issues associated with transaction scheduling and concurrency control in real-time database systems are addressed. A message-based approach to prototyping study of distributed real-time database systems is introduced, and a prototyping software implemented for a series of experiments is presented. As a specific example of real-time transaction scheduling, a priority-based scheduling algorithm is discussed, together with a performance study using the prototyping environment. The results obtained suggest that priority ceiling protocol might be appropriate for real-time transaction scheduling since it is very stable over the wide range of transaction sizes, and, compared with the two-phase locking protocol, it reduces the number of deadline-missing transactions