DocumentCode
1660673
Title
Routing on meshes in optimum time and with really small queues
Author
Chlebus, Bogdan S. ; Sibeyn, Jop F.
Author_Institution
Dept. of Comput. Sci. & Eng., Colorado Univ., Denver, CO, USA
fYear
2003
Abstract
We consider permutation routing problems on 2D and 3D mesh-connected computers with side length n. Our main result is a deterministic online algorithm routing on 2D meshes, operating in worst-case time T = 2n + 𝒪(1) and with queue size Q = 3. We also develop offline routing algorithms with performance bounds T = 2n - 1 and Q = 2 for 2D meshes, and T = 3n - 2 and Q = 4 for 3D meshes. We also show that is it possible to route most of the permutations on 2D meshes offline in time T = 2n - 2 with Q = 1.
Keywords
computational complexity; deterministic algorithms; multiprocessor interconnection networks; network routing; 2D mesh-connected computers; 3D mesh-connected computers; deterministic online algorithm; offline routing algorithms; performance bounds; permutation routing problems; really small queues; worst-case time; Buffer storage; Computer science; Distributed processing; Measurement; Polynomials; Routing protocols;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel and Distributed Processing Symposium, 2003. Proceedings. International
ISSN
1530-2075
Print_ISBN
0-7695-1926-1
Type
conf
DOI
10.1109/IPDPS.2003.1213148
Filename
1213148
Link To Document