Experimental Evaluation of Hot-Potato Routing Algorithms on 2-Dimensional Processor Arrays (Research Note)

Authors:
Constantinos Bartzis;Ioannis Caragiannis;Christos Kaklamanis;Ioannis Vergados
Affiliations:
-;-;-;-
Venue:
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
Year:
2000

Citing 10
Cited 0

Routing, merging, and sorting on parallel models of computation

Journal of Computer and System Sciences
Average case analysis of greedy routing algorithms on arrays

SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Fast deflection routing for packets and worms

PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Dynamic deflection routing on arrays (preliminary version)

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Randomized greedy hot-potato routing

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Hot-potato routing on processor arrays

SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Hot-Potato Algorithms for Permutation Routing

IEEE Transactions on Parallel and Distributed Systems
Fast Deterministic Hot-Potato Routing on Processor Arrays

ISAAC '94 Proceedings of the 5th International Symposium on Algorithms and Computation
Bounds on evacuation time for deflection routing

Distributed Computing
Exact analysis of hot-potato routing

SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.