scispace - formally typeset
Journal ArticleDOI

Efficient Function Implementation for Bit-Serial Parallel Processors

Reeves, +1 more
- 01 Sep 1980 - 
- Vol. 29, Iss: 9, pp 841-844
TLDR
A general scheme is described for generating efficient programs to implement arbitrary functions on bit-serial-arithmetic processors, based on logic design methodology and involves designing a logic network to realize a desired function.
Abstract
Parallel processors with bit-serial processing elements (PE's) usually implement arithmetic functions by a sequence of word-level arithmetic operations; however, basic operations must be specified at the bit level. In this correspondence the possibility of more efficiently implementing a function with a special tailored sequence of bit-serial operations is considered. A general scheme is described for generating efficient programs to implement arbitrary functions on bit-serial-arithmetic processors. This scheme is based on logic design methodology and involves designing a logic network to realize a desired function. The parallel processor is then used to efficiently simulate a set of these networks. Heuristic design algorithms are used to generate the logic networks; several algorithms are described and compared with some benchmark functions. Several efficient PE designs are described and analyzed.

read more

Citations
More filters
Book

The design and analysis of parallel algorithms

TL;DR: Kurskod av teknisk-naturvetenskapliga fakultetsnämnden Kursplan giltig från: 2012, vecka 10 Ansvarig enhet: Inst för datavetenskap SCB-ämnesrubrik: Informatik/Dataoch systemvetenskapskap Huvudområden och successiv fördjupning.
Journal ArticleDOI

Parallel computer architectures for image processing

TL;DR: The fundamental problems of developing an effective MSIMD system are discussed and a simple SIMD/MIMD computational model for comparison with such systems is proposed.
Journal ArticleDOI

Computer architectures for image processing in the USA

TL;DR: Several alternative architectures for image processing are discussed, some current hardware development projects in the USA are described, and new emerging architectures, which are still in the development stage, are discussed.
Journal ArticleDOI

Search algorithms for bi-sequential machines

TL;DR: A number of frequently encountered searches are classified and their complementary and converse relationships are established and a method for achieving multiple-equal-to searches is given.
Dissertation

An integrated associative processing system

TL;DR: The design and implementation of an integrated associative processor is described, intended for use as a coprocessor in a system for accelerating pixel-parallel image processing tasks on desktop workstations and personal computers.
References
More filters
Proceedings ArticleDOI

STARAN parallel processor system hardware

TL;DR: The parallel processing capability of STARAN resides in n array modules (n≤32). Each array module contains 256 small processing elements (PE's) that communicate with a multi-dimensional access memory through a "flip" network, which can permute a set of operands to allow inter-PE communication.
Journal ArticleDOI

Minimization of Exclusive or and Logical Equivalence Switching Circuits

TL;DR: This paper is an attempt to develop minimization algorithms for switching circuits based on Reed-Muller canonic forms for obtaining minimal modulo 2 or complement modulo2 sum-of- products expressions of any arbitrary single-output or multiple-output switching function with fixed polarities of the input variables.
Journal ArticleDOI

A Systematically Designed Binary Array Processor

TL;DR: Three basic instruction types that characterize a BAP are defined and the systematic design of a processor called BASE is described in detail, two forms of BASE are discussed, a fully parallel version and an add-on unit for a conventional computer.
Journal ArticleDOI

Unateness Properties of and-Exclusive-or Logic Circuits

TL;DR: An algorithm is presented which allows simple determination of a ring sum realization using logic array notation, and which can be used to find minimum cost polarities and a second algorithm which allows nonexhaustive and near-optimal handling of functions with DON'T CARE conditions.