✦ LIBER ✦

Radix sort on the hypercube

✍ Scribed by Giovanni Manzini

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 640 KB
Volume: 38
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(91)90226-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Pipelined Parallel Prefix Computations,

Pipelined Parallel Prefix Computations, and Sorting on a Pipelined Hypercube

✍ Ernst W. Mayr; C.Greg Plaxton 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 601 KB

Data broadcasting and reduction, prefix

Data broadcasting and reduction, prefix computation, and sorting on reduced hypercube parallel computers

✍ Sotirios G. Ziavras; Arup Mukherjee 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 897 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

Response set on the SORT revisited

✍ Philip Langer; Thomas L. Hick 📂 Article 📅 1965 🏛 John Wiley and Sons 🌐 English ⚖ 114 KB 👁 2 views

Parallelizing object recognition on the

Parallelizing object recognition on the hypercube

✍ Suchendra M Bhandarkar 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 635 KB

On the area of hypercube layouts

✍ Ronald I. Greenberg; Lee Guan 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 106 KB

This paper precisely analyzes the wire density and required area in standard layout styles for the hypercube. It shows that the most natural, regular layout of a hypercube of N 2 nodes in the plane, in an N × N grid arrangement, uses 2N/3 + 1 horizontal wiring tracks for each row of nodes. (In the p