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

In the matter of busing

โœ Scribed by Kenneth B. Clark

Publisher
Springer Netherlands
Year
1972
Tongue
English
Weight
164 KB
Volume
6
Category
Article
ISSN
0042-0972

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Routing Problems on the Mesh of Buses
Routing Problems on the Mesh of Buses
โœ Kazuo Iwama; Eiji Miyano; Yahiko Kambayashi ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 175 KB

The mesh of buses MBUSs is a parallel computation model which consists of n = n processors, n row buses, and n column buses, but no local connections between neighboring processors. An n lower bound for the permutation routing on this model is shown. The proof does not depend on common predetermined

Oblivious Routing Algorithms on the Mesh
Oblivious Routing Algorithms on the Mesh of Buses
โœ Kazuo Iwama; Eiji Miyano ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 226 KB

An optimal W1.5N 1ร‚2 X lower bound is shown for oblivious routing on the mesh of buses: a two-dimensional parallel model consisting of N 1ร‚2 \_N 1ร‚2 processors and N 1ร‚2 row and N 1ร‚2 column buses but no local connections between neighboring processors. Many lower bound proofs for routing on mesh-st

On the Power of Segmenting and Fusing Bu
On the Power of Segmenting and Fusing Buses
โœ Jerry L. Trahan; Ramachandran Vaidyanathan; Ratnapuri K. Thiruchelvan ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 328 KB

Reconfigurable bus-based models of parallel computation have been shown to be extremely powerful, capable of solving several problems in constant time that require nonconstant time on conventional models such as the PRAM. The primary source of the power of reconfigurable bus-based models is their ab