This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Bit-Parallel Arithmetic in a Massively-Parallel Associative Processor
October 1992 (vol. 41 no. 10)
pp. 1201-1210

A simple but powerful architecture based on the classical associative processor model is proposed. By distributing logic among slices of storage cells such that a number of bit-planes share a simple logic unit, bit-parallel arithmetic for massively parallel processing becomes feasible. For m-bit operands, this architecture enables complex operations such as multiplication and division to execute in O(m) cycles as opposed to O(m/sup 2/) for bit-serial machines. Algorithms which utilize this bit-parallel property to efficiently perform operations on floating point data have been developed. The simplicity of the architecture enables its implementation using VLSI technology, and hence allows the construction of a word-parallel, bit-parallel, massively parallel (P/sup 3/) computing system. Implementations of the fast Fourier transform and matrix multiplication are presented to illustrate the operation of this system.

[1] B. D. Alleyne, J. M. Boyce, and I. D. Scherson, "Image block transformations in a partitioned associative processor," inProc. 1989 Int. Conf. Parallel Processing, Aug. 1989, pp. 48-55.
[2] K. E. Batcher, "STARAN parallel processor system hardware," inProc. 1974 Nat. Comput. Conf., AFIPS, 1974, pp. 405-410.
[3] K. E. Batcher, "Design of a massively parallel processor,"IEEE Trans. Comput., vol. C-29, 1980, pp. 836-840.
[4] A. Estrin and R. Fuller, "Algorithms for content-addressable memories," inProc. 1963 IEEE Pacific Comput. Conf., 1963, pp. 241-253.
[5] C. C. Foster,Content Addressable Processors. New York: Van Nostrand Reinhold, 1976.
[6] A.D. Falkoff, "Algorithms for parallel search memories,"J. ACM, vol. 9, pp. 488-511, 1962.
[7] W. D. Hillis,The Connection Machine. Cambridge, MA: MIT Press, 1985.
[8] K. Hwang,Computer Arithmetic: Principles, Architecture, and Design. New York: Wiley, 1979.
[9] S. Ilgen and I.D. Scherson, "Parallel processing on VLSI associative memory," inProc. 1987 Int. Conf. Parallel Processing, Aug. 1987, pp. 50-53.
[10] T. Kohonen,Content-Addressable Memories. Berlin, Germany: Springer-Verlag, 1980.
[11] Maspar Computer Corporation,Maspar System Overview, July 1990.
[12] National Aeronautics and Space Administration,Frontiers of Massively Parallel Scientific Computation, NASA Conference Publications 2478, Sept. 1986.
[13] B. Parhami, "Associative memories and processors: An overview and selected bibliography,"Proc. IEEE, pp. 722-730, June 1973.
[14] S. Ruhman and I.D. Scherson, "Associative processor for tomographic image reconstruction," inProc. IEEE Conf. Med. Comput. Sci., 1982, pp. 353-358.
[15] I. D. Scherson and S. Ilgen, "A reconfigurable fully parallel associative processor,"J. Parallel Distributed Comput., vol. 6, pp. 69-89, 1989.
[16] S.S. Yau and H.S. Fung, "Associative Processor Architecture--A Survey,"Computing Surveys, Vol. 9, No. 1, Mar. 1977, pp. 3- 28.

Index Terms:
bit-parallel arithmetic; massively-parallel associative processor; storage cells; multiplication; division; floating point data; VLSI; fast Fourier transform; matrix multiplication; digital arithmetic; fast Fourier transforms; parallel architectures; VLSI.
Citation:
I.D. Scherson, D.A. Kramer, B.D. Alleyne, "Bit-Parallel Arithmetic in a Massively-Parallel Associative Processor," IEEE Transactions on Computers, vol. 41, no. 10, pp. 1201-1210, Oct. 1992, doi:10.1109/12.166599
Usage of this product signifies your acceptance of the Terms of Use.