Ordered shared locks for real-time databases

Divyakant Agrawal, Amr El Abbadi, Richard Jeffers, Lijing Lin

Research output: Contribution to journalArticle

18 Citations (Scopus)

Abstract

We propose locking protocols for real-time databases. Our approach has two main motivations: First, locking protocols are widely accepted and used in most database systems. Second, in real-time databases it has been shown that the blocking behavior of transactions in locking protocols results in performance degradation. We use a new relationship between locks called ordered sharing to eliminate blocking that arises in the traditional locking protocols. Ordered, sharing eliminates blocking of read and write operations but may result in delayed termination. Since timeliness and not response time is the crucial factor in real-time databases, our protocols exploit this delay to allow transactions to execute within the slacks of delayed transactions. We compare the performance of the proposed protocols with the two-phase locking protocol for real-time databases. Our experiments indicate that the proposed protocols for real-time databases. Our experiments indicate that the proposed protocols significantly reduce the percentages, of missed deadlines in the system for a variety of workloads.

Original languageEnglish
Pages (from-to)87-126
Number of pages40
JournalThe VLDB Journal
Volume4
Issue number1
DOIs
Publication statusPublished - 1 Jan 1995
Externally publishedYes

    Fingerprint

Keywords

  • Concurrency control
  • time-critical scheduling
  • transaction management

ASJC Scopus subject areas

  • Information Systems
  • Hardware and Architecture

Cite this

Agrawal, D., El Abbadi, A., Jeffers, R., & Lin, L. (1995). Ordered shared locks for real-time databases. The VLDB Journal, 4(1), 87-126. https://doi.org/10.1007/BF01232473