✦ LIBER ✦

Randomized routing on generalized hypercubes

✍ Scribed by Afonso Ferreira; Miltos Grammatikakis

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 872 KB
Volume: 158
Category: Article
ISSN: 0304-3975
DOI: 10.1016/0304-3975(95)00041-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimal fully adaptive wormhole routing

Minimal fully adaptive wormhole routing on hypercubes

✍ Chiu-Chuan Lin; Ferng-Ching Lin 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 431 KB

Oblivious routing for LC permutations on

Oblivious routing for LC permutations on hypercubes

✍ Zhiyong Liu; David W. Cheung 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 197 KB

Randomized Selection on the Hypercube

✍ Sanguthevar Rajasekaran 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 258 KB

In this paper, we present randomized algorithms for selection on the hypercube. We identify two variants of the hypercube, namely, the sequential model and the parallel model. In the sequential model, any node at any time can handle only communication along a single incident edge, whereas in the par

From Hall's Matching Theorem to Optimal

From Hall's Matching Theorem to Optimal Routing on Hypercubes

✍ Shuhong Gao; Beth Novick; Ke Qiu 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 218 KB

We introduce a concept of so-called disjoint ordering for any collection of finite sets. It can be viewed as a generalization of a system of distinctive representatives for the sets. It is shown that disjoint ordering is useful for network routing. More precisely, we show that Hall's ``marriage'' co

Parallel maze routing on hypercube compu

Parallel maze routing on hypercube computers

✍ R. Mall; L.M. Patnaik 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 463 KB

Maze routing on a hypercube multicompute

Maze routing on a hypercube multicomputer

✍ Youngju Won; Sartaj Sahni 📂 Article 📅 1988 🏛 Springer US 🌐 English ⚖ 1010 KB

The implementation of Lee's maze routing algorithm on an MIMD hypercube multiprocessor computer can follow several plausible mappings and synchronization strategies. These are evaluated experimentally on an NCUBE/7 hypercube computer with 64 processors. Different grid partitioning and mapping strate