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

• Type: Conference
• Year: 1998
• Where: ESA
• Authors: Kazuo Iwama, Yahiko Kambayashi, Eiji Miyano
• Keywords: Algorithms, ESA 1998, Mesh Networks, Oblivious Permutation, Oblivious Routing