scispace - formally typeset
Open AccessBook

Computational Aspects of Vlsi

Jeffrey D Ullma
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.

read more

Citations
More filters
Book ChapterDOI

The potential of on-chip multiprocessing for QCD machines

Gianfranco Bilardi, +4 more
TL;DR: It is shown that a scalable chip organization holds the promise to deliver from hundreds to thousands flop per cycle as VLSI feature size scales down from 90 nm to 20 nm, over the next dozen years.
Journal ArticleDOI

Paradigms of connectivity for computer circuits and networks

Haldun M. Ozaktas
- 01 Jul 1992 - 
TL;DR: Several concepts of connectivity for circuit graphs, including Rent's rule, line length distributions, and separators, are discussed, all of which are argued are fractal concepts.
Book ChapterDOI

Converting Affine Recurrence Equations to Quasi-Uniform Recurrence Equations

Yoav Yaacoby, +1 more
TL;DR: A method is presented for converting a system of affine recurrence equations to an equivalent system of recurrence equation that is uniform, except for points near the boundaries of its index sets.
Journal ArticleDOI

Application-specific architectural methodologies for high-throughput digital signal and image processing

F. Catthoor, +1 more
- 01 Feb 1990 - 
TL;DR: An attempt has been made to classify the architectural styles suited for application-specific high-throughput DSP (digital signal processing) applications and three architectural strategies have been identified as efficient candidates for realization, namely, microcoded multiprocessors, cooperating multiplexed data paths, and regular arrays.
Journal ArticleDOI

A unified framework for off-line permutation routing in parallel networks

Marc Baumslag, +1 more
- 01 Dec 1991 - 
TL;DR: This paper presents a general strategy for finding efficient permutation routes in parallel networks and investigates the use of this algorithm for routingmultiple permutations and extends its applicability to a wide class of graphs, including several families of Cayley graphs.