Abstract
The problem of packet routing on n 1 × ... × n r mesh-connected arrays or grids of processors is studied. For two-dimensional grids a deterministic routing algorithm is given for n × n meshes where each processor has a buffer of size f(n)<n It needs 2n+O(n/f(n)) steps on grids without wrap-arounds. Hence it is asymptotically optimal and as good as randomized algorithms routing data only with high probability. Furthermore it is demonstrated that on r-dimensional cubes of processors packet routing can be performed by asymptotically (2r − 2)n steps which is faster than the running times of so far known randomized algorithms and of deterministic algorithms.KeywordsBuffer SizeCorrection PhaseDeterministic AlgorithmSorting AlgorithmAdditional BufferThese 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.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
