Cyclic routing in wormhole networks
David C. Blight, Robert D. McLeod · 2002
This paper discusses deadlock free routing algorithms for wormhole routing in which there are cycles in the channel dependency graph (CDG). Wormhole routing is designed to offer the best characteristics of both circuit switched and packet switched networks. Messages can be routed between channels which introduce cycles in the CDG as long as messages do not wait for these channels. These results have applications in implementing adaptive routing algorithms.