scispace - formally typeset
Search or ask a question
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
Journal ArticleDOI
TL;DR: This paper provides a broader classification of graphs that make for polynomial or NP-complete instances based on the set of vertex degrees in the input graphs, yielding a comprehensive dichotomy on the complexity of the problem, with and without the restriction to trees.

3 citations

Proceedings ArticleDOI
01 Jan 1990
TL;DR: An optimal fault-tolerant broadcasting algorithm in the presence of n-1 faulty processors in the hypercube multiprocessor that takes log2(N)+1 steps to broadcast the message to all other processors.
Abstract: In this paper we describe an optimal fault-tolerant broadcasting algorithm in the presence of n-1 faulty processors in the hypercube multiprocessor. This algorithm takes log2(N)+1 steps to broadcast the message to all other processors. Our broadcasting algorithm is a procedure by which a processor can pass a message to all other processors in the network non-redundantly.

3 citations

Proceedings ArticleDOI
30 Nov 1992
TL;DR: In many modern signal processing applications, in particular real-time and adaptive signal processing, there is a strong relationship between the algorithms that compute solutions to problems and the architectures onto which the algorithms can be or should be mapped.
Abstract: In many modern signal processing applications, in particular real-time and adaptive signal processing, it turns out that there is a strong relationship between the algorithms (nested-loop type) that compute solutions to problems and the architectures (parallel/pipeline like) onto which the algorithms can be or should be mapped. From this observation it is believed that, within this class of applications, development of algorithms and design of architectures could better be considered simultaneously or even interchangeably. The framework in which such algorithms and architectures can best be expressed and designed is that of flow graphs which naturally describe both computations and communications between computations. In order to ensure a consistent design methodology, it is necessary to have a generic model and well-defined methods with which such designs can beformally undertaken. We introduce these ingredients in this paper by analyzing the prototype application of linear equations solving.

3 citations


Additional excerpts

  • ...<A'(5,5) , <4,5> 10> <A'(5,6) , <4,5> , 11> < A'(5,7) , <4,5> , 12> 5 j...

    [...]

  • ...< A'(5,5) , <4,5> , 10> < A'(5,6) , <4,5> 1 1> <A'(5,7) <4,5> , 12>...

    [...]

  • ...J=(i)F=(0)Ci=(2)G=(0)andC2=(') (7) so thatx(1,2,i) =A'(l,i)....

    [...]

Proceedings Article
01 Jan 1990
TL;DR: A simultaneous access design of a dictionary machine which supports insert, delete, and search operations is presented, and provides a fast mechanism to avoid the sequential access bottleneck in any large multiprocessor system.
Abstract: A simultaneous access design of a dictionary machine which supports insert, delete, and search operations is presented. The design is able to handle p accesses simultaneously and allows redundant accesses to occur. In the design, processors performing insert or delete operations are free to perform other tasks after submitting their accesses to the design; processors that perform search operations get their response in O(log N) time. Compared to all sequential access designs of a dictionary which require O(p) time to process p accesses, the presented design provides much higher throughput; specifically, O(p/log p) times better. It also provides a fast mechanism to avoid the sequential access bottleneck in any large multiprocessor system. >

3 citations

Journal ArticleDOI
TL;DR: The concurrency function is used to derive asymptotic estimates for speedup, including Amdahl's Law, and provides a new method for analyzing cost-effectiveness of the processor-memory-communications constituents of a computing system for applications where system cost and execution time are mutually elastic variables.
Abstract: This article introduces a mathematical function that describes the latent concurrency inherent in an arbitrary program with given initial conditions. The concurrency function is used to derive asymptotic estimates for speedup, including Amdahl's Law. It provides a new method for analyzing cost-effectiveness of the processor-memory-communications constituents of a computing system for applications where system cost and execution time are mutually elastic variables. The costs of programming and input/output are not taken into account in the present study. The methods are applied to study the relative advantages of serial versus concurrent processing; the relationship of the memory/processor ratio to cost-effectiveness; the conditions that determine the relative advantages of SIMD and MIMD control structures; the effects of various interprocessor communication strategies; and cost-effectiveness implications of the choice of data path width.

3 citations