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

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.