By Topic

Pessimistic concurrency control and versioning to support database pointers in real-time databases

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
5 Author(s)
D. Nystrom ; Malardalen Real-Time Res. Centre, Malardalen Univ., Vasteras, Sweden ; M. Nolin ; A. Tesanovic ; C. Norstrdm
more authors

In this paper we present a concurrency control algorithm that allows co-existence of soft real-time, relational database transactions, and hard real-time database pointer transactions in real-time database management systems. The algorithm uses traditional pessimistic concurrency-control (i.e. locking) for soft transactions and versioning for hard transactions to allow them to execute regardless of any database lock. We provide formal proof that the algorithm is deadlock free and formally verify that transactions have atomic semantics. We also present an evaluation that demonstrates significant benefits for both soft and hard transactions when our algorithm is used. The proposed algorithm is suited for resource-constrained safety critical, real-time systems that have a mix of hard real-time control applications and soft real-time management, maintenance, or user-interface applications.

Published in:

Real-Time Systems, 2004. ECRTS 2004. Proceedings. 16th Euromicro Conference on

Date of Conference:

30 June-2 July 2004