An algorithm for preventing deadlocks in distributed systems

Abstract

The authors deal with a new method for preventing deadlocks in resource sharing for distributed systems. The algorithm is based on the notion of coloring the nodes of the waitfor graph and is built on a signaling mechanism which can be implemented on an underlying routing protocol. This algorithm supports multiple resources and multiple outstanding requests. The proof of correctness of the algorithm is also presented.<>