𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Efficient histogramming on hypercube SIMD machines

✍ Scribed by Wei-Ming Lin; V.K. Prasanna Kumar

Publisher
Elsevier Science
Year
1990
Weight
1016 KB
Volume
49
Category
Article
ISSN
0734-189X

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

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 \(