Absolute and relative temporal constraints in hard real-time databases

Application of a conventional database to a hard realtime system requires two inter-related NP-complete problems to be solved: database concurrency control and task scheduling. Starting from temporal constraints on data objects in the database, the techniques described in this paper can be used to reduce the problem to a single NP-complete scheduling problem. Standard scheduling theory can then be applied.