Computational Aspects of Vlsi

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.

...read moreread less

Citations

PDF

Open Access

More filters

Journal Article•DOI•

Fast parallel algorithms for the Maximum Empty Rectangle problem

[...]

Amitava Datta¹, R. Srikant¹, G. D. S. Ramkumar¹, Kamala Krithivasan¹•Institutions (1)

Indian Institute of Technology Madras¹

01 Mar 1992-Sadhana-academy Proceedings in Engineering Sciences

TL;DR: This paper presents efficient parallel algorithms for the maximum empty rectangle problem on crew pram and anO(logn) time algorithm on a mesh-of-trees architecture.

...read moreread less

Abstract: We present efficient parallel algorithms for the maximum empty rectangle problem in this paper. On crew pram, we solve the area version of this problem inO(log 2 n) time usingO(nlogn) processors. The perimeter version of this problem is solved inO(logn) time usingO(nlog 2 n) processors. On erew pram, we solve both the problems inO(logn) time usingO(n 2/logn) processors. We also present anO(logn) time algorithm on a mesh-of-trees architecture.

...read moreread less

3 citations

Cites background from "Computational Aspects of Vlsi"

...Since the lower bound for solving any problem on a mesh-of-trees is fl(logn) ( Ullman 1984; Lodi & Pagli 1985), we state the following....
[...]
...There are n rows and n columns in this grid and n is assumed to be a power of 2. Each row and each column is connected as a complete binary tree. For details see Ullman (1984) ....
[...]
...The mesh of trees architecture ( Ullman 1984 ) is a square grid of n 2 processors without any interconnection between them....
[...]
...This takes O(logn) time ( Ullman 1984; Lodi & Pagli 1985)....
[...]

Journal Article•DOI•

Energy efficient computing by multi-mode addition

[...]

Amir Albeck¹, Shmuel Wimer¹•Institutions (1)

Bar-Ilan University¹

01 Sep 2016-Integration

TL;DR: This work takes advantage of the infrequent worst-case occurrences by designing adders for the average-case, and shows that for cases where the system critical paths are dictated by the adders, the system operation voltage can be scaled, without harming the clock cycle and with very small performance degradation.

...read moreread less

3 citations

Cites background or methods from "Computational Aspects of Vlsi"

...Such performance metric is reminiscent of the well-known AT(2) metric, commonly used in the analysis of algorithms and their hardware implementation [16]....
[...]
...The impact of the adders on delay paths criticality in an image processor [16]....
[...]

Journal Article•DOI•

A generalized simultaneous access dictionary machine

[...]

Zhenqiang Fan, Kam-Hoi Cheng

01 Apr 1991-IEEE Transactions on Parallel and Distributed Systems

TL;DR: In this paper, a simultaneous access design of a dictionary machine which supports insert, delete, and search operations is presented, which is able to handle p accesses simultaneously and allows redundant accesses to occur.

...read moreread less

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. >

...read moreread less

3 citations

Book Chapter•DOI•

A formal definition for systolic systems

[...]

D. De Baer¹, Jan Paredaens¹•Institutions (1)

University of Antwerp¹

25 May 1987

3 citations

Proceedings Article•DOI•

Operations on sets of intervals - an exercise for data structures or algorithms

[...]

Bob P. Weems¹•Institutions (1)

University of Texas at Arlington¹

01 Feb 1989

TL;DR: Ordered linked lists are introduced in data structures courses and are frequently encountered in the study of algorithms.

...read moreread less

Abstract: Ordered linked lists are introduced in data structures courses and are frequently encountered in the study of algorithms. Set operations (e.g. union, intersection) on sets of real intervals provide a non-trivial exercise in developing correct algorithms for manipulating lists.

...read moreread less

3 citations

Collapse

Computational Aspects of Vlsi

Citations

Cites background from "Computational Aspects of Vlsi"

Cites background or methods from "Computational Aspects of Vlsi"

Related Papers (5)