2017
DOI: 10.1007/s11219-017-9379-1
|View full text |Cite
|
Sign up to set email alerts
|

A fault tolerant election-based deadlock detection algorithm in distributed systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
5
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(5 citation statements)
references
References 23 publications
0
5
0
Order By: Relevance
“…If a system encounters a deadlock, the next stage is to recover via neutrosophic mechanisms [37]. To handle distributed database deadlock detection, as in our case, the proposed model employs an optimized path-pushing strategy, which involves sending a portion of a possible cycle, referred to as a "path" to another site only when the first transaction in the path has a higher priority than the last one [38]. This results in a halving of the quantity of messages [39].…”
Section: Step 2: Distributed Deadlock Detectionmentioning
confidence: 99%
See 2 more Smart Citations
“…If a system encounters a deadlock, the next stage is to recover via neutrosophic mechanisms [37]. To handle distributed database deadlock detection, as in our case, the proposed model employs an optimized path-pushing strategy, which involves sending a portion of a possible cycle, referred to as a "path" to another site only when the first transaction in the path has a higher priority than the last one [38]. This results in a halving of the quantity of messages [39].…”
Section: Step 2: Distributed Deadlock Detectionmentioning
confidence: 99%
“…As a result, the major performance metric is the "miss percentage," or the proportion of transactions that miss their deadlines. The following equation is used to determine the proportion of data that is missing [38]:…”
Section: Step 3: Extracting Transaction Attributesmentioning
confidence: 99%
See 1 more Smart Citation
“…A deadlock ensues if all four requirements are true. On the other hand, until one of these requirements is satisfied, there will never be a deadlock [22][25] [34].…”
Section: B Deadlock In Real Time Distributed Database Systemmentioning
confidence: 99%
“…To determine whether a process has reached a stalemate, it sends inquiry messages down all of the WFG's outgoing edges. These inquiries are sequentially transmitted (i.e., diffused) via the edges of the WFG [34]. Global state detection-based deadlock detection allows for the creation of a consistent snapshot of a distributed system without freezing the underlying execution.…”
Section: B Deadlock In Real Time Distributed Database Systemmentioning
confidence: 99%