A Fast Algorithm for Computing a Histogram on Reconfigurable Mesh

The reconfigurable mesh captures salient features from a variety of sources, including the content addressable array parallel processor, the CHiP, the polymorphic-torus network and the bus automaton. It consists of an array of processors interconnected by a reconfigurable bus system. The bus system can be used to dynamically obtain various interconnection patterns between the processors. In this paper, we present a fast algorithm for computing the histogram of an N/spl times/N image with h grey levels in O(min{/spl radic/h+log*(N/h),N}) time on an N/spl times/N reconfigurable mesh assuming each PE has a constant amount of local memory. This algorithm runs on the PARBUS and MRN/LRN models. In addition, histogram modification can be performed in O(/spl radic/h) time on the same model. A variant of out algorithm runs in O(min{/spl radic/h+log log(N/h),N}) time on an N/spl times/N RMESH in which each PE has constant storage. This result improves the known time and memory bounds for histogramming on the RMESH model. >

[1]  Mike Thornburg,et al.  Virtual Computer Corporation: Transformable Computers , 1994 .

[2]  Kye Sherrick Hedlund.  Wafer scale integration of configurable, highly parallel processors , 1982 .

[3]  K PrasannaViktor,et al.  A Fast Algorithm for Computing a Histogram on Reconfigurable Mesh , 1995 .

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

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

[6]  Kang G. Shin,et al.  Implementation of Decentralized Load Sharing in Networked Workstations Using the Condor Package , 1997, J. Parallel Distributed Comput..

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

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

[9]  Viktor K. Prasanna,et al.  A fast algorithm for computing histograms on a reconfigurable mesh , 1992, [Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation.

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

[11]  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.

[12]  Dionysios I. Reisis,et al.  Parallel Computations on Reconfigurable Meshes , 1993, IEEE Trans. Computers.

[13]  Viktor K. Prasanna,et al.  An Optimal Multiplication Algorithm on Reconfigurable Mesh , 1997, IEEE Trans. Parallel Distributed Syst..

[14]  S. Olariu,et al.  Reconfigurable buses with shift switching-architectures and applications , 1993, Proceedings of Phoenix Conference on Computers and Communications.

[15]  Sartaj Sahni,et al.  Data broadcasting in SIMD computers , 1981, IEEE Transactions on Computers.

[16]  Hussein M. Alnuweiri.  Fast algorithms for image labeling on a reconfigurable network of processors , 1993, [1993] Proceedings Seventh International Parallel Processing Symposium.

[17]  Joseph JáJá,et al.  An Introduction to Parallel Algorithms , 1992 .

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

[19]  Gen-Huey Chen,et al.  Two-Dimensional Processor Array with a Reconfigurable Bus System is at Least as Powerful as CRCW Model , 1990, Inf. Process. Lett..

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

[21]  Viktor K. Prasanna,et al.  Fast Arithmetic on Reconfigurable Meshes , 1993, 1993 International Conference on Parallel Processing - ICPP'93.

[22]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

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

[24]  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..

[25]  Dionysios I. Reisis,et al.  Image computations on reconfigurable VLSI arrays , 1988, Proceedings CVPR '88: The Computer Society Conference on Computer Vision and Pattern Recognition.

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

[27]  Transformable computers , 1994, Proceedings of 8th International Parallel Processing Symposium.

[28]  George Karypis,et al.  Introduction to Parallel Computing , 1994 .

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

[30]  Sanguthevar Rajasekaran,et al.  Mesh Connected Computers with Fixed and Reconfigurable Buses: Packet Routing, Sorting, and Selection , 1993, ESA.

[31]  Sartaj Sahni,et al.  Sorting n Numbers on n x n Reconfigurable Meshes with Buses , 1994, J. Parallel Distributed Comput..

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

[33]  Jerome Rothstein.  Bus automata, brains, and mental models , 1988, IEEE Trans. Syst. Man Cybern..

[34]  Viktor K. Prasanna,et al.  Array Processor with Multiple Broadcasting , 1985, ISCA.

[35]  Sartaj Sahni,et al.  Optimal BPC Permutations on a Cube Connected SIMD Computer , 1982, IEEE Transactions on Computers.

[36]  Ramachandran Vaidyanathan,et al.  On the power of segmenting and fusing buses , 1993, [1993] Proceedings Seventh International Parallel Processing Symposium.

[37]  Sartaj Sahni,et al.  Sorting n/sup 2/ numbers on n*n meshes , 1993, [1993] Proceedings Seventh International Parallel Processing Symposium.

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

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

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

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

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

[43]  A. Baker,et al.  A concise introduction to the theory of numbers , 1984 .

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

[45]  Hossam A. ElGindy,et al.  Selection on the Reconfigurable Mesh , 1991, ICPP.