LOCK CONVERSION IN NON-TWO-PHASE LOCKING PROTOCOLS.

C. Mohan, Donald Fussell, Zvi Kedem, Abraham Silberschatz

Research output: Contribution to journalArticle

Abstract

A locking protocol is a set of rules governing the manner in which the database entities may be accessed. Such a protocol usually employs several kinds of locks. Most of the previous work in this area has assumed that once a transaction acquires a particular kind of lock on a data item it is not allowed to convert this lock to another kind. In this paper we perform a systematic study of the consequences of allowing lock conversions in non-two-phase locking protocols, and show how this leads to increased concurrency and affects deadlock-freedom. The non-two-phase protocols that we study are the very general guard protocols defined for databases in which a directed acyclic graph structure can be superimposed on the data items. We present very natural generalizations of these protocols, including correctness proofs, and develop deadlock removal methods.

Original languageEnglish (US)
Pages (from-to)15-22
Number of pages8
JournalIEEE Transactions on Software Engineering
VolumeSE-11
Issue number1
StatePublished - Jan 1985

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Software
  • Electrical and Electronic Engineering

Cite this

Mohan, C., Fussell, D., Kedem, Z., & Silberschatz, A. (1985). LOCK CONVERSION IN NON-TWO-PHASE LOCKING PROTOCOLS. IEEE Transactions on Software Engineering, SE-11(1), 15-22.

LOCK CONVERSION IN NON-TWO-PHASE LOCKING PROTOCOLS. / Mohan, C.; Fussell, Donald; Kedem, Zvi; Silberschatz, Abraham.

In: IEEE Transactions on Software Engineering, Vol. SE-11, No. 1, 01.1985, p. 15-22.

Research output: Contribution to journalArticle

Mohan, C, Fussell, D, Kedem, Z & Silberschatz, A 1985, 'LOCK CONVERSION IN NON-TWO-PHASE LOCKING PROTOCOLS.', IEEE Transactions on Software Engineering, vol. SE-11, no. 1, pp. 15-22.
Mohan, C. ; Fussell, Donald ; Kedem, Zvi ; Silberschatz, Abraham. / LOCK CONVERSION IN NON-TWO-PHASE LOCKING PROTOCOLS. In: IEEE Transactions on Software Engineering. 1985 ; Vol. SE-11, No. 1. pp. 15-22.
@article{ed7827889d4947ddbb6a3010192778f2,
title = "LOCK CONVERSION IN NON-TWO-PHASE LOCKING PROTOCOLS.",
abstract = "A locking protocol is a set of rules governing the manner in which the database entities may be accessed. Such a protocol usually employs several kinds of locks. Most of the previous work in this area has assumed that once a transaction acquires a particular kind of lock on a data item it is not allowed to convert this lock to another kind. In this paper we perform a systematic study of the consequences of allowing lock conversions in non-two-phase locking protocols, and show how this leads to increased concurrency and affects deadlock-freedom. The non-two-phase protocols that we study are the very general guard protocols defined for databases in which a directed acyclic graph structure can be superimposed on the data items. We present very natural generalizations of these protocols, including correctness proofs, and develop deadlock removal methods.",
author = "C. Mohan and Donald Fussell and Zvi Kedem and Abraham Silberschatz",
year = "1985",
month = "1",
language = "English (US)",
volume = "SE-11",
pages = "15--22",
journal = "IEEE Transactions on Software Engineering",
issn = "0098-5589",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "1",

}

TY - JOUR

T1 - LOCK CONVERSION IN NON-TWO-PHASE LOCKING PROTOCOLS.

AU - Mohan, C.

AU - Fussell, Donald

AU - Kedem, Zvi

AU - Silberschatz, Abraham

PY - 1985/1

Y1 - 1985/1

N2 - A locking protocol is a set of rules governing the manner in which the database entities may be accessed. Such a protocol usually employs several kinds of locks. Most of the previous work in this area has assumed that once a transaction acquires a particular kind of lock on a data item it is not allowed to convert this lock to another kind. In this paper we perform a systematic study of the consequences of allowing lock conversions in non-two-phase locking protocols, and show how this leads to increased concurrency and affects deadlock-freedom. The non-two-phase protocols that we study are the very general guard protocols defined for databases in which a directed acyclic graph structure can be superimposed on the data items. We present very natural generalizations of these protocols, including correctness proofs, and develop deadlock removal methods.

AB - A locking protocol is a set of rules governing the manner in which the database entities may be accessed. Such a protocol usually employs several kinds of locks. Most of the previous work in this area has assumed that once a transaction acquires a particular kind of lock on a data item it is not allowed to convert this lock to another kind. In this paper we perform a systematic study of the consequences of allowing lock conversions in non-two-phase locking protocols, and show how this leads to increased concurrency and affects deadlock-freedom. The non-two-phase protocols that we study are the very general guard protocols defined for databases in which a directed acyclic graph structure can be superimposed on the data items. We present very natural generalizations of these protocols, including correctness proofs, and develop deadlock removal methods.

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

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

M3 - Article

AN - SCOPUS:0021817128

VL - SE-11

SP - 15

EP - 22

JO - IEEE Transactions on Software Engineering

JF - IEEE Transactions on Software Engineering

SN - 0098-5589

IS - 1

ER -