Search

1 article for “wait-for graph”

• Published Subscription Review Article 28 Apr 2026

  Data Structure Driven Probabilistic Deadlock Resolution in Multiprocessor Systems

  By Kakinada Mahitha Sri Ishwarya, Chegondi Revathi, Manas Kumar Yogi

  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 →