DEADLOCK-AVOIDANCE MECHANISMS IN DISTRIBUTED SYSTEMS.

Ajoy K. Datta, Sukumar Ghosh, Douglas Harms, Ahmed Elmagarmid

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

There are instances in real-time applications where several distributed processes compete for access to a shared resource. Often these problems are such that requests for use of the shared resource are made at unpredictable times, and as such they cannot be solved using traditional scheduling algorithms. Major concerns with these problems are deadlock and decentralization. Two synchronization mechanisms are presented which address these issues. The first mechanism distributes control of the resource, while requiring a system global semaphore. The second mechanism avoids the need for global semaphores by introducing the key interchange mechanism. Both mechanisms are proven to be deadlock-free by demonstrating the liveness property of the corresponding Petri net used to model the problem.

Original languageEnglish
Pages (from-to)67-82
Number of pages16
JournalComputer Systems Science and Engineering
Volume3
Issue number2
Publication statusPublished - 1 Apr 1988
Externally publishedYes

Fingerprint

Deadlock Avoidance
Interchanges
Scheduling algorithms
Petri nets
Distributed Systems
Synchronization
Deadlock
Resources
Decentralization
Liveness
Scheduling Algorithm
Petri Nets
Real-time

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Theoretical Computer Science
  • Computer Science(all)

Cite this

DEADLOCK-AVOIDANCE MECHANISMS IN DISTRIBUTED SYSTEMS. / Datta, Ajoy K.; Ghosh, Sukumar; Harms, Douglas; Elmagarmid, Ahmed.

In: Computer Systems Science and Engineering, Vol. 3, No. 2, 01.04.1988, p. 67-82.

Research output: Contribution to journalArticle

Datta, Ajoy K. ; Ghosh, Sukumar ; Harms, Douglas ; Elmagarmid, Ahmed. / DEADLOCK-AVOIDANCE MECHANISMS IN DISTRIBUTED SYSTEMS. In: Computer Systems Science and Engineering. 1988 ; Vol. 3, No. 2. pp. 67-82.
@article{75737a192067411289ab2cba1d527634,
title = "DEADLOCK-AVOIDANCE MECHANISMS IN DISTRIBUTED SYSTEMS.",
abstract = "There are instances in real-time applications where several distributed processes compete for access to a shared resource. Often these problems are such that requests for use of the shared resource are made at unpredictable times, and as such they cannot be solved using traditional scheduling algorithms. Major concerns with these problems are deadlock and decentralization. Two synchronization mechanisms are presented which address these issues. The first mechanism distributes control of the resource, while requiring a system global semaphore. The second mechanism avoids the need for global semaphores by introducing the key interchange mechanism. Both mechanisms are proven to be deadlock-free by demonstrating the liveness property of the corresponding Petri net used to model the problem.",
author = "Datta, {Ajoy K.} and Sukumar Ghosh and Douglas Harms and Ahmed Elmagarmid",
year = "1988",
month = "4",
day = "1",
language = "English",
volume = "3",
pages = "67--82",
journal = "Computer Systems Science and Engineering",
issn = "0267-6192",
publisher = "CRL Publishing",
number = "2",

}

TY - JOUR

T1 - DEADLOCK-AVOIDANCE MECHANISMS IN DISTRIBUTED SYSTEMS.

AU - Datta, Ajoy K.

AU - Ghosh, Sukumar

AU - Harms, Douglas

AU - Elmagarmid, Ahmed

PY - 1988/4/1

Y1 - 1988/4/1

N2 - There are instances in real-time applications where several distributed processes compete for access to a shared resource. Often these problems are such that requests for use of the shared resource are made at unpredictable times, and as such they cannot be solved using traditional scheduling algorithms. Major concerns with these problems are deadlock and decentralization. Two synchronization mechanisms are presented which address these issues. The first mechanism distributes control of the resource, while requiring a system global semaphore. The second mechanism avoids the need for global semaphores by introducing the key interchange mechanism. Both mechanisms are proven to be deadlock-free by demonstrating the liveness property of the corresponding Petri net used to model the problem.

AB - There are instances in real-time applications where several distributed processes compete for access to a shared resource. Often these problems are such that requests for use of the shared resource are made at unpredictable times, and as such they cannot be solved using traditional scheduling algorithms. Major concerns with these problems are deadlock and decentralization. Two synchronization mechanisms are presented which address these issues. The first mechanism distributes control of the resource, while requiring a system global semaphore. The second mechanism avoids the need for global semaphores by introducing the key interchange mechanism. Both mechanisms are proven to be deadlock-free by demonstrating the liveness property of the corresponding Petri net used to model the problem.

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

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

M3 - Article

VL - 3

SP - 67

EP - 82

JO - Computer Systems Science and Engineering

JF - Computer Systems Science and Engineering

SN - 0267-6192

IS - 2

ER -