Title :
Bit-parallel arithmetic in a massively-parallel associative processor
Author :
Scherson, Isaac D. ; Kramer, David A. ; Alleyne, Brian D.
Author_Institution :
Dept. of Inf. & Comput. Sci., California Univ., Irvine, CA, USA
fDate :
10/1/1992 12:00:00 AM
Abstract :
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(m2 ) 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 (P3) computing system. Implementations of the fast Fourier transform and matrix multiplication are presented to illustrate the operation of this system
Keywords :
VLSI; digital arithmetic; fast Fourier transforms; parallel architectures; VLSI; bit-parallel arithmetic; division; fast Fourier transform; floating point data; massively-parallel associative processor; matrix multiplication; multiplication; storage cells; Computer architecture; Concurrent computing; Fast Fourier transforms; Floating-point arithmetic; Logic; NASA; Parallel machines; Parallel processing; Random access memory; Very large scale integration;
Journal_Title :
Computers, IEEE Transactions on