Priority and deadline assignment to triggered transactions in distributed real-time active databases
Ivfanaging transactions with real-time requirements presents many new problems. In this paper we focus on two: How can we schedule transactions with deadlines? How do the real-time constraints affect concurrency control? We describe a new group of algorithms for scheduling real-time transactions which produce serialixable schedules. We present a model for scheduling tmnsactions with deadlines on a single processor memory resident database system, and evaluate the scheduliing through detailed simulation experiments.