Efficient Histogramming on Hypercube SIMD Machines

Abstract This paper considers the histogramming problem on hypercube. N -PE hypercube is used to process an N 12 × N 12 digitized image in which each pixel has a gray-level value between 0 and M − 1. In general, M , the range of gray-level values is much smaller than N , the number of pixels being processed. Our algorithm generates the histogram of the image in O (log M * log N ) time using radix sort and efficient data movement operations. This technique can be implemented on butterfly, shuffle-exchange and fat pyramid organizations.

[1]  Sartaj Sahni,et al.  Parallel permutation and sorting algorithms and a new generalized connection network , 1982, JACM.

[2]  W. Daniel Hillis,et al.  The connection machine , 1985 .

[3]  Azriel Rosenfeld,et al.  Digital Picture Processing , 1976 .

[4]  Kai Hwang,et al.  Computer architecture and parallel processing , 1984, McGraw-Hill Series in computer organization and architecture.

[5]  Harold S. Stone,et al.  Parallel Processing with the Perfect Shuffle , 1971, IEEE Transactions on Computers.

[6]  Jeffrey D Ullma.  Computational Aspects of VLSI , 1984 .