On-line detection and resolution of communication deadlocks

Abstract

We present a new distributed algorithm that detects and resolves communication deadlocks on-line, i.e., simultaneously detects and resolves deadlock as communication requests are made, at no additional message traffic overhead, and with bounded delay between the occurrence and detection of a deadlock. This is achieved via a novel technique for detecting knots, which suffice for the existence of communication deadlocks. Current distributed deadlock detection algorithms lack these features. Thus the algorithm is suitable for soft real-time systems and large distributed systems. We also prove that the algorithm detects communication deadlocks and that it is able to deal with false deadlocks.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>