Advertisement
Published in:
2008 | OriginalPaper | Chapter
Deterministic Hot-Potato Permutation Routing on the Mesh and the Torus
Author : Andre Osterloh
Published in: Theory and Applications of Models of Computation
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
In this paper we consider deterministic hot-potato routing algorithms on
n
×
n
meshes and tori. We present algorithms for the permutation routing problem on these networks and achieve new upper bounds. The basic ideas used in the presented algorithms are sorting, packet concentration and fast algorithms for one-dimensional submeshes. Using this ideas we solve the permutation routing problem in 3.25
n
+
o
(
n
) steps on an
n
×
n
mesh and in 2.75
n
+
o
(
n
) steps on an
n
×
n
torus.