Computer Science and Engineering, Bangladesh Army International University of Science and Technology, Cumilla, Bangladesh.
Computer Science and Engineering, International University of Business Agriculture and Technology, Dhaka, Bangladesh.
PLoS One. 2024 Sep 20;19(9):e0310807. doi: 10.1371/journal.pone.0310807. eCollection 2024.
Effective resource allocation is crucial in operating systems to prevent deadlocks, especially when resources are limited and non-shareable. Traditional methods like the Banker's algorithm provide solutions but suffer from limitations such as static process handling, high time complexity, and a lack of real-time adaptability. To address these challenges, we propose the Dynamic Banker's Deadlock Avoidance Algorithm (DBDAA). The DBDAA introduces real-time processing for safety checks, significantly improving system efficiency and reducing the risk of deadlocks. Unlike conventional methods, the DBDAA dynamically includes processes in safety checks, considerably decreasing the number of comparisons required to determine safe states. This optimization reduces the time complexity to O(n) in the best-case and O(nd) in the average and worst-case scenarios, compared to the O(n2d) complexity of the original Banker's algorithm. The integration of real-time processing ensures that all processes can immediately engage in safety checks, improving system responsiveness and making the DBDAA suitable for dynamic and time-sensitive applications. Additionally, the DBDAA introduces a primary unsafe sequence mechanism that enhances the acceptability and efficiency of the algorithm by allowing processes to participate in safety checks repeatedly after a predetermined amount of system-defined time. Experimental comparisons with existing algorithms demonstrate the superiority of the DBDAA in terms of reduced safe state prediction time and increased efficiency, making it a robust solution for deadlock avoidance in real-time systems.
有效的资源分配在操作系统中至关重要，可以防止死锁，特别是在资源有限且不可共享的情况下。传统的方法，如银行家算法，提供了解决方案，但存在一些局限性，如静态进程处理、高时间复杂度和缺乏实时适应性。为了解决这些挑战，我们提出了动态银行家死锁避免算法（DBDAA）。DBDAA 为安全检查引入了实时处理，显著提高了系统效率并降低了死锁的风险。与传统方法不同，DBDAA 在安全检查中动态包含进程，大大减少了确定安全状态所需的比较次数。这种优化将时间复杂度从原始银行家算法的 O(n2d)降低到最佳情况下的 O(n)和平均情况下及最坏情况下的 O(nd)。实时处理的集成确保所有进程都可以立即进行安全检查，提高了系统的响应能力，使 DBDAA 适用于动态和时间敏感的应用程序。此外，DBDAA 引入了主要不安全序列机制，通过允许进程在系统定义的时间后重复参与安全检查，提高了算法的可接受性和效率。与现有算法的实验比较表明，DBDAA 在减少安全状态预测时间和提高效率方面具有优越性，是实时系统中避免死锁的一种强大解决方案。
