Publications (1)0 Total impact
-
[show abstract]
[hide abstract]
ABSTRACT: This paper presents a new algorithm for the detection and resolution of communication deadlocks in distributed systems. The algorithm is based on some well known concepts for distributed deadlock detection and adds some new features to reduce message- and space complexity. It was implemented on a transputer network and shown to be more efficient than previously published algorithms. 1 Introduction In message-based distributed systems the occurrence of communication deadlocks is an inherent problem. A synchronizing exchange of messages between two processes forces the process which arrives at its communication statement first to wait as long as the other processing unit is ready to perform the corresponding communication statement. A number of processing units which are directly or indirecly waiting for each other and whose waiting is endless regardless of any communication which might subsequently be initiated are said to be in a deadlock. In general deadlocks are classified into the A...
12/1997;
