Perfornance Study of Two Phase Locking in Single-Site Database Systems
IEEE Transactions on Software Engineering
A Modified Priority Based Probe Algorithm for Distributed Deadlock Detection and Resolution
IEEE Transactions on Software Engineering
Resolution of Deadlocks in Object-Oriented Distributed Systems
IEEE Transactions on Computers
Performance Analysis of Static Locking in Distributed Database Systems
IEEE Transactions on Computers
Invariant-based verification of a distributed deadlock detection algorithm
IEEE Transactions on Software Engineering
Resolving all deadlocks in distributed systems
Information Processing Letters
CIKM '95 Proceedings of the fourth international conference on Information and knowledge management
Detection and resolution of deadlocks in distributed database systems
CIKM '95 Proceedings of the fourth international conference on Information and knowledge management
A Distributed Graph Algorithm for the Detection of Local Cycles and Knots
IEEE Transactions on Parallel and Distributed Systems
A probabilistic analysis of a database system
SIGMETRICS '86/PERFORMANCE '86 Proceedings of the 1986 ACM SIGMETRICS joint international conference on Computer performance modelling, measurement and evaluation
Distributed deadlock detection algorithm
ACM Transactions on Database Systems (TODS)
Distributed deadlock detection
ACM Transactions on Computer Systems (TOCS)
Probability and Statistics with Reliability, Queuing and Computer Science Applications
Probability and Statistics with Reliability, Queuing and Computer Science Applications
Cost of Distributed Deadlock Detection: A Performance Study
Proceedings of the Sixth International Conference on Data Engineering
Performance Comparisons of Distributed Deadlock Detection Algorithms
Proceedings of the Eighth International Conference on Data Engineering
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)
An efficient distributed deadlock detection algorithm
ICDCS '95 Proceedings of the 15th International Conference on Distributed Computing Systems
Performance study of distributed deadlock detection algorithms for distributed database systems
Performance study of distributed deadlock detection algorithms for distributed database systems
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
On Optimal Deadlock Detection Scheduling
IEEE Transactions on Computers
A concurrent distributed deadlock detection/resolution algorithm for distributed systems
ISTASC'05 Proceedings of the 5th WSEAS/IASME International Conference on Systems Theory and Scientific Computation
Distributed and Parallel Databases
An efficient deadlock prevention approach for service oriented transaction processing
Computers & Mathematics with Applications
M-Guard: a new distributed deadlock detection algorithm based on mobile agent technology
ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
| Hi-index | 0.00 |
This paper presents a probabilistic performance analysis of a deadlock detection algorithm in distributed systems. Although there has been extensive study on deadlock detection algorithms in distributed systems, little attention has been paid to the study of the performance of these algorithms. Most work on performance study has been achieved through simulation but not through an analytic model. Min [14], to the best of our knowledge, made the sole attempt to evaluate the performance of distributed deadlock detection algorithms analytically. Being different from Min's [14], our analytic approach takes the time-dependent behavior of each process into consideration rather than simply taking the mean-value estimation. Furthermore, the relation among the times when deadlocked processes become blocked is studied, which enhances the accuracy of the analysis. We measure performance metrics such as duration of deadlock, the number of algorithm invocations, and the mean waiting time of a blocked process. It is shown that the analytic estimates are nearly consistent with simulation results.