This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
11th International Parallel Processing Symposium (IPPS '97)
Optimal Wormhole Routing in the (n,d)-Torus
Geneva, SWITZERLAND
April 01-April 05
ISBN: 0-8186-7792-9
Stefan Bock, University of Paderborn, Germany
Friedhelm Meyer auf der Heide, University of Paderborn, Germany
Christian Scheideler, University of Paderborn, Germany
In this paper we consider wormhole routing in a d-dimensional torus of side length n. In particular, we present an optimal randomized algorithm for routing worms of length up to O(n/(d log n)^2), one per node, to random destinations. Previous algorithms only work optimally for two dimensions, or are a factor of log n away from the optimal running time. As a by-product, we develop an algorithm for the 2-dimensional torus that guarantees an optimal runtime for worms of length up to O(n/(log n)^2) with much higher probability than all previous algorithms.
Citation:
Stefan Bock, Friedhelm Meyer auf der Heide, Christian Scheideler, "Optimal Wormhole Routing in the (n,d)-Torus," ipps, pp.326, 11th International Parallel Processing Symposium (IPPS '97), 1997
Usage of this product signifies your acceptance of the Terms of Use.