New Bounds for Oblivious Mesh Routing

13 years 10 months ago

Download www.emis.de

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

Real-time Traffic

Algorithms | ESA 1998 | Mesh Networks | Oblivious Permutation | Oblivious Routing |

claim paper

» Nearoptimal oblivious routing on threedimensional mesh networks

» Oblivious Routing in OnChip BandwidthAdaptive Networks

» Randomized PartiallyMinimal Routing on ThreeDimensional Mesh Networks

» Weighted random oblivious routing on torus networks

» Dynamic Packet Routing on Arrays with Bounded Buffers

» Online ThroughputCompetitive Algorithm for Multicast Routing and Admission Control

» A Fully Adaptive Routing Algorithm for Dynamically Injured Hypercubes Meshes and Tori

» TimeConstrained Scheduling of Weighted Packets on Trees and Meshes

Post Info
More Details (n/a)

Added	05 Aug 2010
Updated	05 Aug 2010
Type	Conference
Year	1998
Where	ESA
Authors	Kazuo Iwama, Yahiko Kambayashi, Eiji Miyano

Comments (0)

Sciweavers

New Bounds for Oblivious Mesh Routing

Algorithms | ESA 1998 | Mesh Networks | Oblivious Permutation | Oblivious Routing |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers