A fast algorithm for computing histograms on a reconfigurable mesh

The authors present fast parallel algorithms for computing the histogram on PARBUS and RMESH models. Compared with the approach of J. Jeng and S. Sahni (1992), the proposed algorithm improves the time complexity by using a constant amount of memory in each processing element. In the histogram modification algorithm, the entire range of h is considered. The connections used by the proposed algorithm on the PARBUS model are same as those allowed in the MRN model. Thus, this algorithm runs on this model as well. The results obtained imply that the number of 1's in a N*N 0/1 table can be counted in O(log* N) time on an N*N reconfigurable mesh and in O(log log N) time on an N*N RMESH.<<ETX>>

[1]  Shahid H. Bokhari,et al.  Finding Maximum on an Array Processor with a Global Bus , 1984, IEEE Transactions on Computers.

[2]  David Peleg,et al.  The Power of Reconfiguration , 1991, J. Parallel Distributed Comput..

[3]  Viktor K. Prasanna,et al.  An optimal multiplication algorithm for reconfigurable mesh , 1992, [1992] Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing.

[4]  Stephan Olariu,et al.  Fast computer vision algorithms for reconfigurable meshes , 1992, Proceedings Sixth International Parallel Processing Symposium.

[5]  Jae S. Lim.  1 – Image Enhancemen , 1984 .

[6]  Jerome Rothstein,et al.  Immediate Parallel Solution of the Longest Common Subsequence Problem , 1987, ICPP.

[7]  Sartaj Sahni,et al.  Sorting n numbers on n*n reconfigurable meshes with buses , 1993, [1993] Proceedings Seventh International Parallel Processing Symposium.

[8]  H. T. Kung,et al.  Sorting on a mesh-connected parallel computer , 1977, CACM.

[9]  Gen-Huey Chen,et al.  Constant Time Sorting on a Processor Array with a Reconfigurable Bus System , 1990, Inf. Process. Lett..

[10]  Larry S. Davis,et al.  On Computing Histograms of Images in Log n Time Using Fat Pyramids. , 1987 .

[11]  Toshimitsu Masuzawa,et al.  A sub-logarithmic time sorting algorithm on a reconfigurable array , 1991 .

[12]  Russ Miller,et al.  Meshes with reconfigurable buses , 1988 .

[13]  Viktor K. Prasanna,et al.  An optimal sorting algorithm on reconfigurable mesh , 1992, Proceedings Sixth International Parallel Processing Symposium.

[14]  Lawrence Snyder,et al.  Introduction to the configurable, highly parallel computer , 1982, Computer.

[15]  Viktor K. Prasanna,et al.  Efficient Parallel Algorithms for Some Geometric Problems on Reconfigurable Mesh , 1992, ICPP.

[16]  S. L. Tanimoto,et al.  Sorting, Histogramming, and Other Statistical Operations on a Pyramid Machine , 1984 .

[17]  Larry S. Davis,et al.  On Computing Complete Histograms of Images in Log (n) Steps Using Hypercubes , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

[18]  Sartaj Sahni,et al.  Histogramming on a reconfigurable mesh computer , 1992, Proceedings Sixth International Parallel Processing Symposium.

[19]  Russ Miller,et al.  Image Computations on Reconfigurable Mesh , 1988, CVPR 1988.

[20]  Viktor K. Prasanna,et al.  Efficient Histogramming on Hypercube SIMD Machines , 1990, Comput. Vis. Graph. Image Process..

[21]  Sartaj Sahni,et al.  Reconfigurable mesh algorithms for image shrinking, expanding, clustering, and template matching , 1991, [1991] Proceedings. The Fifth International Parallel Processing Symposium.

[22]  Massimo Maresca,et al.  Polymorphic-Torus Network , 1989, IEEE Trans. Computers.

[23]  Gen-Huey Chen,et al.  Constant Time Algorithms for the Transitive Closure and Some Related Graph Problems on Processor Arrays with Reconfigurable Bus Systems , 1990, IEEE Trans. Parallel Distributed Syst..