Performance Evaluations Of Adaptive Wormhole Routing In 3D Mesh Networks

Abstract

The performance of interconnection networks can be improved drastically by using wormhole routing and virtual channel flow control. Adaptive routing strategies, which are superior to oblivious routing, supply a set of alternative output virtual channels associated with different physical links, when a message is routed. A selection function selects a free one from the set. In this paper, we have evaluated the performance of three adaptive wormhole routing algorithms with minimum paths in 3D mesh networks: Dynamic Routing proposed by Dally and Aoki, Negative Last routing developed by Glass and Ni based on their Turn Model and Full Dynamic Routing proposed by us based on Duato’s adaptive routing theory. Three different selection functions, namely Static, Random and Greedy have been compared.