2015
DOI: 10.7763/lnse.2015.v3.205
|View full text |Cite
|
Sign up to set email alerts
|

An Analysis and Improvement of Probe-Based Algorithm for Distributed Deadlock Detection

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2018
2018
2021
2021

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(3 citation statements)
references
References 12 publications
0
3
0
Order By: Relevance
“…Furthermore, the achievement of cluster consensus control is guaranteed by the acycle assumption in the work of Qin and Yu. 49 Notice that some undesired issues such as deadlock 59 might happen due to the presence of a cycle in the communication graph. In such cases, therefore, acycle assumption is required to avoid them (see the work of Oliva et al 60 and the references therein for further details).…”
Section: Lemmamentioning
confidence: 99%
“…Furthermore, the achievement of cluster consensus control is guaranteed by the acycle assumption in the work of Qin and Yu. 49 Notice that some undesired issues such as deadlock 59 might happen due to the presence of a cycle in the communication graph. In such cases, therefore, acycle assumption is required to avoid them (see the work of Oliva et al 60 and the references therein for further details).…”
Section: Lemmamentioning
confidence: 99%
“…While in process, two basic concepts are involved. For killing a process, the big issue is to decide which process shall be terminated [11], [12]. The OS kills a process that has done the smallest quantity of labor till now.…”
Section: Introductionmentioning
confidence: 99%
“…The OS kills a process that has done the smallest quantity of labor till now. While killing all processes will cause inefficiency within the system because all the processes will execute again from starting [12].…”
Section: Introductionmentioning
confidence: 99%