Distributed discrete-event simulation
ACM Computing Surveys (CSUR)
Deadlock detection in distributed databases
ACM Computing Surveys (CSUR)
A Distributed Graph Algorithm for the Detection of Local Cycles and Knots
IEEE Transactions on Parallel and Distributed Systems
A Distributed Deadlock Resolution Algorithm for the AND Model
IEEE Transactions on Parallel and Distributed Systems
Distributed deadlock detection algorithm
ACM Transactions on Database Systems (TODS)
A Formal Model of Message Blocking and Deadlock Resolution in Interconnection Networks
IEEE Transactions on Parallel and Distributed Systems
Distributed deadlock detection
ACM Transactions on Computer Systems (TOCS)
A Variational Calculus Approach to Optimal Checkpoint Placement
IEEE Transactions on Computers
A One-Phase Algorithm to Detect Distributed Deadlocks in Replicated Databases
IEEE Transactions on Knowledge and Data Engineering
Performance Analysis of Distributed Deadlock Detection Algorithms
IEEE Transactions on Knowledge and Data Engineering
Efficient Detection and Resolution of Generalized Distributed Deadlocks
IEEE Transactions on Software Engineering
The VLDB Journal — The International Journal on Very Large Data Bases
Optimal deadlock detection in distributed systems based on locally constructed wait-for graphs
ICDCS '96 Proceedings of the 16th International Conference on Distributed Computing Systems (ICDCS '96)
Distributed detection of generalized deadlocks
ICDCS '97 Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97)
An optimal deadlock resolution algorithm in multidatabase systems
ICPADS '96 Proceedings of the 1996 International Conference on Parallel and Distributed Systems
Guaranteed Deadlock Recovery: Deadlock Resolution with Rollback Propagation
Guaranteed Deadlock Recovery: Deadlock Resolution with Rollback Propagation
A Safe Algorithm for Resolving OR Deadlocks
IEEE Transactions on Software Engineering
Fast, Centralized Detection and Resolution of Distributed Deadlocks in the Generalized Model
IEEE Transactions on Software Engineering
Stochastic analysis of distributed deadlock scheduling
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
An efficient deadlock prevention approach for service oriented transaction processing
Computers & Mathematics with Applications
Hi-index | 14.98 |
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 performance trade-off, however, is missing in the literature. This paper studies the impact of deadlock detection scheduling on the overall performance of deadlock handling. In particular, we show 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 the deadlock detection and resolution algorithms being used, as well as the rate of deadlock formation, denoted as \lambda. For the best known deadlock detection and resolution algorithms, we show that the asymptotically optimal frequency of deadlock detection scheduling that minimizes the overall message overhead is {\cal O}((\lambda n)^{1/3}) when the total number n of processes is sufficiently large. Furthermore, we show that, in general, fully distributed (uncoordinated) deadlock detection scheduling cannot be performed as efficiently as centralized (coordinated) deadlock detection scheduling.