Performance characteristics of protocols with ordered shared locks

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

8 Citations (Scopus)

Abstract

A family of locking-based protocols is analyzed that use a novel mode of locks called ordered sharing. Using a centralized database simulation model, it is demonstrated that these protocols exhibit comparable performance to that of traditional locking-based protocols when data contention is low and exhibit superior performance when data contention is high. It is shown that the performance of these protocols improves as physical resources become more plentiful. This is particularly significant since two-phase locking degrades due to data and not resource contention. Thus, introducing additional resources improves the performance of the proposed protocols while it does not benefit two-phase locking significantly.

Original languageEnglish
Title of host publicationProceedings - International Conference on Data Engineering
Place of PublicationPiscataway, NJ, United States
PublisherPubl by IEEE
Pages592-601
Number of pages10
ISBN (Print)0818621389
Publication statusPublished - 1 Apr 1991
Externally publishedYes
EventProceedings of the 7th International Conference on Data Engineering - Kobe, Jpn
Duration: 8 Apr 199112 Apr 1991

Other

OtherProceedings of the 7th International Conference on Data Engineering
CityKobe, Jpn
Period8/4/9112/4/91

ASJC Scopus subject areas

  • Software
  • Engineering(all)
  • Engineering (miscellaneous)

Cite this

Agrawal, D., El Abbadi, A., & Lang, A. E. (1991). Performance characteristics of protocols with ordered shared locks. In Proceedings - International Conference on Data Engineering (pp. 592-601). Piscataway, NJ, United States: Publ by IEEE.

Performance characteristics of protocols with ordered shared locks. / Agrawal, D.; El Abbadi, A.; Lang, A. E.

Proceedings - International Conference on Data Engineering. Piscataway, NJ, United States : Publ by IEEE, 1991. p. 592-601.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Agrawal, D, El Abbadi, A & Lang, AE 1991, Performance characteristics of protocols with ordered shared locks. in Proceedings - International Conference on Data Engineering. Publ by IEEE, Piscataway, NJ, United States, pp. 592-601, Proceedings of the 7th International Conference on Data Engineering, Kobe, Jpn, 8/4/91.
Agrawal D, El Abbadi A, Lang AE. Performance characteristics of protocols with ordered shared locks. In Proceedings - International Conference on Data Engineering. Piscataway, NJ, United States: Publ by IEEE. 1991. p. 592-601
Agrawal, D. ; El Abbadi, A. ; Lang, A. E. / Performance characteristics of protocols with ordered shared locks. Proceedings - International Conference on Data Engineering. Piscataway, NJ, United States : Publ by IEEE, 1991. pp. 592-601
@inproceedings{97db3d4136054c20a7f1a7e6dfe6e92c,
title = "Performance characteristics of protocols with ordered shared locks",
abstract = "A family of locking-based protocols is analyzed that use a novel mode of locks called ordered sharing. Using a centralized database simulation model, it is demonstrated that these protocols exhibit comparable performance to that of traditional locking-based protocols when data contention is low and exhibit superior performance when data contention is high. It is shown that the performance of these protocols improves as physical resources become more plentiful. This is particularly significant since two-phase locking degrades due to data and not resource contention. Thus, introducing additional resources improves the performance of the proposed protocols while it does not benefit two-phase locking significantly.",
author = "D. Agrawal and {El Abbadi}, A. and Lang, {A. E.}",
year = "1991",
month = "4",
day = "1",
language = "English",
isbn = "0818621389",
pages = "592--601",
booktitle = "Proceedings - International Conference on Data Engineering",
publisher = "Publ by IEEE",

}

TY - GEN

T1 - Performance characteristics of protocols with ordered shared locks

AU - Agrawal, D.

AU - El Abbadi, A.

AU - Lang, A. E.

PY - 1991/4/1

Y1 - 1991/4/1

N2 - A family of locking-based protocols is analyzed that use a novel mode of locks called ordered sharing. Using a centralized database simulation model, it is demonstrated that these protocols exhibit comparable performance to that of traditional locking-based protocols when data contention is low and exhibit superior performance when data contention is high. It is shown that the performance of these protocols improves as physical resources become more plentiful. This is particularly significant since two-phase locking degrades due to data and not resource contention. Thus, introducing additional resources improves the performance of the proposed protocols while it does not benefit two-phase locking significantly.

AB - A family of locking-based protocols is analyzed that use a novel mode of locks called ordered sharing. Using a centralized database simulation model, it is demonstrated that these protocols exhibit comparable performance to that of traditional locking-based protocols when data contention is low and exhibit superior performance when data contention is high. It is shown that the performance of these protocols improves as physical resources become more plentiful. This is particularly significant since two-phase locking degrades due to data and not resource contention. Thus, introducing additional resources improves the performance of the proposed protocols while it does not benefit two-phase locking significantly.

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

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

M3 - Conference contribution

SN - 0818621389

SP - 592

EP - 601

BT - Proceedings - International Conference on Data Engineering

PB - Publ by IEEE

CY - Piscataway, NJ, United States

ER -