Survey on Deadlocks in Distributed Database Systems
Survey on Deadlocks in Distributed Database Systems
复制标题
分布式数据库系统死锁调查
DOI：
10.1109/icicv50876.2021.9388399
复制
发表时间：
2021
期刊：
影响因子：
--
通讯作者：
R. Sowmya
中科院分区：
文献类型：
--
作者：
Dr. Y. Bhavani;K. P. Kumar;K. Dharmateja;P. Pranathi;R. Sowmya
在分布式数据库系统（DBS）和多任务系统中，死锁的发生是最严重的问题之一。如果一个站点请求的资源已经在另一个正在等待另一个资源的站点中，则这种情况称为分布式死锁。不同的分布式环境需要合适的死锁检测算法来检测死锁。不同的分布式环境需要通过避免死锁来维护其平台。为了实现这种环境，需要提供优化的死锁检测和避免算法。在本文中，讨论了使用等待图和解析算法来追踪死锁的不同死锁检测算法。优化技术用于以有效的方式解决死锁。根据延迟时间、消息大小、消息数量以及算法是否检测到假死锁等不同参数，对不同的死锁检测算法进行了比较。基于比较，提出了一些适用于分布式环境的死锁检测算法。
In Distributed Database System (DBS) and multitasking system, the occurrence of deadlocks is one of the most serious problems. If a site request for a resource that is already in the another site which is waiting for another resource then the scenario is called as distributed deadlock. Different distributed environments require a suitable deadlock detection algorithm to detect deadlocks. Different distributed environments needs to maintain their platforms by avoiding deadlocks. To achieve this environment, it is required to fed with optimized deadlock detection and avoidance algorithms. In this article, different deadlock detection algorithms that uses Wait For Graph and resolution algorithms to trace out deadlocks were discussed. An optimization technique is used for resolving deadlock in an efficient manner. A comparison between different deadlock detection algorithms based on different parameters like, delay time, message size, number of messages and whether the algorithm detects false deadlocks or not were performed. Based on the comparisons, a few deadlock detection algorithms were suggested for the distributed environment.