The Community for Technology Leaders
Parallel Architectures, Algorithms, and Networks, International Symposium on (2000)
Dallas/Richardson, Texas, USA
Dec. 7, 2000 to Dec. 7, 2000
ISSN: 1087-4089
ISBN: 0-7695-0936-3
pp: 178
In this paper we consider the problem of routing packets in two-dimensional torus-connected processor arrays. Motivated by recent theoretical work on dynamic routing, we address the dynamic case where packets are continuously injected into the network. We describe three greedy hot-potato routing algorithms and present simulation experiments on tori of several sizes using four well-known greedy (also known as work-conserving) protocols (namely FIFO, LIFO, FTG, and NTG) for the implementation of injection buffers. Our results demonstrate that there exists a greedy hot-potato routing algorithm that is stable for all greedy injection queueing protocols for injection rates very close to 100% of the network capacity. Furthermore, according to the algorithms we studied, we can claim that the one-pass property is not appropriate for the dynamic case, since the system cannot achieve stability at high injection rates.

I. Caragiannis, I. Vergados and C. Kaklamanis, "Greedy Dynamic Hot-Potato Routing on Arrays," Parallel Architectures, Algorithms, and Networks, International Symposium on(ISPAN), Dallas/Richardson, Texas, USA, 2000, pp. 178.
98 ms
(Ver 3.3 (11022016))