Figure 5 from Deadlock Resolution Techniques: An Overview | Semantic Scholar (2024)

The proposed solution is to select particular processes that can reduce the potential consequences of process termination in order to be terminated and maintains the performance of the system during deadlock recovery compared to the other related methods.

It is shown that the arc deletion problem in the OR model can be solved in polynomial time, and the vertex deletion problem in the OR model remains NP-complete even for graphs with maximum degree Δ(G).

It is shown that the success or failure of the attack on the selfish mines can not be assured due to uncertainty, and it is suggested that the disbelieving mining body, accumulating news adherents' forces and manipulating the entire network, to enter the majority.

Experimental results showed that SDWM is superior to other methods in energy conservation, task response time, and resource utilization, and the improvements are 31.5 %, 50 %, 50.8 %, respectively.

A new strategy based on ABC (artificial honeybee colony) algorithm is provided for avoiding the resource conflict in the cloud servers during compilation and the results show the effectiveness of the developed approach.

A new deadlock resolution algorithm is proposed which doesn’t cause any aborts /roll backs and is based on the mutual cooperation of transactions and a random number representing time duration for which the process holding the resource will be suspended.

It is shown that there exists an optimal deadlock detection frequency that yields the minimum long-run mean average cost, which is determined by the message complexities of thedeadlock detection and resolution algorithms being used, as well as the rate of deadlock formation, denoted as lambda.

A new distributed algorithm for detecting generalized deadlocks in distributed systems that reduces the data traffic complexity into constant by using fixed sized messages and minimizes additional messages to resolve deadlocks.

A new algorithm to detect and resolve distributed deadlocks in the generalized model that minimizes the message length into a constant without using any explicit technique and is the significant improvement over the existing algorithms.

This paper presents a tool that uses a sound static analysis to instrument multithreaded C programs and then links these programs with a run-time system that avoids possible deadlocks, in contrast to most other purely static tools for deadlock freedom.

A centralized approach is taken that removes the need of backward propagation of replies, but sends the dependency information directly to the initiator of the algorithm, which enables reduction of time cost for deadlock detection to half of that of the existing distributed algorithms.

This paper formalizes a model of streaming computation systems with filtering, and proposes provably correct mechanisms to avoid deadlock in distributed systems of diverse computing architectures, where global coordination or modification of buffer sizes may be difficult or impossible in practice.

A novel dynamic analysis technique that finds real deadlocks in multi-threaded programs by observing an execution of the program and controlling a random thread scheduler to create the potential deadlocks with high probability.

It is shown that deadlock avoidance for streaming computations with filtering can be performed efficiently for a large class of DAG topologies, and a new method where each dummy message is tagged with a destination, so as to reduce the number of dummy messages sent over the network.

...

...