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: An approach for fault detection in layered interconnection networks (LINs) is presented, based on two novel results in the execution of the network flow algorithm to find node disjoint path sets, while retaining optimality in the number of configurations.
Abstract: We present an approach for fault detection in layered interconnection networks (LINs). An LIN is a generalized multistage interconnection network commonly used in reconfigurable systems; the nets (links) are arranged in sets (referred to as layers) of different size. Switching elements (made of simple switches such as transmission-gate-like devices) are arranged in a cascade to connect pairs of layers. The switching elements of an LIN have the same number of switches, but the switching patterns may not be uniform. A comprehensive fault model for the nets and switches is assumed at physical and behavioral levels. Testing requires configuring the LIN multiple times. Using a graph approach, it is proven that the minimal set of configurations corresponds to the node disjoint path sets. The proposed approach is based on two novel results in the execution of the network flow algorithm to find node disjoint path sets, while retaining optimality in the number of configurations. These objectives are accomplished by finding a feasible flow such that the maximal degree can be iteratively decreased, while guaranteeing the existence of an appropriate circulation. Net adjacencies are also tested for possible bridge faults (shorts). To account for 100 percent fault coverage of bridge faults a postprocessing algorithm may be required; bounds on its complexity are provided. The execution complexity of the proposed approach (inclusive of test vector generation and post-processing) is O(N/sup 4/WL), where N is the total number of nets, W is the number of switches per switching element, and L is the number of layers. Extensive simulation results are provided.
6 citations
Cites background from "Computational Aspects of Vlsi"
...Note that an LIN is a generalization of an MIN; for example, a K-stage MIN [24] (such as a delta network) with switches with two inputs and two outputs is topologically equivalent to an LIN with N ¼ LK, L � 1 ¼ log2K and 2K ¼ W (the switching patterns of the elements are arranged accordingly, such as the perfect shuffle [ 23 ], [24])....
[...]
01 Oct 2000
TL;DR: This paper introduces the idea of adaptive algorithm which runs on RM of variable sizes without compromising the AT2 optimality, and supports the idea by developing adaptive algorithms for sorting items and computing the contour of maximal elements of a set of planar points on RM.
Abstract: Recently self-simulation algorithms have been developed to execute algorithms on a reconfigurable mesh (RM) of size smaller than recommended in those algorithms. Optimal slowdown, in self-simulation, has been achieved with the compromise that the resultant algorithms fail to remain AT2 optimal. In this paper, we introduce, for the first time, the idea of adaptive algorithm which runs on RM of variable sizes without compromising the AT2 optimality. We support our idea by developing adaptive algorithms for sorting items and computing the contour of maximal elements of a set of planar points on RM.
6 citations
14 Jun 1989
TL;DR: This work considers the problem of producing aesthetically nice drawings of graphs from the complexity point of view and considers how to formalize in algorithmic terms that a drawing is nice.
Abstract: We consider the problem of producing aesthetically nice drawings of graphs from the complexity point of view. The following questions are immediate:
(1)
How to formalize in algorithmic terms that a drawing is nice?
(2)
What are the computational costs for nice drawings?
(3)
Are there tools to beat the NP-completeness?
6 citations
17 Mar 1986
TL;DR: A by-product of this paper is to show how a denotational specification of a nontrivial application can directly lead to a running prototype, using here the ML programming language as an “executable specification language”.
Abstract: One of the best known techniques to compile sequential programs for multiprocessors is to detect the so called reduction operations. An example of such an operation is the sum of vector elements which can be evaluated under a pyramidal scheme using the associativity property of addition. A method to detect such operations in a PASCAL or FORTRAN-like programming language is presented. This detection and the corresponding modifications to the source programs are considered as non-standard denotational interpretations of the abstract syntax tree of the object programs. A by-product of this paper is to show how a denotational specification of a nontrivial application can directly lead to a running prototype, using here the ML programming language as an “executable specification language”.
6 citations
TL;DR: The presented embedding methods are optimized mainly for balancing the processor loads, while minimizing dilation and congestion as far as possible.
6 citations