๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An optimal time bound for oblivious routing

โœ Scribed by Ian Parberry

Book ID
105325629
Publisher
Springer
Year
1990
Tongue
English
Weight
454 KB
Volume
5
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A Lower Bound for Elementary Oblivious R
A Lower Bound for Elementary Oblivious Routing on Three-Dimensional Meshes
โœ Kazuo Iwama; Eiji Miyano ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 434 KB

This paper shows an important exception to the common perception that three-dimensional meshes are more powerful than two-dimensional ones. Let N be the total number of processors. Then permutation routing over three-dimensional mesh computers needs N 2/3 steps while it takes N 1/2 steps over twodim