This article introduces a self-stabilizing deadlock-detection algorithm for the OR model. The algorithm is complete, because it detects all deadlocks, and it is correct, because it does not detect false deadlocks. Because of the self-stabilization property, the algorithm supports dynamic changes in the wait-for graph on which it works, and transient faults; also, it can be started in an arbitrary state. Previous deadlock-detection algorithms for the OR model are not guaranteed to recover from transient faults, nor can they be started in an arbitrary state. Once the algorithm terminates, each process knows if it is or not deadlocked; moreover, deadlocked processes know whether they cause or only suffer from deadlock. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Orellana, C. F., Ruz, C., & Eterovic S., Y. (2006). Self-stabilizing deadlock detection under the or requirement model. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4128 LNCS, pp. 559–570). Springer Verlag. https://doi.org/10.1007/11823285_58
Mendeley helps you to discover research relevant for your work.