Using Delayed Commitment in Locking Protocols for Real-Time Databases

D. Agrawal, A. El Abbadi, R. Jeffers

Research output: Contribution to journalArticle

19 Citations (Scopus)

Abstract

In this paper, we propose locking protocols that are useful for real-time databases. Our approach is motivated from two main observations. 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 commitment. Since in real-time databases, timeliness and not response time is the crucial factor, or 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 propose protocols significantly reduce the percentage of missed deadlines in the system for a variety of workloads.

Original languageEnglish
Pages (from-to)104-113
Number of pages10
JournalSIGMOD Record
Volume21
Issue number2
DOIs
Publication statusPublished - 6 Jan 1992
Externally publishedYes

Fingerprint

Degradation
Experiments

ASJC Scopus subject areas

  • Information Systems
  • Software

Cite this

Using Delayed Commitment in Locking Protocols for Real-Time Databases. / Agrawal, D.; El Abbadi, A.; Jeffers, R.

In: SIGMOD Record, Vol. 21, No. 2, 06.01.1992, p. 104-113.

Research output: Contribution to journalArticle

Agrawal, D. ; El Abbadi, A. ; Jeffers, R. / Using Delayed Commitment in Locking Protocols for Real-Time Databases. In: SIGMOD Record. 1992 ; Vol. 21, No. 2. pp. 104-113.
@article{04a738a7c14b43b6838ccd1f85fe4a28,
title = "Using Delayed Commitment in Locking Protocols for Real-Time Databases",
abstract = "In this paper, we propose locking protocols that are useful for real-time databases. Our approach is motivated from two main observations. 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 commitment. Since in real-time databases, timeliness and not response time is the crucial factor, or 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 propose protocols significantly reduce the percentage of missed deadlines in the system for a variety of workloads.",
author = "D. Agrawal and {El Abbadi}, A. and R. Jeffers",
year = "1992",
month = "1",
day = "6",
doi = "10.1145/141484.130304",
language = "English",
volume = "21",
pages = "104--113",
journal = "SIGMOD Record",
issn = "0163-5808",
publisher = "Association for Computing Machinery (ACM)",
number = "2",

}

TY - JOUR

T1 - Using Delayed Commitment in Locking Protocols for Real-Time Databases

AU - Agrawal, D.

AU - El Abbadi, A.

AU - Jeffers, R.

PY - 1992/1/6

Y1 - 1992/1/6

N2 - In this paper, we propose locking protocols that are useful for real-time databases. Our approach is motivated from two main observations. 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 commitment. Since in real-time databases, timeliness and not response time is the crucial factor, or 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 propose protocols significantly reduce the percentage of missed deadlines in the system for a variety of workloads.

AB - In this paper, we propose locking protocols that are useful for real-time databases. Our approach is motivated from two main observations. 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 commitment. Since in real-time databases, timeliness and not response time is the crucial factor, or 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 propose protocols significantly reduce the percentage of missed deadlines in the system for a variety of workloads.

UR - http://www.scopus.com/inward/record.url?scp=84976698754&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84976698754&partnerID=8YFLogxK

U2 - 10.1145/141484.130304

DO - 10.1145/141484.130304

M3 - Article

VL - 21

SP - 104

EP - 113

JO - SIGMOD Record

JF - SIGMOD Record

SN - 0163-5808

IS - 2

ER -