登入選單

返回Google圖書搜尋

An EREW Parallel Algorithm for List Ranking Image Curves in O(log N) Time

Ling Tony Chen

出版	University of Maryland, Center for Automation Research, Computer Vision Laboratory, 1991
URL	http://books.google.com.hk/books?id=0V7NHAAACAAJ&hl=&source=gbs_api

註釋

Abstract: "This paper describes an algorithm for ranking the pixels on an image curve in O(log N) time using an EREW PRAM model. The algorithm accomplishes this with N processors for a [square root of N] x [square root of N] image, although it could be done optimally with N/log N processors if we are willing to use a more complicated list ranking algorithm such as that of Anderson and Miller [1]. Several complications that arise due to the restriction to exclusive read are discussed. Problems that arise when implementing the algorithm on a distributed memory parallel machine instead of a shared memory PRAM are also discussed. The algorithm was implemented on the Connection Machine, and various performance tests were conducted."