Book•
Computational Aspects of Vlsi
01 Jan 1984-
About: The article was published on 1984-01-01 and is currently open access. It has received 862 citations till now. The article focuses on the topics: Very-large-scale integration.
Citations
More filters
TL;DR: This article presents a ‘boundary processor’ based on programmable gate arrays whose aim is to dynamically activate the required boundary interconnection pattern either under software control or through an on-line hardware reconfiguration facility.
6 citations
TL;DR: In this article, the authors propose systolic designs for associative memories whose cyclestimes are realistically constant and independent of their size, based on well-known principles of pipelining.
6 citations
TL;DR: It is shown that U can be represented among then nodes of a variant of the mesh of trees usingO((m/n) polylog(m/ n) storage per node such that anyn-tuple of variables may be accessed inO(logn (log logn)2) time in the worst case form polynomial inn.
Abstract: The problem of representing a setU≜{u
1,...,u
m} of read-write variables on ann-node distributed-memory parallel computer is considered. It is shown thatU can be represented among then nodes of a variant of the mesh of trees usingO((m/n) polylog(m/n)) storage per node such that anyn-tuple of variables may be accessed inO(logn (log logn)2) time in the worst case form polynomial inn.
6 citations
TL;DR: The pipelined version of the new algorithm leads to a systolic implementation whose area-time performances overcome those of the arrays of Bojanczyk, Brent and Kung and Gentleman and Kung.
Abstract: Given an m by n dense matrix A(m≧n) we consider parallel algorithms to compute its orthogonal factorization via Givens rotations. First we describe an algorithm which is executed in m+n— 2 steps on a linear array of [m/2] processors, a step being the time necessary to achieve a Givens rotation. The pipelined version of the new algorithm leads to a systolic implementation whose area-time performances overcome those of the arrays of Bojanczyk, Brent and Kung [1] and Gentleman and Kung [5].
6 citations