Scheduling transactions in real-time database systems

The author describes an efficient algorithm for determining the feasibility of a transaction with runtime linearly proportional to the number of lock requests in the transaction. The schedulability checker based on the game-board representation determines transaction schedulability one at a time (incrementally), and thus it also has linear runtime complexity once the checker is initialized. Given the current configuration of the database and the characteristics of the newly arrived transaction, the feasibility test can determine a priori whether the new transaction can be completed by its specified deadline. An example is presented which illustrates how the transaction feasibility checker and the runtime monitor work.<>