A new deadlock detection algorithms for distributed real-time database systems

Authors:
Chim-fu Yeung;Sheung-lun Hung
Affiliations:
-;-
Venue:
SRDS '95 Proceedings of the 14TH Symposium on Reliable Distributed Systems
Year:
1995

Citing 0
Cited 3

A One-Phase Algorithm to Detect Distributed Deadlocks in Replicated Databases

IEEE Transactions on Knowledge and Data Engineering
A parallel multi-unit resource deadlock detection algorithm with O(log2(min(m,n))) overall run-time complexity

Journal of Parallel and Distributed Computing
Resource Management in Real Time Distributed System with Security Constraints: A Review

International Journal of Distributed Systems and Technologies

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recently the concurrency control issue of real-time transactions is gaining increasing attention of researchers in the database community. One of the major design issue in concurrency control of real-time transactions is the resolution of local as well as distributed deadlocks while at the same time meeting the timing requirements of the transactions. In this paper, a new deadlock detection algorithm specially designed for distributed real-time database systems is proposed. The performance of the proposed algorithm is evaluated through extensive simulation experiments. Studies have also been carried out to compare the performance of the real-time deadlock detection algorithm with a non real-time algorithm for both firm and soft real-time transactions. Results indicated that the real-time deadlock detection algorithm performs better than the non real-lime deadlock detection algorithm. Results also indicated that the performance of the new algorithm is substantially better for soft real-time than that of firm real-time systems.