Efficient deadlock-free routing
Baruch Awerbuch, Shay Kutten, David Peleg · 1991
This paper deals with store-and-forward deadlocks in communication networks.The goal is to design deadlock-free routing schemes with small overhead in communication and space.Our main contribution is designing efficient protocols that are superior to existing ones in terms of their performance.