A Real-Time Locking Protocol

Lui Sha, Ragunathan Rajkumar, Sang Hyuk Son, Chun Hyon Chang

Research output: Contribution to journalArticle

Abstract

When a database system is used in a real-time application, the concurrency control protocol must not only satisfy the consistency of shared data but also observe the priorities of the transactions. This is because priority scheduling is a commonly used method. In this paper, we examine a prioritydriven two-phase lock protocol called the read/write priority ceiling protocol. We show that this protocol leads to freedom from mutual deadlock. In addition, a high-priority transaction can be blocked by lower priority transactions for at most the duration of a single embedded transaction. These properties can be used by schedulability analysis to guarantee that a set of periodic transactions using this protocol can always meet their deadlines. Finally, we examine the performance of this protocol for randomly arriving transactions using simulation studies.

Original languageEnglish (US)
Pages (from-to)793-800
Number of pages8
JournalIEEE Transactions on Computers
Volume40
Issue number7
DOIs
StatePublished - Jul 1991
Externally publishedYes

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture
  • Computational Theory and Mathematics

Fingerprint Dive into the research topics of 'A Real-Time Locking Protocol'. Together they form a unique fingerprint.

  • Cite this

    Sha, L., Rajkumar, R., Son, S. H., & Chang, C. H. (1991). A Real-Time Locking Protocol. IEEE Transactions on Computers, 40(7), 793-800. https://doi.org/10.1109/12.83617