Analysis of concurrency control protocols for real-time database systems

Cataloged from PDF version of article.This paper provides an approximate analytic solution method for evaluating the performance of concurrency control protocols developed for real-time database systems (RTDBSs). Transactions processed in a RTDBS are associated with timing constraints typically in the form of deadlines. The primary consideration in developing a RTDBS concurrency control protocol is the fact that satisfaction of the timing constraints of transactions is as important as maintaining the consistency of the underlying database. The proposed solution method provides the evaluation of the performance of concurrency control protocols in terms of the satisfaction rate of timing constraints. As a case study, a RTDBS concurrency control protocol, called High Priority, is analyzed using the proposed method. The accuracy of the performance results obtained is ascertained via simulation. The solution method is also used to investigate the real-time performance benefits of the High Priority over the ordinary Two-Phase Locking. © 1998 Elsevier Science Inc. All rights reserved

Approximate Analysis of Real-Time Database Systems

During the past few years, several studies have been made on the performance of real-time database systems with respect to the number of transactions that miss their deadlines. These studies have used either simulation models or database testbeds as their performance evaluation tools. We present here a preliminary analytical performance study of real-time transaction processing. Using a series of approximations, we derive simple closed-form solutions to reduced realtime database models. Although quantitatively approximate, the solutions accurately capture system sensitivity to workload parameters and indicate conditions under which performance bounds are achieved

Approximate Analysis of Real-Time Database Systems

During the past few years, several studies have been made on the performance of real-time database sys-tems with respect to the number of transactions that miss their deadlines. These studies have used either simulation models or database testbeds as their perfor-mance evaluation tools. We present here a prelimi-nary analytical performance study of real-time trans-action processing. Using a series of approximations, we derive simple closed-form solutions to reduced real-time database models. Although quantitatively approx-imate, the solutions accurately capture system sensi-tivity to workload parameters and indicate conditions under which performance bounds are achieved.