𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Oblivious routing for LC permutations on hypercubes

✍ Scribed by Zhiyong Liu; David W. Cheung

Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
197 KB
Volume
25
Category
Article
ISSN
0167-8191

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Rearrangeable Circuit-Switched Hypercube
Rearrangeable Circuit-Switched Hypercube Architectures for Routing Permutations
✍ S.B. Choi; A.K. Somani πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 496 KB

Rearrangeable hypercube architectures and routing algorithms are developed to realize arbitrary permutations in circuit switching. We prove that if each connection between two neighboring nodes consists of two pairs of links (two full-duplex communication lines), the hypercube can handle two arbitra

Routing Permutations on Hypercube Machin
Routing Permutations on Hypercube Machines with Half-Duplex Links
✍ C.S. Raghavendra; M.A. Sridhar πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 466 KB

Algorithms are presented for realizing permutations on a less restrictive hypercube model called the S-MIMD (synchronous MIMD), which allows at most one data transfer on a given communication link at a given time instant, and where data movements are not restricted to a single dimension at a given t

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

An Efficient Algorithm for Gray-to-Binar
An Efficient Algorithm for Gray-to-Binary Permutation on Hypercubes
✍ C.T. Ho; M.T. Raghunath; S.L. Johnsson πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 539 KB

Both Gray code and binary code are frequently used in mapping arrays into hypercube architectures. While the former is preferred when communication between adjacent array elements is needed, the latter is preferred for FFT-type communication. When different phases of computations have different type