Variable timestamp-based distributed deadlock detection and resolution
This paper proposes a new timestamp-based distributed deadlock detection and resolution algorithm for the AND resource request model. It is different from existing distributed deadlock detection algorithms in that the timestamps we adopt are partially ordered. The timestamps are also dynamically allocated and may be modified at run-time. Compared to previous work, our algorithm can reduce the number of deadlock detections. It can achieve this without incurring additional communication costs by combining timestamp modification with deadlock detection and resolution.
Unable to display preview. Download preview PDF.
- 1.S. Katz and O. Shmueli. Cooperative distributed algorithms for dynamic cycle prevention, IEEE Trans. Software Eng., vol. SE-13, pp. 541–553. May 1987.Google Scholar
- 2.M. K. Sinha and N. Natarajan. A priority based distributed deadlock detection algorithm, IEEE Trans. Software Eng., vol. SE-11, pp. 67–80. Jan. 1985.Google Scholar
- 6.Y. C. Tay. What is a deadlock? Proceedings of the IFIP WG10.3 International Conference on Decentralized and Distributed Systems. September, 1993.Google Scholar