ADAPTIVE WORMHOLE ROUTING IN K-ARY N-CUBES

Distributed memory multiprocessor (DMMP) systems have gained much atte ntion because their performance can be easily scaled up by increasing the number of processor-memory modules. The k-ary n-cube is the most p opular interconnection network topology currently used in DMMPs. Wormh ole routing is one of the most promising switching technology and has been used in many new generation multicomputers. Wormhole routing make s the communication latency insensitive to the network diameter and re duces the size of the channel buffer of each router. The concept of vi rtual channels and virtual networks are widely invented for deadlock-f ree design. A fully adaptive wormhole routing method for k-ary n-cubes has been proposed by Linder in 1991 [10]. Unfortunately, the need of 2(n-1) virtual networks makes it unreasonable. In this paper, we propo se a virtual network system to support an adaptive, minimal and deadlo ck free routing in k-ary n-cubes. It uses only four virtual networks b ut can get a higher degree of adaptability and higher traffic capacity . Simulation results are presented to verify the performance.