✦ LIBER ✦

Tight bounds for oblivious routing in the hypercube

✍ Scribed by Christos Kaklamanis; Danny Krizanc; Thanasis Tsantilas

Book ID: 105458570
Publisher: Springer
Year: 1991
Tongue: English
Weight: 584 KB
Volume: 24
Category: Article
ISSN: 1433-0490
DOI: 10.1007/bf02090400

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

An optimal time bound for oblivious rout

An optimal time bound for oblivious routing

✍ Ian Parberry 📂 Article 📅 1990 🏛 Springer 🌐 English ⚖ 454 KB

Comments on the Oblivious Routing Algori

Comments on the Oblivious Routing Algorithm of Kaklamanis, Krizanc, and Tsantilas in the Hypercube

✍ F. K. Hwang; Y. C. Yao 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 63 KB

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

Traffic-Oblivious Routing in the Hose Mo

Traffic-Oblivious Routing in the Hose Model

✍ Kodialam, Murali; Lakshman, T. V.; Sengupta, Sudipta 📂 Article 📅 2011 🏛 IEEE 🌐 English ⚖ 353 KB

Use of routing capability for fault-tole

Use of routing capability for fault-tolerant routing in hypercube multicomputers

✍ Ge-Ming Chiu; Kai-Shung Chen 📂 Article 📅 1997 🏛 IEEE 🌐 English ⚖ 80 KB