Kazuo Iwama, Yahiko Kambayashi, Eiji Miyano  Home/Search
Context Related
| emis.de/EMS/journa...ama%2B01.5.5.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: emis.de/EMS/journals/JGAA/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: 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(N^0.75) algorithm on the two-dimensional, N^0.5 by N^0.5 mesh with constant queue-size. This is the first algorithm which improves substantially the trivial O(N) bound for oblivious routing in the mesh networks with constant queue-size. The other is a 1.16 N^0.5 +o(N^0.5) algorithm on the three-dimensional, N^1/3 by N^1/3 by N^1/3 mesh with... (Update)
Context of citations to this paper: More
...of bidirectional communication links. An oblivious k k routing algorithm on the d dimensional mesh needs at least W(k ) steps. In [2] Iwama, Miyama and Kambayashi presented the first non trivial oblivious 1 1 routing algorithm that uses O(1) buffers for d dimensional meshes....
...dramatically at the cost of increasing the constant for their buffer size. Further Iwama, Kambayashi, and Miyano presented in [7] a technique to obtain an oblivious permutation routing algorithm using constant buffer size for threedimensional meshes from an algorithm for...
Cited by: More
Oblivious Routing on d-dimensional Meshes - Osterloh (2001) (Correct)
Optimal Oblivious Routing on D-Dimensional Meshes - Osterloh (Correct)
Active bibliography (related documents): More All
0.3: Routing and Sorting on Fixed Topologies - Suel (1994) (Correct)
0.2: Packet Routing in Fixed-Connection Networks: A Survey - Grammatikakis, Hsu.. (1998) (Correct)
0.2: On the Hot-Potato Permutation Routing Algorithm of Borodin.. - Richard Thomas (Correct)
Similar documents based on text: More All
0.5: Transformation Rules for Designing CNOT-based - Quantum Circuits Kazuo (2002) (Correct)
0.4: Local Search Algorithms for Partial MAXSAT - Cha, Iwama, Kambayashi, Miyazaki (1997) (Correct)
0.3: Super-Key Classes for Updating Materialized Derived Classes .. - Konomi, Kambayashi (1993) (Correct)
Related documents from co-citation: More All
2: Introduction to Parallel Algorithms and Architectures: Arrays ffl Trees ffl Hype.. (context) - Leighton - 1992
2: Packet routing in fixed-connection networks: a survey - Grammatikakis, Hsu et al. - 1998
2: oblivious routing algorithm on 2d meshes (context) - Iwama, Miyano - 2000
BibTeX entry: (Update)
K. Iwama, Y. Kambayashi, and E. Miyano. New bounds for oblivious mesh routing. Journal of Graph Algorithms and Applications, 5(5):17--38, 2001. http://citeseer.ist.psu.edu/iwama01new.html More
@inproceedings{ iwama98new,
author = "Kazuo Iwama and Yahiko Kambayashi and Eiji Miyano",
title = "New Bounds for Oblivious Mesh Routing",
booktitle = "European Symposium on Algorithms",
pages = "295-306",
year = "1998",
url = "citeseer.ist.psu.edu/iwama01new.html" }
Citations (may not include all citations):981 Introduction to Parallel Algorithms and Architectures: Array.. (context) - Leighton - 1992
145 Universal schemes for parallel communication (context) - Valiant, Brebner
43 Tight bounds for oblivious routing in the hypercube (context) - Kaklamanis, Krizanc et al. - 1991
30 Fast deflection routing for packets and worms (context) - Bar-Noy, Raghavan et al.
25 Routing, merging, and sorting on parallel models of computat.. (context) - Borodin, Hopcroft - 1985
25 Deterministic permutation routing on meshes - Sibeyn, Chlebus et al. - 1997
18 Simple path selection for optimal routing on processor array.. (context) - Kaklamanis, Krizanc et al.
8 Minimal adaptive routing on the mesh with bounded queue size - Chinn, Leighton et al. - 1996
4 Lecture notes on message routing in parallel machines - Tompa - 1994
2 Three-dimensional meshes are less powerful than two-dimensio.. (context) - Iwama, Miyano - 1997
1 Oblivious routing with limited bu#er capacity (context) - Krizanc - 1991
1 How much can hardware help routing - Borodin, Raghavan et al.
1 A 2n - 2 step algorithm for routing in an n n array with con.. (context) - Leighton, Makedon et al.
Documents on the same site (http://www.emis.de/EMS/journals/JGAA/): More
Finding All the Best Swaps of a Minimum Diameter Spanning .. - Nardelli, Proietti, al. (2001) (Correct)
Computing an Optimal Orientation of a Balanced.. - Bar-Yehuda, Even.. (2001) (Correct)
Carrying Umbrellas: An Online Relocation Game on a Graph - Lee, al. (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC