de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Disclaimer Contact us Login
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Report

Deterministic 1-k routing on meshes with applications to worm-hole routing

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons45478

Sibeyn,  Jop
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons44745

Kaufmann,  Michael
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Locator
There are no locators available
Fulltext (public)

MPI-I-93-163.pdf
(Any fulltext), 233KB

Supplementary Material (public)
There is no public supplementary material available
Citation

Sibeyn, J., & Kaufmann, M.(1993). Deterministic 1-k routing on meshes with applications to worm-hole routing (MPI-I-93-163). Saarbrücken: Max-Planck-Institut für Informatik.


Cite as: http://hdl.handle.net/11858/00-001M-0000-0014-B431-7
Abstract
In $1$-$k$ routing each of the $n^2$ processing units of an $n \times n$ mesh connected computer initially holds $1$ packet which must be routed such that any processor is the destination of at most $k$ packets. This problem reflects practical desire for routing better than the popular routing of permutations. $1$-$k$ routing also has implications for hot-potato worm-hole routing, which is of great importance for real world systems. We present a near-optimal deterministic algorithm running in $\sqrt{k} \cdot n / 2 + \go{n}$ steps. We give a second algorithm with slightly worse routing time but working queue size three. Applying this algorithm considerably reduces the routing time of hot-potato worm-hole routing. Non-trivial extensions are given to the general $l$-$k$ routing problem and for routing on higher dimensional meshes. Finally we show that $k$-$k$ routing can be performed in $\go{k \cdot n}$ steps with working queue size four. Hereby the hot-potato worm-hole routing problem can be solved in $\go{k^{3/2} \cdot n}$ steps.