Search
2 articles for “dynamic deadlock resolution”
-
Breaking Deadlocks: A Novel Method for Dynamic Deadlock Resolution in Concurrent Systems
Abstract: It is known that deadlock is one of the major challenges in concurrent systems, as sometimes this deadlock may lead to system failure as well as performance degradation. Traditional deadlock handling methods, for example, deadlock detection and prevention, have several limitations for systems that have a dynamic nature in which the structure of the system and the resource requirements change over time. In this article, we present a novel technique …
Published in Journal of Advances in Shell Programming · Vol. 10, Issue 3, 2023 · pp. 29–35 Read article
-
Data Structure Driven Probabilistic Deadlock Resolution in Multiprocessor Systems
Abstract: Deadlock resolution in multiprocessor systems is fundamentally a graph-theoretic and probabilistic decision problem. Existing victim selection heuristics, such as youngest, oldest, and lowest priority, apply static rules that overlook the dynamic runtime state of processes, leading to unnecessary computational loss. This paper reframes the inference-guided preemption (IGP) algorithm as a data-structure-centric solution, highlighting how resource allocation graphs, wait-for graphs, adjacency lists, min-heaps, and hash-based evidence stores interact to enable efficient …
Published in International Journal of Data Structure Studies · Vol. 4, Issue 1, 2026 · pp. 11–20 Read article