✦ LIBER ✦

A lower bound for permutation routing on two-dimensional bused meshes

✍ Scribed by S. Cheung; F.C.M. Lau

Book ID: 107766140
Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 377 KB
Volume: 45
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(93)90208-q

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Optimal algorithms for the many-to-one r

Optimal algorithms for the many-to-one routing problem on two-dimensional meshes

✍ Fillia Makedon; Antonios Symvonis 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 749 KB

Time lower bounds for sorting on multi-d

Time lower bounds for sorting on multi-dimensional mesh-connected processor arrays

✍ Yijie Han; Yoshihide Igarashi 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 604 KB

Lower bounds for on-line two-dimensional

Lower bounds for on-line two-dimensional packing algorithms

✍ Donna J. Brown; Brenda S. Baker; Howard P. Katseff 📂 Article 📅 1982 🏛 Springer-Verlag 🌐 English ⚖ 663 KB

A lower bound for the two-dimensional He

A lower bound for the two-dimensional Helmholtz equation

✍ J. D. Helps; P. Daly 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 362 KB

A $2d - 1$ Lower Bound for Two-Layer Kno

A $2d - 1$ Lower Bound for Two-Layer Knock-Knee Channel Routing

✍ Leighton, Tom 📂 Article 📅 1994 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 984 KB