Loop Breaking Scheme for Deadlock Avoidance
Original Publication Date: 1978-Apr-01
Included in the Prior Art Database: 2005-Feb-20
In [*] a general method is proposed for the design of deadlock-free store-and-forward networks. The "loop-breaking" scheme is an implementation of the method which is very efficient in certain network configurations in the sense that virtual networks can be constructed which require very few buffers. The notation and nomenclature used here, as well as the fundamentals which show the correctness of the scheme, are given in [*].