Journal ArticleDOI
Optimal Wiring of Movable Terminals
Gopal,Coppersmith,Wong +2 more
TLDR
This paper considers the problem of local wiring in a VLSI chip and is able to find polynomial time optimal algorithms while, for others, it proves NP-completeness and suggest efficient heuristics.Abstract:
In this paper we consider the problem of local wiring in a VLSI chip. The problem is one of interconnecting two sets of terminals, one set on each side of a wiring channel, in accordance with a given interconnection pattern, and to accomplish this while minimizing some objective function. We make the further assumption that the terminals are not rigidly positioned and can be "moved" provided that this does not change the structural intent of the circuit. Several objective functions are considered-channel width, channel length, channel area, channel perimeter, number of via holes, as well as some constrained objective functions. For some of these objective functions, we are able to find polynomial time optimal algorithms while, for others, we prove NP-completeness and suggest efficient heuristics.read more
Citations
More filters
Book
Algorithms for VLSI Physical Design Automation
TL;DR: This book is a core reference for graduate students and CAD professionals and presents a balance of theory and practice in a intuitive manner.
Journal ArticleDOI
Efficient Algorithms for Layer Assignment Problem
K.C. Chang,David H. C. Du +1 more
TL;DR: The layer assignment problem for interconnect is the problem of determining which layers should be used for wiring the signal nets and an efficient algorithm for identifying essential vias is presented and discussed in this paper.
Proceedings ArticleDOI
A cell-replicating approach to minicut-based circuit partitioning
C. Kring,A.R. Newton +1 more
TL;DR: An extension to the Fiduccia and Mattheyses minicut algorithm (1982) allows cells to be replicated in both sides of the partition and can substantially reduce the number of cut nets in a partitioned network below what can be obtained without replication.
Journal ArticleDOI
Optimal channel pin assignment
TL;DR: Experimental results indicate that substantial reduction in channel density can be obtained by allowing movable terminals and polynomial time-optimal algorithms are presented for a case where the relative orderings of the terminals on the top and the bottom of the channel are completely fixed.
Journal ArticleDOI
An optimal algorithm for the maximum alignment of terminals
TL;DR: An algorithm that runs in O(p + (n − p) l g( p + 1)) time is derived, where n is the number of wires given and p is the maximum number of noncrossing wires; in many practically relevant cases, e.g., when p is very high, it needs only linear time.
References
More filters
Book
The Art of Computer Programming
TL;DR: The arrangement of this invention provides a strong vibration free hold-down mechanism while avoiding a large pressure drop to the flow of coolant fluid.
Proceedings ArticleDOI
Wire routing by optimizing channel assignment within large apertures
TL;DR: The purpose of this paper is to introduce a new wire routing method for two layer printed circuit boards based on the newly developed channel assignment algorithm and requires many via holes.
Journal ArticleDOI
Permutation Graphs and Transitive Graphs
TL;DR: Algorithms for finding a maximum size clique and a minimum coloration of transitive grapl are presented and are applicable in solving problems in memo] allocation and circuit layout.
Journal ArticleDOI
An Optimal Solution for the Channel-Assignment Problem
TL;DR: A Θ(N log N) algorithm is exhibited which is optimal for finding a minimal partition of this set of intervals such that no element of the partition contains two overlapping intervals.
An Optimal Solutionforthe Channel-Assignment Problem
TL;DR: In this article, the authors consider the channel assignment problem in the context of wire-interconnection problems and propose a partition of a set of components into k sub-sets such that the intervals in each subset are pairwise nonoverlapping.