The connection machine
Processing geometric representations on SIMD computers (Parallel processing, mesh-connected computer)
Deterministic Parallel List Ranking
AWOC '88 Proceedings of the 3rd Aegean Workshop on Computing: VLSI Algorithms and Architectures
The complexity of parallel computations
The complexity of parallel computations
Scalable Parallel Implementations of List Ranking on Fine-Grained Machines
IEEE Transactions on Parallel and Distributed Systems
A Fast Parallel Algorithm for Convex Hull Problem of Multi-Leveled Images
Journal of Intelligent and Robotic Systems
Time and work optimal simulation of basic reconfigurable meshes on hypercubes
Journal of Parallel and Distributed Computing
Journal of Intelligent and Robotic Systems
| Hi-index | 0.14 |
Describes two parallel algorithms for ranking the pixels on a curve in O (log N) time using either an EREW or CREW PRAM model. The algorithms accomplish this with N processors for a square root N* square root N image. After applying such an algorithm to an image, it is possible to move the pixels from a curve into processors having consecutive addresses. This is important because one can subsequently apply many algorithms to the curve (such as piecewise linear approximation algorithms or point in polygon tests) using segmented scan operations (i.e. parallel prefix operations). Scan operations can be executed in logarithmic time on many interconnection networks, such as hypercube, tree, butterfly, and shuffle exchange machines as well as on the EREW PRAM. The algorithms were implemented on the hypercube structured Connection Machine, and various performance tests were conducted.