Adaptive multicast wormhole routing in 2D mesh multicomputer

Abstract

We study the issues of adaptive multicast wormhole routing in 2D mesh multicomputers. Three adaptive multicast wormhole routing strategies are proposed and studied, which include minimal partial adaptive, minimal fully adaptive and nonminimal multicast routing methods. All the algorithms are shown to be deadlock-free. These are the first deadlock-free adaptive multicast wormhole routing algorithms ever proposed. A simulation study has been conducted that compares the performance of these multicast algorithms. The results show that the minimal fully adaptive routing method creates the least traffic, however, double vertical channels are required in order to avoid deadlock. The nonminimal routing algorithm exhibits the best adaptivity, although it creates more network traffic than the other methods.KeywordsSource NodeDestination NodeHamiltonian PathVirtual ChannelDestination AddressThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.