An efficient distributed deadlock avoidance algorithm for the AND model

Wu, Hui; Chin, Wei-Ngan; Jaffar, Joxan

doi:10.1109/32.979987

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2005

2021

Publication Types

Select...

Book3

Article2

Other1

Relationship

Self Cite0

Independent6

Authors

Journals

Cited by 15 publications

(1 citation statement)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This leaf allocates the resources. The rest called as non-leaf nodes that detect deadlock [26]. These nodes act in a process of inheritance where they can detect the deadlocks only in their children's leaf controllers [27].…”

Section: Introductionmentioning

confidence: 99%

Deadlock detection in distributed system

Rout

Mishra

Salkuti

2021

IJEECS

View full text Add to dashboard Cite

In highly automated devices, deadlock is a case that occurs when no system can permit its event which may give irrelevant economic losses. A process can request or release resources that are either available or are on hold by others. If a process requesting a resource is not available at any time, then that process enters into the waiting state. But if a waiting state is not converted into its present state, it enters more than two processes are having an indefinite waiting state. The proposed algorithm gives an efficient way for deadlock detection. For the implementation of this work, C++ and python as the basic programming language are used. It gives an idea about how resources are allocated, and how few processes result in deadlock.

show abstract

Section: Introductionmentioning

confidence: 99%