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

Randomized Partially-Minimal Routing on Three-Dimensional Mesh Networks

โœ Scribed by Sunkam Ramanujam, Rohit; Lin, Bill

Book ID
114572073
Publisher
IEEE
Year
2008
Tongue
English
Weight
114 KB
Volume
7
Category
Article
ISSN
1556-6056

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