Using Dynamic Adjustment of Serialization Order for Real-Time Database Systems

Studies in [7,8, 91 concluded that for a variety of reasons, optimistic concurrency control appears well-suited to real-time database systems. Especially, they showed that in a real-time database system that discards tardy transactions, optimistic concurrency control outperforms locking.In thispaper, we show that the optimistic algorithms used in those studies incur restarts unnecessary to ensure data consistency. We present a new optimistic concurrency control algorithm that can avoid such unnecessary restarts by adjusting serialization order dynamically, and demonstrate that the new algorithm outperforms the previous ones over a wide range of system workload.It appears that this algorithm is a promising candidate for basic concurrency control mechanismfor real-timedatabase systems.

• Type: Conference
• Year: 1993
• Where: RTSS
• Authors: Juhnyoung Lee, Sang Hyuk Son
• Keywords: Control Systems, Optimistic Concurrency Control, Real-time Database, RTSS 1993, Studies Incur Restarts