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
Journal ArticleDOI

A Faster Parallel Algorithm for Matrix Multiplication on a Mesh Array

Sung Eun Bae, +2 more
TL;DR: It is shown that it is possible to perform matrix multiplication in just 1.5n − 1 communication steps on a two dimensional square mesh array of the same size, thus halving the number of steps required.
Journal ArticleDOI

Maximally and arbitrarily fast implementation of linear and feedback linear computations

Miodrag Potkonjak, +1 more
- 01 Jan 2000 - 
TL;DR: A computer-aided design platform is developed to optimally speed-up an arbitrary instance from this large class of computations with respect to eight optimizing transformations, and an important subclass of nonlinear computations, named feedback linear computations is efficiently, maximally, and arbitrarily sped-up.
Dissertation

Parameterized Graph Modification Algorithms

Pål Grønås Drange
TL;DR: This thesis shows that editing towards trivially perfect graphs, threshold graphs, and chain graphs are all NP-complete, resolving 15 year old open questions and provides several new results in classical complexity, kernelization complexity, and subexponential parameterized complexity.
Proceedings ArticleDOI

Integer summing algorithms on reconfigurable meshes

Koji Nakano, +1 more
TL;DR: This paper presents the following algorithms to compute the sum of n d-bit integers on reconfigurable parallel machine models: i) a constant-time algorithm on a reconfigured mesh of the bit model of size d/spl radic/n log/sup n/spl times//spl radi/n, ii) an O(log* n)-time algorithms on a Reconfigurable mesh of a reconfigureable mesh ofthe bit model.
Journal ArticleDOI

Solving visibility and separability problems on a mesh-of-processors

Frank Dehne
- 01 Nov 1988 - 
TL;DR: All proposed algorithms are asymptotically optimal (for the Mesh-of-Processors) with respect to time and number of processors.