This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Fast Algorithm for Computing a Histogram on Reconfigurable Mesh
February 1995 (vol. 17 no. 2)
pp. 97-106

Abstract— The reconfigurable mesh captures salient features from a variety of sources, including the CAAPP, 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×N image with h grey levels in$$O\!\!\left({\bf min}\!\left\{\sqrt h + {\bf log^*} (N/h), N\right\}\!\right)$$time on an N×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(\sqrt h)$ time on the same model.

A variant of our algorithm runs in$$O\!\!\left({\bf min}\!\left\{\sqrt {\bf h} + {\bf log\ log} (N/h), N\right\}\!\right)$$time on an N×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] H.M. Alnuweiri,“Fast algorithms for image labeling on a reconfigurable network of processors,” Proc. Int’l Parallel Processing Symp., pp. 569-575, Apr. 1993.
[2] A. Baker,A Concise Introduction to the Theory of Numbers, Cambridge Univ. Press, 1984.
[3] Y. Ben-Asher,D. Peleg,R. Ramaswami,, and A. Schuster,“The power of reconfiguration,” J. of Parallel and Distributed Computing, vol. 13, no. 2, pp. 139-153, Oct. 1991.
[4] Y. Ben-Asher,D. Gorden,, and A. Schuster,“Optimal simulations in reconfigurable arrays,” Technical Report No. 716, Dept. of Computer Science, Technion- Israel Inst. Tech nology, 1992.
[5] T. Bestul and L.S. Davis,“On computing histograms of images in logntime using fat pyramids,” IEEE Trans. on Pattern Analysis and Machine Intelligence, vol. 11, no. 2, pp. 212-213, 1989.
[6] H. Elgindy and P. Wegrowicz,“Selection on the Reconfigurable Mesh,” Proc. Int’l Conf. on Parallel Processing, pp. III.26-III.33, Aug. 1991.
[7] K.S. Hedlund and L. Snyder,“Wafer scale integration of configurable, highly parallel processors,” Proc. Int’l Conf. Parallel Processing, pp. 262-264, 1982.
[8] J. J'aJ'a, An Introduction to Parallel Algorithms.New York: Addison-Wesley, 1992.
[9] J. Jang and V.K. Prasanna,“An optimal sorting algorithm on reconfigurable mesh,” Proc. Int’l Parallel Processing Symp., pp. 130-137, Mar. 1992.
[10] J. Jang and V.K. Prasanna,“Efficient parallel algorithms for some geometric problems on reconfigurable mesh,” Proc. Int’l Conf. Parallel Processing, pp. III.127-130, 1992.
[11] J. Jang,H. Park,, and V.K. Prasanna,“A fast algorithm for computing histogram on reconfigurable mesh,” Proc. Frontiers of Massively Parallel Computation, pp. 244-251, 1992.
[12] J. Jang,H. Park,, and V. K. Prasanna,“An optimal multiplication algorithm on reconfigurable mesh,” Proc. Symp. Parallel and Distributed Processing, pp. 384-391, 1992.
[13] J. Jang,H. Park,, and V. K. Prasanna,“A bit model of reconfigurable mesh,” Proc. of Reconfigurable Architectures Workshop held at Int’l Parallel Processing Symp.(IPPS), April 1992.
[14] J. Jenq and S. Sahni,“Reconfigurable mesh algorithms for image shrinking, expanding, clustering, and template matching,” Proc. Int’l Parallel Processing Symp., pp. 208-215, 1991.
[15] J. Jenq and S. Sahni,“Histogramming on a reconfigurable mesh computer,” Proc. Int’l Parallel Processing Symp., pp. 425-432, 1992.
[16] V. Kumar, A. Grama, A. Gupta, and G. Karypis, Introduction to Parallel Computing: Design and Analysis of Algorithms. Benjamin Cummings, 1994.
[17] H. Li and M. Maresca,“Polymorphic-torus network,” IEEE Trans. on Computers, vol. 38, no. 9, pp. 1345-1351, Sept. 1989.
[18] R. Lin and S. Olariu,“Reconfigurable meshes with shift switching-architecture and applications,” Proc. of Int’l Phoenix Conf. on Computers and Communications, 1993.
[19] W. Lin and V.K. Prasanna Kumar,“Efficient histogramming on hypercube SIMD machines,” Computer Vision, Graphics, and Image Processing, vol. 49, pp. 104-120, 1990.
[20] R. Miller,V.K. Prasanna Kumar,D.I. Reisis,, and Q.F. Stout,“Meshes with reconfigurable buses,” MIT Conf. on Advanced Research in VLSI, pp. 163-178, 1988.
[21] R. Miller,V.K. Prasanna Kumar,D.I. Reisis, and Q.F. Stout,“Parallel computations on reconfigurable meshes,” IEEE Trans. on Computers, pp. 678-692, June 1993.
[22] R. Miller,V.K. Prasanna Kumar,D. Reisis,, and Q.F. Stout,“Image computations on reconfigurable mesh,” Proc. Computer Vision and Pattern Recognition, pp. 925-930, 1988.
[23] D. Nassimi and S. Sahni,“Data broadcasting in SIMD computers,” IEEE Trans. on Computers, vol. 30, pp. 101-107, Feb. 1981.
[24] M. Nigam and S. Sahni,“Sortingnnumbers onn×nreconfigurable meshes with buses,” Proc. Int’l Parallel Processing Symp., pp. 73-78, Apr. 1993.
[25] K. Nakano,T. Masuzawa,, and N. Tokura,“A sub-logarithmic time sorting algorithm on a reconfigurable mesh,” Inst. Electronics, Information and Communication Engineers Trans., vol. E74, no. 11, Japan, Nov. 1991.
[26] S. Olariu,J.L. Schwing,, and J. Zhang,“Fast computer vision algorithms for reconfigurable meshes,” Image and Vision Computing, pp. 610-616, 1992.
[27] H. Park,V.K. Prasanna,, and J. Jang,“Fast arithmetic on reconfigurable meshes,” Proc. Int’l Conf. on Parallel Processing, 1993.
[28] V.K. Prasanna Kumar, and C.S. Raghavendra,“Array processor with multiple broadcasting,” J. of Parallel and Distributed Computing, vol. 4, pp. 173-190, 1987.
[29] S. Rajashekaran,“Mesh Connected Computers with Fixed and Reconfigurable Buses: Packet Routing, Sorting and Selection,” Manuscript, Dept. of CIS, Univ. of Pennsylvania, Oct. 1993. Also, appears at the First Ann. European Symp. on Algorithms, 1993.
[30] J. Rothstein,“Bus Automata, Brains, and Mental Models,” IEEE Trans. on Systems, Man, and Cybernetics, vol. 18, no. 4, pp. 522-531, Apr. 1988.
[31] L. Snyder,“Introduction to the configurable highly parallel computer,” Computer, vol. 15, no. 1, pp. 47-56, 1982.
[32] S.L. Tanimoto,“Sorting, histogramming, and other statistical operations on a pyramid machine,” in Multiresolution Image Processing and Analysis, A. Rosenfeld, ed., pp. 136-145,Springer-Verlag, New York, 1984.
[33] C. Thompson and H. Kung,“Sorting on a mesh connected parallel computer,”Commun. ACM, vol. 20, pp. 263–271, 1977.
[34] R.K. Thiruchelvan,J.L. Trahan,, and R. Vaidyanathan,“On the Power of Segmenting and Fusing Buses,” Proc. of Int’l Parallel Processing Symp., pp. 79-83, Apr. 1993.
[35] M. Thornburg and S. Casselman,“Transformable Computers,” Proc. of Int’l Parallel Processing Symp. (IPPS), Apr. 1994.
[36] B.F. Wang,G.H. Chen,, and F.C. Lin,“Constant time sorting on a processor array with a reconfigurable bus systems,” Information Processing Letters, vol. 34, pp. 187-192, 1990.
[37] B.F. Wang and G.H. Chen,“Two dimensional processor array with reconfigurable bus system is at least as powerful as CRCW model,” Information Processing Letters, vol. 36, pp. 31-36, 1990.
[38] B. F. Wang and G. H. Chen,“Constant time algorithms for the transitive closure problem and some related graph problems on processor arrays with reconfigurable bus systems,” IEEE Trans. on Parallel and Distributed Systems, vol. 1, no. 4, pp. 500-507, 1991.
[39] C.C. Weems,S.P. Levitan,A.R. Hanson,E.M. Riseman,J.G. Nash,, and D.B. Sheu,“The image understanding architecture,” Int’l J. of Computer Vision, vol. 2, pp. 251-282, 1989.
[40] Proc. of Reconfigurable Architectures Workshop, Apr. 1994.

Index Terms:
Histogram, reconfigurable mesh, mapping, parallel algorithm.
Citation:
Ju-wook Jang, Heonchul Park, Viktor K. Prasanna, "A Fast Algorithm for Computing a Histogram on Reconfigurable Mesh," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 17, no. 2, pp. 97-106, Feb. 1995, doi:10.1109/34.368177
Usage of this product signifies your acceptance of the Terms of Use.