Performance of concurrency control algorithms for real-time database systems

Juhnyoung Lee, Sang Hyuk Son · 1995

In this paper, we investigate the key components of a reasonable model of real-time database systems (RTDBSs), including the policy for dealing with tardy transactions, the availability of resources in the system, and the use of pre-knowledge about transaction processing requirement. We employ a fairly complete model of an RTDBS for studying the relative performance of locking and optimistic concurrency control protocols under a variety of operating conditions. In addition, we examine the issues on the implementation of concurrency control algorithms, which may have a significant impact on performance. We show that under a soft deadline system, the results of the relative performance of locking and optimistic approaches depend heavily on resource availability in the system as in conventional database systems. In the context of firm deadline systems, it is shown that an optimistic protocol outperforms a lockingbased protocol under a wide range of resource availability and system workloa...

Read the paper · More papers on PaperTik