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

  • Authors:
  • Dag Nystrom;Mikael Nolin;Aleksandra Tesanovic;Christer Norstrom;Jorgen Hansson

  • Affiliations:
  • Mälardalen University;Mälardalen University;Linköping University;Mälardalen University;Linköping University

  • Venue:
  • ECRTS '04 Proceedings of the 16th Euromicro Conference on Real-Time Systems
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

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