A periodic deadlock detection and resolution algorithm with a new graph model for sequential transaction processing

Young Chul Park*, Peter Scheuermann, Sang Ho Lee

*Corresponding author for this work

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

8 Scopus citations

Abstract

The authors address the deadlock problem in sequential transaction processing where the strict two-phase locking and the multiple granularity locking protocol with five lock modes are used. The scheduling policy honors lock requests in a first-in-first-out basis except for lock conversions. As a basic tool, a direct graph model called the holder/wire-transaction waited-by graph (H/W-TWBG) is introduced to capture precise status of systems in terms of deadlock. The properties of H/W-TWBG are presented. Based on H/W-TWBG, the identification principles of the victim candidates are established in a deadlock cycle, and a periodic deadlock detection and resolution algorithm which has a reasonable time and storage complexity is preserved. One important feature of the deadlock resolution scheme is that some deadlocks can be resolved without aborting any transaction.

Original languageEnglish (US)
Title of host publicationProceedings - International Conference on Data Engineering
PublisherPubl by IEEE
Pages202-209
Number of pages8
ISBN (Print)0818625457
StatePublished - Jan 1 1992
Event8th International Conference on Data Engineering - Tempe, AZ, USA
Duration: Feb 3 1992Feb 7 1992

Other

Other8th International Conference on Data Engineering
CityTempe, AZ, USA
Period2/3/922/7/92

ASJC Scopus subject areas

  • Software
  • General Engineering
  • Engineering (miscellaneous)

Fingerprint

Dive into the research topics of 'A periodic deadlock detection and resolution algorithm with a new graph model for sequential transaction processing'. Together they form a unique fingerprint.

Cite this