✦ LIBER ✦

Lower bounds for sorting on mesh-connected architectures

✍ Scribed by Manfred Kunde

Publisher: Springer-Verlag
Year: 1987
Tongue: English
Weight: 531 KB
Volume: 24
Category: Article
ISSN: 0001-5903
DOI: 10.1007/bf00264359

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

A unified algorithm for sorting on multi

A unified algorithm for sorting on multidimensional mesh-connected processors

✍ Peter F. Corbett; Isaac D. Scherson 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 938 KB

Reducing communication costs for sorting

Reducing communication costs for sorting on mesh-connected and linearly connected parallel computers

✍ Arvin Park; K. Balasubramanian 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 503 KB

On the power of global-bus in mesh-conne

On the power of global-bus in mesh-connected architectures

✍ Hiroshi Umeo; Thomas Worsch; Roland Vollmar 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 677 KB

Connected component labeling for binary

Connected component labeling for binary images on a reconfigurable mesh architecture

✍ Prabir Bhattacharya 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 311 KB

We show how some existing component labeling algorithms for binary images could be speeded up by using the reconfigurable mesh architecture. Two algorithms are presented, the first one uses the ability of the reconfigurable mesh to perform certain operations in constant time, and the second one uses

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