Abstract
In this paper we consider the problem of routing packets in two-dimensional torus-connected processor arrays. We consider four algorithms which are either greedy in the sense that packets try to move towards their destination by adaptively using a shortest path, or have the property that the path traversed by any packet approximates the path traversed by the greedy routing algorithm in the store-and-forward model. In our experiments, we consider the static case of the routing problem where we study permutation and random destination input instances as well as the dynamic case of the problem under the stochastic model for the continuous generation of packets.
This work was partially funded by the European Union under IST FET Project ALCOM-FT and RTN Project ARACNE. An extended version of the paper can be found at http://students.ceid.upatras.gr/~caragian/bckv00.ps
Part of this work was performed while the author was at the Department of Computer Engineering and Informatics, University of Patras, Greece.
Chapter PDF
Keywords
These 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.
References
P. Baran. On Distributed Communication Networks. IEEE Transactions on Communications, pp. 1–9, 1964.
A. Bar-Noy, P. Raghavan, B. Shieber, and H. Tamaki. Fast Deflection Routing for Packets and Worms. In Proc. of the 12th Annual ACM Symposium on Principles of Distributed Computing, pp. 75–86, 1993.
I. Ben-Aroya, T. Eilam, and Schuster. Greedy Hot-Potato Routing on the Two-Dimensional Mesh. Distributed Computing, 9(1):3–19, 1995.
A. Borodin and J. Hopcroft. Routing, Merging, and Sorting on Parallel Models of Computation. Journal of Computer and System Sciences, 30:130–145, 1985.
A. Broder and E. Upfal. Dynamic Deflection Routing on Arrays. In Proc. of the 28th Annual ACM Symposium on the Theory of Computing, pp. 348–358, 1996.
C. Busch, M. Herlihy, and R. Wattenhofer. Randomized Greedy Hot-Potato Routing. In Proc. of the 11th Annual ACM/SIAM Symposium on Discrete Algorithms (SODA’ 00), pp. 458–466, 2000.
U. Feige and P. Raghavan. Exact Analysis of Hot-Potato Routing. In Proc. of the 33rd Annual IEEE Symposium on Foundations of Computer Science, pp. 553–562, 1992.
B. Hajek. Bounds on Evacuation Time for Deflection Routing. Distributed Computing, 5:1–6, 1991.
C. Kaklamanis, D. Krizanc, and S. Rao. Hot-Potato Routing on Processor Arrays. In Proc. of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 273–282, 1993.
M. Kaufmann, H. Lauer, and H. Schroder. Fast Deterministic Hot-Potato Routing on Meshes. In Proc. of the 5th International Symposium on Algorithms and Computation, LNCS 834, Springer-Verlag, pp. 333–341, 1994.
F.T. Leighton. Average Case Analysis of Greedy Routing Algorithm on Arrays. In Proc. of the 2nd Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 2–10, 1990.
I. Newman and A. Schuster. Hot-Potato Algorithms for Permutation Routing. IEEE Transactions on Parallel and Distributed Systems, 6(11): 1168–1176, 1995.
R. Prager. An Algorithm for Routing in Hypercube Networks. Master’s thesis, University of Toronto, 1986.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bartzis, C., Caragiannis, I., Kaklamanis, C., Vergados, I. (2000). Experimental Evaluation of Hot—Potato Routing Algorithms on 2—Dimensional Processor Arrays. In: Bode, A., Ludwig, T., Karl, W., Wismüller, R. (eds) Euro-Par 2000 Parallel Processing. Euro-Par 2000. Lecture Notes in Computer Science, vol 1900. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44520-X_122
Download citation
DOI: https://doi.org/10.1007/3-540-44520-X_122
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67956-1
Online ISBN: 978-3-540-44520-3
eBook Packages: Springer Book Archive