✦ LIBER ✦

String editing on an SIMD hypercube multicomputer

✍ Scribed by Sanjay Ranka; Sartaj Sahni

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 786 KB
Volume: 9
Category: Article
ISSN: 0743-7315
DOI: 10.1016/0743-7315(90)90125-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Quadtree Building Algorithms on an SIMD

Quadtree Building Algorithms on an SIMD Hypercube

✍ O.H. Ibarra; M.H. Kim 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 555 KB

We present \(O(\log n)\) time SIMD hypercube algorithms for transforming binary images to linear quadtrees and vice versa, where \(n\) is the size of the images as well as the number of hypercube nodes. Our quadtree building algorithm, which generates the locational codes in preorder, is an improvem

Distributed evaluation of an iterative f

Distributed evaluation of an iterative function for all object pairs on an SIMD hypercube

✍ Fikret Erçal 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 899 KB

An Efficient Implementation of Batcher′s

An Efficient Implementation of Batcher′s Odd-Even Merge on a SIMD Hypercube

✍ D. Nassimi; Y.D. Tsai 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 469 KB

We present an efficient \(\theta(\log N)\) implementation of Batcher's odd-even merge on a SIMD hypercube. (The hypercube model assumes that all communications are restricted to one fixed dimension at a time.) The best previously known implementation of odd-even merge on a SIMD hypercube requires \(