scispace - formally typeset
Search or ask a question

Showing papers on "Massively parallel published in 1979"


Patent
21 May 1979
TL;DR: The massively parallel processor architecture as discussed by the authors enables very high speed processing of large amounts of ordered, parallel data, including spatial translation by shifting or "sliding" of bits vertically or horizontally to neighboring processing elements.
Abstract: An apparatus for processing multidimensional data with strong spatial characteristics, such as raw image data, characterized by a large number of parallel data streams in an ordered array, comprises a large number (e.g. 16,384 in a 128×128 array) of parallel processing elements operating simultaneously and independently on single bit slices of a corresponding array of incoming data streams under control of a single set of instructions. Each of the processing elements comprises a bidirectional data bus in communication with a register for storing single bit slices together with a random access memory unit and associated circuitry, including a binary counter/shift register device, for performing logical and arithmetical computations on the bit slices, and an I/O unit for interfacing the bidirectional data bus with the data stream source. The massively parallel processor architecture enables very high speed processing of large amounts of ordered, parallel data, including spatial translation by shifting or "sliding" of bits vertically or horizontally to neighboring processing elements.

320 citations


Journal ArticleDOI
TL;DR: The RAM model of Cook and Reckhow as discussed by the authors was extended to allow parallel recursive calls and the elementary theory of such machines was developed The uniform cost criterion was used The results include proofs of (!) the eqmvalence of non-deterministic and deterministic polynomml UMs for such parallel machines and (2) the equivalence of polynomial-time UMs on parallel machines.
Abstract: The RAM model of Cook and Reckhow ~s extended to allow parallel recursive calls and the elementary theory of such machines is developed The uniform cost criterion is used The results include proofs of (!) the eqmvalence of nondetermmtsUc and determm~sttc polynomml Ume for such parallel machines and (2) the eqmvalence of polynomml tmae on such parallel machines and polynomml space on ordinary nonparallel RAM's Also included are results showing that parallelism appears to be stnctly more powerful than nondeter-

63 citations



Journal ArticleDOI
TL;DR: A fast metalgonthm for adaptive quadrature on a MIMD parallel computer and its speedup ts at least constant times M/ log M using a total of M processors is described.
Abstract: We describe a fast metalgonthm for adaptive quadrature on a MIMD (Multiple Instruction, Multiple Data) parallel computer and show that its speedup ts at least constant times M/ log M using a total of M processors

8 citations


Proceedings ArticleDOI
01 Jan 1979
TL;DR: NASA is developing massively parallel systems for ultra high speed processing of digital image data collected by satellite borne instrumentation and work is underway on the design and fabrication of the 'Massively Parallel Processor', a ground computer containing 16,384 processing elements arranged in a 128 x 128 array.
Abstract: NASA is developing massively parallel systems for ultra high speed processing of digital image data collected by satellite borne instrumentation. Such systems contain thousands of processing elements. Work is underway on the design and fabrication of the 'Massively Parallel Processor', a ground computer containing 16,384 processing elements arranged in a 128 x 128 array. This computer uses existing technology. Advanced work includes the development of semiconductor chips containing thousands of feedthrough paths. Massively parallel image analog to digital conversion technology is also being developed. The goal is to provide compact computers suitable for real-time onboard processing of images.

5 citations


Proceedings ArticleDOI
22 Oct 1979

5 citations


01 Jan 1979
TL;DR: The Massively Parallel Processor (MPP) as discussed by the authors is a single instruction multiple data stream computer designed to perform logical, integer, and floating point arithmetic operations on variable word length data.
Abstract: A long-term experimental development program conducted at Goddard Space Flight Center to implement an ultrahigh-speed data processing system known as the Massively Parallel Processor (MPP) is described. The MPP is a single instruction multiple data stream computer designed to perform logical, integer, and floating point arithmetic operations on variable word length data. Information is presented on system architecture, the system configuration, the array unit architecture, individual processing units, and expected operating rates for several image processing applications (including the processing of Landsat data).

4 citations


Dissertation
01 Jan 1979

1 citations