Real-time parallel processing for nested transactions

A real-time nested transaction model, based upon the concept of subtransactions, is presented. Moss's concept of nested database transactions, which is suitable for parallel and distributed computations, is extended to hard real-time systems by the addition of explicit timing constraints. Newly proposed Real-Time Nested Priority Ceiling Protocol prevents unbounded blocking and deadlock, and maintains the serializability of a set of hard real-time transactions. It can be verified that the Real-Time Nested Priority Ceiling Protocol prevents unbounded blocking and deadlock, and maintains the serializability of a set of hard real-time transactions, which are the necessary properties for a database model to be able to be analyzed for the real-time schedulability condition using rate-monotonic priority assignment.