Optimistic Secure Real-Time Concurrency Control Using Multiple Data Version

  • Byeong-Soo Jeong
  • Daeho Kim
  • Sungyoung Lee
Conference paper

DOI: 10.1007/3-540-45245-1_3

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1985)
Cite this paper as:
Jeong BS., Kim D., Lee S. (2001) Optimistic Secure Real-Time Concurrency Control Using Multiple Data Version. In: Davidson J., Min S.L. (eds) Languages, Compilers, and Tools for Embedded Systems. Lecture Notes in Computer Science, vol 1985. Springer, Berlin, Heidelberg

Abstract

In many real time applications, security is an important requirement, since the system maintains sensitive information to be shared by multiple users with different security levels. A secure real-time database system must satisfy not only logical data consistency but also the timing constraints and security requirements associated with transactions. Even though an optimistic concurrency control method outperforms locking based methods in firm real-time database systems, in which late transactions are immediately discarded, existing secure real-time concurrency control methods are mostly based on locking. In this paper, we propose a new optimistic concurrency control protocol for secure real-time database systems. We also compare the performance characteristics of our protocol with locking based methods while varying workloads. The results show that optimistic concurrency control performs well over a wide range of system loading and resource availability conditions.,

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Byeong-Soo Jeong
    • 1
  • Daeho Kim
    • 1
  • Sungyoung Lee
    • 1
  1. 1.School of Electronics & InformationKyung Hee UniversityKorea

Personalised recommendations