Executing serializable transactions within a hard real-time database system

Abstract

A number of factors contribute to delays in transaction execution. In a real-time database system, delays due to deadlocks, data accessing, and transaction commit must reduce to enable a transaction to complete successfully. In this report, a model of transaction execution is presented that permits execution and commit of any hard real-time transaction. The execution proceeds without the incidence of deadlock, or other blocking delays such as, due to denial of lock or commit approvals. The proposed technique is based on transaction classification and implementation of a precedence management scheme. The scheme provides an instantaneous execution opportunity to a serializable transaction within a hard real-time database system.