Modelling a fast parallel thinning algorithm for shared memory SIMD computers
- Additional Document Info
- View All
We present the mapping of a parallel thinning algorithm on shared memory SIMD computers. Four models of SM SIMD computers are considered. The parallel thinning algorithm is presented for all these four models of computers. The algorithm has been analyzed for time and cost performance on four models of SM SIMD computers. It has been shown that the CREW/CRCW SM SIMD thinning algorithm is cost optimal under a certain condition. A different condition makes the algorithm cost optimal on EREW/ERCW SM SIMD computers. 1991.
Information Processing Letters
author list (cited authors)
Mahapatra, R. N., & Pareek, H.
complete list of authors
Mahapatra, Rabi N||Pareek, Harish