You are required to read and agree to the below before accessing a full-text version of an article in the IDE article repository.

The full-text document you are about to access is subject to national and international copyright laws. In most cases (but not necessarily all) the consequence is that personal use is allowed given that the copyright owner is duly acknowledged and respected. All other use (typically) require an explicit permission (often in writing) by the copyright owner.

For the reports in this repository we specifically note that

  • the use of articles under IEEE copyright is governed by the IEEE copyright policy (available at http://www.ieee.org/web/publications/rights/copyrightpolicy.html)
  • the use of articles under ACM copyright is governed by the ACM copyright policy (available at http://www.acm.org/pubs/copyright_policy/)
  • technical reports and other articles issued by M‰lardalen University is free for personal use. For other use, the explicit consent of the authors is required
  • in other cases, please contact the copyright owner for detailed information

By accepting I agree to acknowledge and respect the rights of the copyright owner of the document I am about to access.

If you are in doubt, feel free to contact webmaster@ide.mdh.se

Pessimistic Concurrency-Control and Versioning to Support Database Pointers in Real-Time Databases

Fulltext:


Authors:

Dag Nyström, Mikael Sjödin, Aleksandra Tesanovic , Christer Norström, Jörgen Hansson

Publication Type:

Conference/Workshop Paper

Venue:

The 16th Euromicro Conference on Real-Time Systems

Publisher:

IEEE Computer Society


Abstract

A method that allows co-existence of soft real-time, relational database transactions and hard real-time database-pointer transactions in real-time database management systems is presented. We propose a concurrency-control algorithm that uses traditional pessimistic concurrency-control (i.e., locking) for soft transactions, and uses versioning to allow hard transactions 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.

Bibtex

@inproceedings{Nystrom566,
author = {Dag Nystr{\"o}m and Mikael Sj{\"o}din and Aleksandra Tesanovic and Christer Norstr{\"o}m and J{\"o}rgen Hansson},
title = {Pessimistic Concurrency-Control and Versioning to Support Database Pointers in Real-Time Databases},
pages = {261--270},
month = {June},
year = {2004},
booktitle = {The 16th Euromicro Conference on Real-Time Systems},
publisher = {IEEE Computer Society},
url = {http://www.es.mdh.se/publications/566-}
}