# Hmesh: A vlsi architecture for parallel processing

## Abstract

Enhancements to array processors in the form of broadcast buses have been proposed for improving the speeds of algorithms in linear algebra, image processing and computational geometry. In this paper, we consider certain practical issues in such arrays which include fewer processors connected to the broadcast buses and finite time, namely log *N* time for broadcasting data to *N* processors. We propose a modified broadcast bus VLSI architecture which consists of a √*N* × √*N* mesh connected structure and a hierarchy of broadcast buses in each row and in each column such that every bus has *k* PE's. That is, in any row or column, in the first level there are \(\frac{{\sqrt N }}{k}\)buses with groups of *k* PE's connected to each bus. One PE from each of this group is connected to second level of buses in a similar manner. This is recursively done until there are only *k* PE's left which are connected by a broadcast bus. With this architecture, maximum, minimum, or sum of *N* values can be found in *O*(*log N*), median row of a binary picture in *O*(*log N*), shortest distance between two points in *O*(*log N*). This architecture is well suited for parallel processing of applications in Linear Algebra, Image Processing, Computational Geometry and Numerical Computations. These restricted connections to buses reduces the I/O ports significantly, and therefore, is more suitable for VLSI implementation.

## Keywords

Parallel Algorithm Computational Geometry Close Neighbor Array Processor VLSI Architecture## Preview

Unable to display preview. Download preview PDF.

## References

- [BOKH 81]S. H. Bokhari, “MAX: An Algorithm for Finding Maximum in an Array Processor with a Global Bus”, in Proc. 1981 International Parallel Processing Conference, pp 302–303.Google Scholar
- [BOKH 84]S. H. Bokhari, “Finding Maximum on an Array Processor with a Global Bus”, IEEE Transactions on Computers, Vol. C-33, No. 2, February 1984, pp 133–139.Google Scholar
- [CARL 85]D. A. Carlson, “Performing Tree and Prefix Computations on Modified Mesh-Connected Parallel Computers,” Proc. 1985 Int. Conf. on Parallel Processing, August 1985, pp 715–718.Google Scholar
- [FLYN 72]M. J. Flynn, “Some Computer Organizations and their Effectiveness”
*IEEE Trans. on Comput.,*Sept. 1972, pp. 948–960.Google Scholar - [GENT 78]W. M. Gentleman, “Some Complexity Results for Matrix Computations on Parallel Processors”, JACM, vol. 25, pp. 112–115, 1978.Google Scholar
- [GOPA 85]P. S. Gopalakrishnan, I. V. Ramakrishnan, L. N. Kanal, “An Efficient Connected Components Algorithm on a Mesh-Connected Computer,” Proc. 1985 Int. Conf. Parallel Processing, August 1985, pp 711–714.Google Scholar
- [HAMA 71]V. C. Hamacher, “Machine Complexity Versus Interconnection Complexity in Iterative Arrays”, IEEE Trans. on Comput., Vol. C-20, 1971, pp 321–323.Google Scholar
- [HOCK 81]R. W. Hockney and C. R. Jesshope, “Parallel Computers”, Adam Hilger Ltd., 1981.Google Scholar
- [HUNT 81]Hunt, “The ICL DAP and its Application to Image Processing”, in Languages and Architectures for Image Processing, M. J. B. Duff and S. Levialdi, eds., Academic Press, 1981.Google Scholar
- [KUNG 77]H. T. Kung, C. D. Thompson, “Sorting on a Mesh Connected Computer,” Communications of the ACM, 1977.Google Scholar
- [PRAS 85a]V. K. Prasanna Kumar, C. S. Raghavendra, “Array Processor with Multiple Broadcasting,” Proc. 12th Annual Symposium on Computer Architecture, June 1985, pp 2–10.Google Scholar
- [PRAS 85b]V. K. Prasanna Kumar, C. S. Raghavendra, “Image Processing on an Enhanced Mesh Connected Computer”, Proc. IEEE Workshop on Computer Architecture for Pattern Analysis and Image Database Management, November 1985, pp 243–247.Google Scholar
- [STOU 82]Q. F. Stout, “Broadcasting on Mesh Connected Computers”, 1982 Conference on Information Sciences and Systems, pp. 85–90.Google Scholar
- [STOU 83]Q. F. Stout, “Mesh Connected Computers with Broadcasting”, IEEE Trans. on Computers, pp. 826–830, 1983.Google Scholar