2012
DOI: 10.5120/7377-0186
|View full text |Cite
|
Sign up to set email alerts
|

A Review of Distributed Deadlock Detection Techniques based on Diffusion Computation Approach

Abstract: A deadlock is a system state in which every process in some group requests resources from other processes in the group, and then waits indefinitely for these requests to be satisfied. Deadlocks have a very adverse effect on the efficient working of operating system therefore they should be either prevented, avoided or if exist should be detected and resolved. Because distributed systems are more vulnerable to deadlocks, the problems of deadlock detection and resolution have long been considered important probl… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2015
2015
2023
2023

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(6 citation statements)
references
References 16 publications
(20 reference statements)
0
6
0
Order By: Relevance
“…Anomalies or outliers need to be checked and extracted in all domains, and the present scenario is no exception (Singh & Upadhyaya, 2012). As in most cases, both positive and negative outliers can coexist here.…”
Section: Outlier Removal Through Iqr Techniquementioning
confidence: 94%
See 1 more Smart Citation
“…Anomalies or outliers need to be checked and extracted in all domains, and the present scenario is no exception (Singh & Upadhyaya, 2012). As in most cases, both positive and negative outliers can coexist here.…”
Section: Outlier Removal Through Iqr Techniquementioning
confidence: 94%
“…Outlier detection is a technique to identify the presence of unusual patterns within a system, which do not conform to the general expected behavior (Singh & Upadhyaya, 2012). In educational domain, outlier performers refer to the group of students who perform below or above a statistically determined permissible range.…”
Section: Introductionmentioning
confidence: 99%
“…As mentioned earlier deadlock occurs whenever waiting transactions want access to the resources held by each other and none of them is able to complete their execution [2]. Most of the reviewed algorithms imply rollback/abort as the solution to deadlocks.…”
Section: Related Workmentioning
confidence: 99%
“…Deadlock is a system state in which every process in some group requests resources from other processes in the group, and then waits indefinitely for these requests to be satisfied [1]. Deadlock is an undesirable situation; some of the consequences of deadlock are: throughput of the system is affected; utilization of the involved resources decreases to zero; deadlock increases with deadlock persistence time; and deadlock cycles do not terminate by themselves until properly detected and resolved [2], [3]. The deadlock problem is intrinsic to distributed database system which employs locking as its concurrency control algorithm.…”
Section: Introductionmentioning
confidence: 99%
“…A deadlocks drive DRTDBS into an undesirable situation that affects the system negatively [30]. The consequences of deadlocks on the system include decreasing the system throughput, collapsing the utilization of the involved resources to zero, and increasing the number of deadlocked transactions with deadlock persistence time [128]. The deadlock cycles 1 do not terminate without outside interference [30].…”
Section: Deadlocksmentioning
confidence: 99%