Ordered shared locks for real-time databases

  • Authors:

  • Divyakant Agrawal;Amr El Abbadi;Richard Jeffers;Lijing Lin

  • Affiliations:

  • University of California, Santa Barbara, CA;University of California, Santa Barbara, CA;Tandem Computers, Inc.;Digital Media International, Santa Barbara, CA

  • Venue:
  • The VLDB Journal — The International Journal on Very Large Data Bases
  • Year:
  • 1995

Quantified Score

Hi-index 0.00

Visualization

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 significantly reduce the percentage of missed deadlines in the system for a variety of workloads.