Real-time transaction scheduling

TLDR

Real‑time databases are critical in embedded systems, requiring transactions to satisfy both consistency and timing constraints, yet existing methods ignore the dynamic cost of scheduling. This work proposes a cost‑conscious real‑time transaction scheduling algorithm that accounts for dynamic transaction costs. The algorithm employs a dynamic priority assignment that adapts to system load changes while minimizing transaction restarts. Simulations demonstrate that the algorithm outperforms the EDF‑HP baseline.

Abstract

Real-time databases are an important component of embedded real-time systems. In a real-time database context, transactions must not only maintain the consistency constraints of the database but must also satisfy the timing constraints specified for each transaction. Although several approaches have been proposed to integrate real-time scheduling and database concurrency control methods, none of them take into account the dynamic cost of scheduling a transaction. In this paper, we propose a new cost conscious real-time transaction scheduling algorithm which considers dynamic costs associated with a transaction. Our dynamic priority assignment algorithm adapts to changes in the system load without causing excessive numbers of transaction restarts. Our simulations show its superiority over EDF-HP algorithm.