Modelling a fast parallel thinning algorithm for shared memory SIMD computers Academic Article

abstract

• 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.

authors

• Mahapatra, Rabinarayan

published proceedings

• Information Processing Letters

author list (cited authors)

• Mahapatra, R. N., & Pareek, H.

citation count

• 1

complete list of authors

• Mahapatra, Rabi N||Pareek, Harish

publication date

• December 1991

publisher

• Elsevier  Publisher

published in

• Information Processing Letters  Journal

Digital Object Identifier (DOI)

• 10.1016/0020-0190(91)90120-7

start page

• 257

end page

• 261

volume

• 40

issue

• 5

URL

• http%3A%2F%2Fdx.doi.org%2F10.1016%2F0020-0190%2891%2990120-7