Performance of protocols based on locks with ordered sharing

D. Agrawal, A. El Abbadi, A. E. Lang

Research output: Contribution to journalArticle

18 Citations (Scopus)

Abstract

There is growing evidence that for a wide variety of database workloads and system configurations, locking-based concurrency control outperforms other types of concurrency control strategies. However, in the presence of increased data contention, locking protocols such as two-phase locking perform poorly. In this paper, we analyze a family of locking-based protocols that employ a new relationship between locks called ordered sharing. Using a centralized database simulation model, we demonstrate that these protocols exhibit comparable performance to that of traditional locking-based protocols when data contention is low, and they exhibit superior performance when data contention is high. Furthermore, we show that the performance of these protocols improves as resources become more plentiful. This is particularly significant because the performance of tw o-phase locking degrades as a result of data contention, not resource contention. Thus, introducing additional resources improves the performance of the proposed protocols, though it does not benefit two-phase locking significantly.

Original languageEnglish
Pages (from-to)805-818
Number of pages14
JournalIEEE Transactions on Knowledge and Data Engineering
Volume6
Issue number5
DOIs
Publication statusPublished - 1 Oct 1994
Externally publishedYes

Fingerprint

Network protocols
Concurrency control

ASJC Scopus subject areas

  • Artificial Intelligence
  • Information Systems
  • Control and Systems Engineering
  • Electrical and Electronic Engineering

Cite this

Performance of protocols based on locks with ordered sharing. / Agrawal, D.; El Abbadi, A.; Lang, A. E.

In: IEEE Transactions on Knowledge and Data Engineering, Vol. 6, No. 5, 01.10.1994, p. 805-818.

Research output: Contribution to journalArticle

Agrawal, D. ; El Abbadi, A. ; Lang, A. E. / Performance of protocols based on locks with ordered sharing. In: IEEE Transactions on Knowledge and Data Engineering. 1994 ; Vol. 6, No. 5. pp. 805-818.
@article{968b37ed06cb4316b5e07587fde4f46a,
title = "Performance of protocols based on locks with ordered sharing",
abstract = "There is growing evidence that for a wide variety of database workloads and system configurations, locking-based concurrency control outperforms other types of concurrency control strategies. However, in the presence of increased data contention, locking protocols such as two-phase locking perform poorly. In this paper, we analyze a family of locking-based protocols that employ a new relationship between locks called ordered sharing. Using a centralized database simulation model, we demonstrate that these protocols exhibit comparable performance to that of traditional locking-based protocols when data contention is low, and they exhibit superior performance when data contention is high. Furthermore, we show that the performance of these protocols improves as resources become more plentiful. This is particularly significant because the performance of tw o-phase locking degrades as a result of data contention, not resource contention. Thus, introducing additional resources improves the performance of the proposed protocols, though it does not benefit two-phase locking significantly.",
author = "D. Agrawal and {El Abbadi}, A. and Lang, {A. E.}",
year = "1994",
month = "10",
day = "1",
doi = "10.1109/69.317708",
language = "English",
volume = "6",
pages = "805--818",
journal = "IEEE Transactions on Knowledge and Data Engineering",
issn = "1041-4347",
publisher = "IEEE Computer Society",
number = "5",

}

TY - JOUR

T1 - Performance of protocols based on locks with ordered sharing

AU - Agrawal, D.

AU - El Abbadi, A.

AU - Lang, A. E.

PY - 1994/10/1

Y1 - 1994/10/1

N2 - There is growing evidence that for a wide variety of database workloads and system configurations, locking-based concurrency control outperforms other types of concurrency control strategies. However, in the presence of increased data contention, locking protocols such as two-phase locking perform poorly. In this paper, we analyze a family of locking-based protocols that employ a new relationship between locks called ordered sharing. Using a centralized database simulation model, we demonstrate that these protocols exhibit comparable performance to that of traditional locking-based protocols when data contention is low, and they exhibit superior performance when data contention is high. Furthermore, we show that the performance of these protocols improves as resources become more plentiful. This is particularly significant because the performance of tw o-phase locking degrades as a result of data contention, not resource contention. Thus, introducing additional resources improves the performance of the proposed protocols, though it does not benefit two-phase locking significantly.

AB - There is growing evidence that for a wide variety of database workloads and system configurations, locking-based concurrency control outperforms other types of concurrency control strategies. However, in the presence of increased data contention, locking protocols such as two-phase locking perform poorly. In this paper, we analyze a family of locking-based protocols that employ a new relationship between locks called ordered sharing. Using a centralized database simulation model, we demonstrate that these protocols exhibit comparable performance to that of traditional locking-based protocols when data contention is low, and they exhibit superior performance when data contention is high. Furthermore, we show that the performance of these protocols improves as resources become more plentiful. This is particularly significant because the performance of tw o-phase locking degrades as a result of data contention, not resource contention. Thus, introducing additional resources improves the performance of the proposed protocols, though it does not benefit two-phase locking significantly.

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

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

U2 - 10.1109/69.317708

DO - 10.1109/69.317708

M3 - Article

VL - 6

SP - 805

EP - 818

JO - IEEE Transactions on Knowledge and Data Engineering

JF - IEEE Transactions on Knowledge and Data Engineering

SN - 1041-4347

IS - 5

ER -