The Community for Technology Leaders
Green Image
<p><b>Abstract</b>—In this paper, we consider the deflection worm routing problem on <it>n</it>×<it>n</it> meshes. In deflection routing, a message cannot be queued and it is always moving until it reaches its destination. In worm routing, the message is considered to be a worm, a sequence of <it>k</it> flits which, during the routing, follow the head of the worm, which knows the destination address. We show how to derive a deflection worm routing algorithm from a packet routing algorithm which uses queues of size <it>O</it>(<it>f</it>(<it>N</it>)) (<it>N</it> is the side-length of the mesh in which the packet routing algorithm is applied). Our result generalizes the method of Newman and Schuster in which only packet routing algorithms with a maximum queue of four packets can be used.</p>
Deflection routing, mesh connected computer, on-line routing algorithm, packet routing, permutation routing, worm routing.

A. Roberts and A. Symvonis, "A General Method for Deflection Worm Routing on Meshes Based on Packet Routing Algorithms," in IEEE Transactions on Parallel & Distributed Systems, vol. 8, no. , pp. 781-789, 1997.
94 ms
(Ver 3.3 (11022016))