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: In its final form, the theorem requires that the product of spatial, temporal, and fanin complexities equal or exceed the problem complexity.
Abstract: Given certain simple and well defined operations and complexity measures, the product of spatial complexity with temporal complexity must exceed a certain minimum problem complexity if that processor is to solve that problem. Some optical processors violate that condition in a favorable direction (anomalously small temporal complexity). We next extend the requirement to embrace those optical processors. In its final form, the theorem requires that the product of spatial, temporal, and fanin complexities equal or exceed the problem complexity.
11Â citations
19 Jan 1994
TL;DR: There is strong reason to prefer local sparing over global sparing, and in some cases local sparing is better than more popular approaches to configuration.
Abstract: Local sparing is a simple way to organize the redundancy of a fault tolerant system. Any system can be locally spared. Furthermore, local sparing preserves both regularity and planarity. In spite of this, the potential usefulness of local sparing appears to have been overlooked. Suppose that the designer wishes to assure, with high probability, a fault-free copy of the n-element system desired. If local sparing is used then, as proved, i) the resulting area is /spl Theta/(log n) times the area of the system desired; ii) the wire length is /spl Oscr/(/spl radic/(log n)) times the maximum wirelength in the desired system; iii) an optimal diagnosis algorithm identifies the faulty elements in /spl Theta/(n log/sup 2/ n) time; iv) in optimal time /spl Theta/(n log n+number of wires in the desired system), a simple configuration algorithm achieves a fault-free copy of the desired system if and only if a fault-free copy exists. The authors illustrate these results for arrays, binary trees, and hypercubes. In addition, v) if Y denotes the probability of achieving a fault-free copy of the system desired then, using h-fold redundancy, the maximum rate at which elements can fail is ((/spl minus/ln Y)/n)/sup 1/h/. Local sparing is simple, widely-applicable, and low-cost. A disadvantage is that, depending on the system desired, the cost may not be optimal. However, there is strong reason to prefer local sparing over global sparing, and in some cases local sparing is better than more popular approaches to configuration. >
11Â citations
26 Apr 1992
TL;DR: The model accurately predicts the performance of mapped programs by comparing RPS predictions to actual execution times in the Poker parallel programming environment, and plans for further verification of the model on the NCube2 and other multicomputers are previews.
Abstract: The paper introduces the retargetable program-sensitive (RPS) model which predicts the performance of static, data-independent parallel programs mapped to message-passing multicomputers. It shows that the model accurately predicts the performance of mapped programs by comparing RPS predictions to actual execution times in the Poker parallel programming environment. The paper also previews plans for further verification of the model on the NCube2 and other multicomputers. >
11Â citations
01 Nov 1993
TL;DR: In this article, a two-level EXOR minimisation algorithm is proposed to simplify the representation and manipulation of Boolean functions and result in more easily testable implementations requiring fewer product terms.
Abstract: Two-level logic is most often implemented as an inclusive-OR sum of product terms, e.g. with PLAs. Using exclusive-OR (EXOR) sums may simplify the representation and manipulation of Boolean functions and result in more easily testable implementations requiring fewer product terms. However, due to the lack of relevant algorithms and efficient implementation structures, it has not been possible to translate these theoretical advantages into practical benefits. In this paper solutions for the two main problems associated with the use of EXOR sums are presented. On the one hand we describe a new method to minimise functions using two-level EXOR sums of products, on the other hand we present an implementation structure called the XPLA to map the minimisation results to efficient circuit layouts. We show, for a set of benchmark examples, that the minimisation algorithm results in representations with considerably smaller product term counts than previous EXOR minimisation algorithms or sum-of-product minimisation algorithms. We also show, although the EXOR operator is more expensive to implement in today's technologies, that XPLA implementations can be considerably more compact than PLAs in some cases, and give increased testability.
11Â citations
IBM1
TL;DR: It is shown here that a certain two- person game of perfect information is such a problem.
11Â citations