A new bound for pure greedy hot potato routing

Authors:
Manfred Kunde
Affiliations:
Technical University of Ilmenau, Institute for Theoretical Computer Science
Venue:
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Year:
2007

Citing 11
Cited 1

Routing, merging, and sorting on parallel models of computation

Journal of Computer and System Sciences
The connection machine

The connection machine
Potential function analysis of greedy hot-potato routing

PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Randomized greedy hot-potato routing

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Hard-Potato routing

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
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
Deterministic Many-to-Many Hot Potato Routing

IEEE Transactions on Parallel and Distributed Systems
Mosaic C: An Experimental Fine-Grain Multicomputer

Proceedings of the International Conference on Future Tendencies in Computer Science, Control and Applied Mathematics
Fast Deterministic Hot-Potato Routing on Processor Arrays

ISAAC '94 Proceedings of the 5th International Symposium on Algorithms and Computation
Exact analysis of hot-potato routing

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

Deterministic hot-potato permutation routing on the mesh and the torus

TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new bound for pure greedy hot potato routing on n×n mesh-connected arrays and n×n tori. For permutation problems the bound is O(n√nlog n) steps which improves the for a long time known bound of O(n2). For the more general link-limited k-destination routing problem the bound is O(n√knlogn). The bound also holds for restricted pure greedy hot potato routing on n×n meshes with diagonals. The bound could be derived by a new technique where packets may have several identities.