Scheduling real-time transactions using priority

Abstract Compared with traditional databases, real-time database systems have a distinct feature: they must satisfy timing constraints associated with transactions. This requires that transactions in realtime database systems should be scheduled to consider both data consistency and timing constraints. The paper addresses the issues associated with transaction scheduling and concurrency control in real-time database systems. As a specific example of real-time transaction scheduling, a priority-based scheduling algorithm is discussed, together with a performance study using a database prototyping environment.