Sciweavers

Share
ESA
1998
Springer

New Bounds for Oblivious Mesh Routing

8 years 8 months ago
New Bounds for Oblivious Mesh Routing
We give two, new upper bounds for oblivious permutation routing on the mesh networks: Let N be the total number of processors in each mesh. One is an O(N0.75 ) algorithm on the two-dimensional, N
Kazuo Iwama, Yahiko Kambayashi, Eiji Miyano
Added 05 Aug 2010
Updated 05 Aug 2010
Type Conference
Year 1998
Where ESA
Authors Kazuo Iwama, Yahiko Kambayashi, Eiji Miyano
Comments (0)
books