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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
