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

Embedding shuffle networks in hypercubes

โœ Scribed by Ravi Varadarajan

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
485 KB
Volume
11
Category
Article
ISSN
0743-7315

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Embedding de Bruijn, Kautz and shuffle-e
Embedding de Bruijn, Kautz and shuffle-exchange networks in books
โœ Toru Hasunuma; Yukio Shibata ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 839 KB

We show that the de Bruijn digraph B(d,D), D > 1 and the Kautz digraph K(d,D) can be embedded in (d + 1) pages with cumulative pagewidth ~dDe2(3d3 -2d2 + 4d -d(d mod 2) ~ 4) and idD-'(3d' + 4d + (d mod2)), respectively. Also we show that the shuffle-exchange graph S(D; D > 2 can be embedded in 3 pag

Embeddings in hypercubes
Embeddings in hypercubes
โœ Marilynn Livingston; Quentin F. Stout ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 618 KB
Incomplete Hypercubes: Embeddings of Tre
Incomplete Hypercubes: Embeddings of Tree-Related Networks
โœ S. Ohring; S.K. Das ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 911 KB

We consider the incomplete hypercubes, a generalization of the binary hypercube networks in the sense that the number of nodes can be arbitrary as opposed to a strict power of 2 . The capability of the incomplete hypercubes to execute parallel programs is studied here using graph embedding technique

Embedding Hypercubes and Related Network
Embedding Hypercubes and Related Networks into Mesh-Connected Processor Arrays
โœ F. Annexstein ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 736 KB

In this paper we study the problem of how computations programmed for hypercubes, and their bounded-degree relatives, the shuffle-exchange and cube-connected-cycles, can be efficiently emulated by mesh-connected arrays of processing elements. The emulations we present are implemented via graph embed