This Article 
 Bibliographic References 
 Add to: 
Image Computations on Meshes with Multiple Broadcast
November 1989 (vol. 11 no. 11)
pp. 1194-1202

The authors consider a mesh-connected processor array with broadcast, in which the processors in each row and in each column can access a shared bus. This computation model is an abstraction of commercially available parallel machines such as the distributed array processor (DAP). The authors show efficient data movement using the buses, which leads to significantly faster solution times for several image problems compared to those on an ordinary mesh-connected array. For several problems, the time performance is comparable to that on the pyramid of corresponding size. Alternate parallel organizations with broadcast feature are also shown. Utilizing the broadcast feature on the arrays can lead to significant improvement of the time performance of many image computations.

[1] K. Batcher, "Sorting networks and their applications,"Spring Joint Computer Conf., vol. 32, pp. 307-314, AFIPS PRESS, Montwole, NJ, 1968.
[2] K. Batcher, "Design of a massively parallel processor,"IEEE Trans. Comput., vol. C-29, Sept. 1980.
[3] S. H. Bokhari, "Finding maximum on an array processor with a global bus,"IEEE Trans. Comput., vol. C-33, pp. 133-139, Feb. 1984.
[4] D. Carlson, "The mesh with a global mesh: A flexible high speed organization for parallel computation," Tech. Rep., Elec. Comput. Eng. Dep., Univ. Massachusetts, 1985.
[5] S. B. Chalasani and C. S. Raghavendra, "Geometric algorithms on HMESH architecture," inProc. PAMI Workshop, 1987.
[6] R. Davis and D. Thomas, "Systolic array chip matches the pace of high speed processing,"Electron. Design, Oct. 1984.
[7] C. R. Dyer and A. Rosenfeld, "Parallel image processing by memory augmented cellular automata,"IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-2, 1981.
[8] C. R. Dyer, "A VLSI pyramid machine for hierarchical parallel image processing,"Proc. IEEE Conf. Pattern Recognition Image Processing, 1981.
[9] P. S. Gopalakrishnan, I. V. Ramakrishnan, and L. N. Kanal, "An efficient connected components algorithm on a mesh-connected computer,"Tech. Rep., Dep. Computer Sci., Univ. Maryland, 1985.
[10] K. Hwang and F. A. Briggs,Computer Architecture and Parallel Processing. New York: McGraw-Hill, 1984.
[11] C. D. Thompson and H. T. Kung, "Sorting on a mesh connected processor array,"Commun. ACM, pp. 263-271, 1972.
[12] R. Miller and Q. F. Stout, "Convexity algorithms for pyramid computers,"Proc. 1984 Int. Conf. Parallel Processing.
[13] R. Miller and Q. F. Stout, "Computational geometry on a mesh-connected computer,"Proc. 1984 Int. Conf. Parallel Processing, pp. 66-74.
[14] R. Miller and Q. F. Stout, "Data movement techniques for the pyramid computer,"SIAM J. Comput., vol. 16, pp. 38-60, 1987.
[15] R. Nair and S. J. Hong, "Search for minimum in a distributed system," Res. Rep. IBM, 1985.
[16] D. Nassimi and S. Sahni, "Finding connected components and connected ones on a mesh connected parallel computer,"SIAM J. Comput., vol. 9, pp. 744-757, 1980.
[17] D. Nassimi and S. Sahni, "Data broadcasting in SIMD computers,"IEEE Trans. Comput., vol. C-30, Feb. 1981.
[18] M. H. Overmars and J. van Leeuwen, "Dynamically maintaining configurations in the plane," inProc. 12th Annu. ACM Symp. Theory, of Computing, 1980, pp. 135-145.
[19] V. K. Prasanna-Kumar and C. S. Raghavendra, "Array processor with multiple broadcasting," inProc. Annu. Symp. Computer Architecture, June 1985.
[20] V. K. Prasanna-Kumar and M. Eshaghian, "Parallel geometric algorithms for digitized pictures on the mesh of trees organization,"Int. Conf. Parallel Processing, 1986.
[21] V. K. Prasanna-Kumar and D. Reisis, "VLSI arrays with reconfigurable buses," Tech. Rep. USC, CRI-87-48 Sept. 1987.
[22] V. K. Prasanna-Kumar and D. Reisis, "Parallel image processing on enhanced arrays,"Int. Conf. Parallel Processing, 1987.
[23] F. P. Preparata and M. I. Shamos,Computational Geometry, an Introduction. New York: Springer-Verlag, 1985.
[24] A. Rosenfeld and A. Kak,Digital Picture Processing, New York: Academic, 1976.
[25] A. Rosenfeld, "Parallel processors for image processing: 2-D arrays and extensions,"IEEE Comput., Jan. 1983.
[26] Q. F. Stout, "Mesh connected computers with broadcasting,"IEEE Trans. Comput., vol. C-32, pp. 826-830, 1983.
[27] Q. F. Stout, "Meshes with multiple buses," inProc. 27th IEEE Symp. Foundations Comput. Sci., 1986, pp. 264-273.
[28] S. L. Tanimoto, "A pyramidal approach to parallel processing," inProc. Int. Symp. Comput. Architecture, June 1983, pp .
[29] L. Uhr,Algorithm-Structured Computer Arrays and Networks. New York: Academic, 1984.
[30] J. D. Ullman,Computational Aspects of VLSI. Rockville, MD: Computer Science, 1984.

Index Terms:
computerised picture processing; parallel algorithms; multiple broadcast; mesh-connected processor array; parallel machines; distributed array processor; data movement; time performance; image computations; computational complexity; computerised picture processing; distributed processing; parallel algorithms; parallel machines
V.K. Prasanna-Kumar, D. Reisis, "Image Computations on Meshes with Multiple Broadcast," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 11, no. 11, pp. 1194-1202, Nov. 1989, doi:10.1109/34.42857
Usage of this product signifies your acceptance of the Terms of Use.