A bottom-up layout technique based on two-rectangle routing

doi:10.1016/0167-9260(87)90017-4

Integration

Volume 5, Issues 3–4, December 1987, Pages 231-246

https://doi.org/10.1016/0167-9260(87)90017-4 Get rights and content

Abstract

We propose a novel technique for solving the VLSI layout problem. The strategy is to recursively interconnect a set of modules, in conformity with the design rules. The basic step consists of merging a pair of strongly-connected modules. An optimal algorithm for routing around two modules, and variations thereof, are presented; the running time is O(n log n) where n is the total number of terminals. The whole layout is provably wirable with three conducting layers.

References (11)

B.S. Baker
A provably good algorithm for the two module routing problem
SIAM J. Comput.
(1986)
Chandrasekhar, M.S. and M.A. Breuer, Optimum placement of two rectangular blocks, Technical Report, Department of...
Chen, N.P., C.P. Hsu and E.S. Kuh, The Berkeley building block layout system, Technical Report, Electronics Research...
T.F. Gonzalez et al.
An optimal algorithm for optimal routing around a rectangle
A. Hashimoto et al.
Wire routing by channel assignment within large apertures

There are more references available in the full text version of this article.

Cited by (11)

On minimizing the maximum congestion for weighted hypergraph embedding in a cycle
2003, Information Processing Letters
The problem of Weighted Hypergraph Embedding in a Cycle (WHEC) is to embed the weighted hyperedges of a hypergraph as adjacent paths around a cycle, such that the maximum congestion over any physical link in the cycle is minimized. In this paper, we first show that even when hyperedges contain exactly two vertices, the WHEC problem is NP-complete. Afterwards we formulate the problem as an Integer Linear Program (ILP). Then, a solution with approximation ratio of two is presented by using LP-based rounding algorithm. Finally, to improve the efficiency, we develop a linear-time approximation algorithm to provide an embedding with congestion at most two times the optimum.
Improved approximation algorithms for embedding hyperedges in a cycle
1998, Information Processing Letters
Approximation algorithms for embedding hyperedges in a cycle so as to minimize the maximum congestion are presented. Our algorithms generate an embedding by transforming the problem into another problem solvable in polynomial time. One algorithm transforms it to a linear programming problem, and the other one to the problem of embedding edges in a cycle. Both algorithms generate an embedding with congestion at most twice of that in an optimal solution. Our problem has applications in CAD and parallel computation.
An efficient one-side height minimization algorithm for routing around a rectangle
1992, Information Processing Letters
Routing in and around a rectangle using the overlap model
1991, Integration, the VLSI Journal
This paper describes a new approach to the routing-around-rectangle and the switch-box routing problems using the overlap model of layer assignment. The overlap model allows tracks to be laid on top of each other as permitted by the real design rules. The technique is simple and elegant with results better than the optimal solutions under the directional model and with at most one via per sub-net.
Tree placement in Cascode-Switch macros
1991, Integration, the VLSI Journal
In macro design using Cascode Voltage Switch Logic (CVSL) goal is to maximize the number of variable alignments by finding a good placement of logic trees and dictating their internal configuration. In this paper, a tree placement technique, ensuring at least half of the total number of alignments over all possible placements, is proposed. A heuristic algorithm, being a recursive version of the proposed technique, further increases the number of alignments.
Efficient algorithms for minimum congestion hypergraph embedding in a cycle
2006, IEEE Transactions on Parallel and Distributed Systems

View all citing articles on Scopus

^☆: This work was supported in part by the Semiconductor Research Corporation under contract RSCH 84-06-049-6.

View full text

A bottom-up layout technique based on two-rectangle routing☆

Abstract

A provably good algorithm for the two module routing problem

SIAM J. Comput.

An optimal algorithm for optimal routing around a rectangle

Wire routing by channel assignment within large apertures