On Optimal Deadlock Detection Scheduling

  title={On Optimal Deadlock Detection Scheduling},
  author={Yibei Ling and Shigang Chen and Cho-Yu Jason Chiang},
  journal={IEEE Transactions on Computers},
Deadlock detection scheduling is an important, yet often overlooked problem that can significantly affect the overall performance of deadlock handling. Excessive initiation of deadlock detection increases overall message usage, resulting in degraded system performance in the absence of deadlocks, while insufficient initiation of deadlock detection increases the deadlock persistence time, resulting in an increased deadlock resolution cost in the presence of deadlocks. The investigation of this… 

Figures and Tables from this paper

Deadlock Detection Scheduling for Distributed Processes in the Presence of System Failures
  • A. Izumi, T. Dohi, N. Kaio
  • Business
    2010 IEEE 16th Pacific Rim International Symposium on Dependable Computing
  • 2010
This paper reformulates the Ling deadlock detection scheduling problem in the presence of system failures, and derives the optimal deadlock Detection time minimizing the long-run average cost per unit time through the well-known Landau notation.
A novel scheduling strategy for an efficient deadlock detection
This paper proposes a deadlock detection protocol based on threads, processes which are acquired, released or stopped and which thread wait for the other and causes the deadlock.
An Overview on Deadlock Resolution Techniques
This paper describes deadlock detection using wait for graph and some deadlock resolution algorithms which resolves the deadlock by selecting victims using different criteria.
Deadlock Resolution Techniques: An Overview
A deadlock occurs when there is a set of processes waiting for resource held by other processes in the same set. The processes in deadlock wait indefinitely for the resources and never terminate
Just-in-time and just-in-place deadlock resolution
This thesis is that, under the assumption that the time to the first deadlock in the system (after a system restart) follows an exponential distribution, a reinforcement-learning approach is effective in scheduling deadlock detection for a restart-oriented system, and that runtime exceptions are a programming abstraction that allows programmers to write fine-grained deadlock recovery code.
An efficient deadlock prevention approach for service oriented transaction processing
VGS Algorithm - An Efficient Deadlock Resolution Method
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.
An Optimal Goal Programming Model to Recovery from Deadlocks
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.
Probe-based distributed algorithms for deadlock detection
  • M. Postolache
  • Computer Science
    2012 16th International Conference on System Theory, Control and Computing (ICSTCC)
  • 2012
Distributed algorithms discussed in this paper provide a better performance than other well known algorithms designed for detecting deadlock, with respect to the communication bus load and fault
Effective resource management technique using reservation pool
This paper presents a technique for resource reservation namely Worst-Case Execution Time Based Resource Reservation (ETRR), and indicates that the average turnaround time of the ETRR is approximately 13% better than the existing Banker's algorithm.


Stochastic analysis of distributed deadlock scheduling
It is shown that the asymptotically optimal frequency of deadlock detection scheduling that minimizes the message overhead is cal O((λ n)1/3), when the total number of processes n is sufficiently large.
Performance Analysis of Distributed Deadlock Detection Algorithms
A probabilistic performance analysis of a deadlock detection algorithm in distributed systems that takes the time-dependent behavior of each process into consideration rather than simply taking the mean-value estimation.
Distributed detection of generalized deadlocks
  • A. Kshemkalyani, M. Singhal
  • Computer Science
    Proceedings of 17th International Conference on Distributed Computing Systems
  • 1997
The algorithm performs reduction of a distributed wait-for-graph (WFG) to determine a deadlock and it is conjecture that the algorithm is optimal in the number of messages and time delay, among distributed algorithms to detect generalized deadlocks.
Fast, Centralized Detection and Resolution of Distributed Deadlocks in the Generalized Model
  • Soojung Lee
  • Computer Science
    IEEE Trans. Software Eng.
  • 2004
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.
Guaranteed Deadlock Recovery: Deadlock Resolution with Rollback Propagation
The concept of guaranteed deadlock recovery is introduced which guarantees that a broken deadlock cycle will not be re-formed after the rollback, and how to achieve this by carefully selecting the victim based on run-time dependency information is shown.
Deadlock detection in distributed databases
A uniform model in which published algorithms can be cast is given, and the fundamental principles on which distributed deadlock detection schemes are based are presented, and a hierarchy of deadlock models is presented.
Deadlock detection in distributed database systems: a new algorithm and a comparative performance analysis
The extensive experiments carried out indicate that the newly proposed deadlock detection algorithm outperforms the other algorithms in the vast majority of configurations and workloads and, in contrast to all other algorithms, is very robust with respect to differing load and access profiles.
Deadlock detection in distributed systems
An up-to-date and comprehensive survey of deadlock detection algorithms is presented, their merits and drawbacks are discussed, and their performances are compared.
Deadlock detection in multidatabase systems: a performance analysis
A comparative performance study of several global deadlock detection methods is presented and a new hybriddeadlock detection method is suggested that is very well suited for a distributed implementation and has a performance that compares favourably with all the other methods in a variety of workload conditions.
A periodic deadlock detection and resolution algorithm with a new graph model for sequential transaction processing
A direct graph model called the holder/wire-transaction waited-by graph (H/W-TWBG) is introduced to capture the precise status of systems in terms of deadlock to address the deadlock problem in sequential transaction processing.