Complete exchange algorithms in wormhole-routed torus networks : a divide-and-conquer strategy

We present efficient all-to-all personalized communication algorithms for a 2D torus in wormhole-routed networks. Our complete exchange algorithm adopts divide-and-conquer approach to reduce the start-up latency significantly, which is a good metric for network performance in wormhole networks. The first algorithm recursively divides the whole network into 2/spl times/2 networks. After specially designated nodes called master nodes have collected messages, whose destinations are the rest of the basic cells, only master nodes perform complete exchange with reduced network size. Upon finishing this complete exchange among master nodes, these nodes distribute messages to the rest of the master nodes, which results in the desired complete exchange. The second algorithm, which is more practical than the first one, divides the network only once. After we present these new algorithms, we analyze time complexities and compare several algorithms. We show that our practical algorithm is efficient by a factor of 2 in the required start-up time which means that our algorithm is suitable for wormhole-routed networks.