ESA
1998
Springer
14 years 3 months ago
1998
Springer
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 tw...