Wormhole Routing in Parallel Computers
Ayse Yasemin Seydim · 2001
In order to offer low communication latency and reduced buffer requirements, wormhole routing has been used in almost all new generation parallel computers. It has been a powerful switching technique where its communication latency is distance insensitive. On the other hand, deadlock avoidance is the most critical issue in wormhole networks. If deadlock handling is not considered, wormhole routers can not be used in multiprocessors. Also, performance and fault-tolerancy are two dominant issues in the design of interconnection networks of large-scale multiprocessor architectures. In this paper, only a brief review of wormhole routing issues mentioned could be made amongst the extensive published works.