The authors suggest and measure an admission control prototype for RTDBS, in which a transaction is presented to the system as a pair of procedures: a primary task, and a recovery block. The performance necessities of the main task are not known a priori, whereas those of the recovery block are known a priori. Upon the submission of a transaction, an Admission Control Mechanism is applied to determine whether to admit or reject that transaction. Once admitted, a transaction is assured to finish executing before its deadline. A transaction is considered to have finished executing if exactly one of two things occurs: either its primary task is completed (successful commitment), or its recovery block is finished (safe termination).