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
09 Oct 1996
TL;DR: The present work characterizes this multivariate problem in the presence of either independent and identically distributed (iid) or clustered faults in the appearance of a fault-free s/spl times/t array.
Abstract: The bulk of results for the performance of configuration architectures treat the case of failed processor, but neglect switches that are stuck open or closed. By contrast, the present work characterizes this multivariate problem in the presence of either independent and identically distributed (iid) or clustered faults. Suppose that the designer wishes to assure, with high probability, a fault-free s/spl times/t array. If local sparing is used then, as we report, the resulting area is (i) /spl Theta/(st log st) in the presence of faulty elements or faulty elements and switches stuck open; (ii) /spl Theta/(st log/sup 2/ st) in the presence of faulty elements and switches stuck closed; (iii) /spl Theta/([st]/sup 2/ log st) in the presence of faulty elements and switches that may be either stuck open or stuck closed. We also furnish bounds on maximum wirelength and an optimal configuration algorithm.
4 citations
Book•
06 Dec 2020
TL;DR: In this article, the authors aim to endow the reader with an operational, conceptual, and methodological understanding of the discrete mathematics that can be used to study, understand, and perform computing.
Abstract: In this book the authors aim to endow the reader with an operational, conceptual, and methodological understanding of the discrete mathematics that can be used to study, understand, and perform computing. They want the reader to understand the elements of computing, rather than just know them. The basic topics are presented in a way that encourages readers to develop their personal way of thinking about mathematics. Many topics are developed at several levels, in a single voice, with sample applications from within the world of computing. Extensive historical and cultural asides emphasize the human side of mathematics and mathematicians.
By means of lessons and exercises on “doing” mathematics, the book prepares interested readers to develop new concepts and invent new techniques and technologies that will enhance all aspects of computing. The book will be of value to students, scientists, and engineers engaged in the design and use of computing systems, and to scholars and practitioners beyond these technical fields who want to learn and apply novel computational ideas.
4 citations
Cites background or methods from "Computational Aspects of Vlsi"
...Even more dramatic: It has been shown that sophisticated algorithmic techniques can achieve roughly equivalent computational efficiency, on a broad range of significant computational problems, using de Bruijn networks as using like-sized hypercubes [3, 15, 109]....
[...]
...J.D. Ullman (1984): Computational Aspects of VLSI.. Computer Science Press, Rockville, Md....
[...]
...…that study the algorithmics of laying out VLSI circuits (cf. [Leiserson, 1985]) and sources that study the ability of a network’s interconnections to host a range of communication patterns that enable efficient parallel computation and communication (cf. [3], [Leiserson, 1985], and [Ullman, 1984])....
[...]
...J.D. Ullman (1984): Computational Aspects of VLSI....
[...]
11 Jun 1991
TL;DR: A subproblem of the general design space extraction problem-classifying the design for a known function type such as an adder-is solved and an algorithm is presented that uses the distribution of critical path lengths as the basis for this classification.
Abstract: A subproblem of the general design space extraction problem-classifying the design for a known function type such as an adder-is solved. An algorithm is presented that uses the distribution of critical path lengths as the basis for this classification. Experimental data are cited for a CAD tool implemented for the adder design space classification. This work also identifies the connection between the critical path lengths and the room for global optimization in a circuit. >
4 citations
13 Dec 1997
TL;DR: Since least fixpoints did not give satisfactory results, backward computation of greatest fixpoints is explored, and a technique of computation based on heuristics is proposed, and this technique has been implemented and two examples are presented.
Abstract: This paper describes a method to verify safety properties of parameterized binary tree networks of processes. The method is based on the construction of a network invariant, defined as a fixpoint. Since least fixpoints did not give satisfactory results, backward computation of greatest fixpoints is explored, and a technique of computation based on heuristics is proposed. This technique has been implemented and two examples are presented.
4 citations
TL;DR: A technique for very large scale integrated VLSI circuit design that recognizes the infeasibility of connecting pairs of terminals on modules placed on a chip based on a novel application of Lagrangian relaxation is presented.
Abstract: We present a technique for very large scale integrated VLSI circuit design that recognizes the infeasibility of connecting pairs of terminals on modules placed on a chip. The method is based on a novel application of Lagrangian relaxation. Positive empirical results obtained from difficult problems found both in the literature and in industry strongly support the usefulness of this method. It has been incorporated in the proprietary computer-aided integrated circuit design package used at Bell Communications Research Inc., that allows systems engineers to design integrated circuits independent of the manufacturing processes specified by the foundries making the chips. The method has resulted in a faster turnaround time in the Bell design process.
4 citations