Issue No. 04 - July/August (2001 vol. 13)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/69.940736
<p><b>Abstract</b>—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 [<ref rid="bibK062314" type="bib">14</ref>], 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 [<ref rid="bibK062314" type="bib">14</ref>], 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.</p>
Deadlock detection, distributed algorithms, distributed systems, cycle detection, wait-for graph.
S. Lee and J. L. Kim, "Performance Analysis of Distributed Deadlock Detection Algorithms," in IEEE Transactions on Knowledge & Data Engineering, vol. 13, no. , pp. 623-636, 2001.