A global router for sea-of-gates circuits
Kai-Win Lee,Carl Sechen +1 more
- pp 237-241
Reads0
Chats0
TLDR
A new global routing algorithm designed specifically for sea-of-gates circuits, which has been generalized to handle gate array and standard cell circuits and achieved uniform channel densities, which are the lowest values that have ever been reported.Abstract:
Describes a new global routing algorithm designed specifically for sea-of-gates circuits. The algorithm has been generalized to handle gate array and standard cell circuits. The main features of the algorithm are: (1) interconnection length minimization using a new Steiner tree generation method, (2) a two-stage coarse global routing method which seeks to even congestion, (3) a maze routing procedure which removes overflows and reduces the congestion, (4) vertical track assignment, and (5) congestion evening at the detailed global routing level. In tests on the MCNC benchmark circuits, the algorithm produced layouts with an average of 11% fewer routing tracks than the other algorithms. In tests on gate array benchmark circuits, the algorithm not only achieved uniform channel densities, but the maximum channel densities it produced are the lowest values that have ever been reported. >read more
Citations
More filters
Journal ArticleDOI
A survey on multi-net global routing for integrated circuits
Jiang Hu,Sachin S. Sapatnekar +1 more
TL;DR: The focus of global routing has shifted so that it is important to augment the congestion objective with metrics for timing and crosstalk, and the recent progress in these directions is summarized.
Patent
Net routing using basis element decomposition
TL;DR: In this paper, a method for routing a net on an integrated circuit device, comprising the steps of creating a list of basis elements of the net, said basis elements being defined by a predetermined size limitation, determining a complexity value for each basis element as a function of the distance between pins in the basis element, forming a hypertree for the net as function of complexity values of basis element so determined.
Proceedings ArticleDOI
A global router using an efficient approximate multicommodity multiterminal flow algorithm
TL;DR: This work shows that under certain conditions, an epsilon bound 2-terminal multicommodity flow algorithm with fractional flows is adapted to handle multiterminal commodities and derives an approximate optimal solution.
Journal ArticleDOI
A global router with a theoretical bound on the optimal solution
TL;DR: This work applies a randomized rounding procedure to derive an integer solution from the fractional multicommodity flow solution, and shows that under certain conditions, this approach derives an approximate optimal solution.
Proceedings ArticleDOI
A parallel integer programming approach to global routing
TL;DR: A flexible and highly scalable distributed algorithm for global routing that concurrently processes routing subproblems corresponding to rectangular subregions covering the chip area that generates higher quality solutions than competing methods in the open literature.
References
More filters
Journal ArticleDOI
A note on two problems in connexion with graphs
TL;DR: A tree is a graph with one and only one path between every two nodes, where at least one path exists between any two nodes and the length of each branch is given.
Journal ArticleDOI
Shortest connection networks and some generalizations
TL;DR: In this paper, the basic problem of interconnecting a given set of terminals with a shortest possible network of direct links is considered, and a set of simple and practical procedures are given for solving this problem both graphically and computationally.
Book
Data Structures and Network Algorithms
TL;DR: This paper presents a meta-trees tree model that automates the very labor-intensive and therefore time-heavy and therefore expensive process of manually selecting trees to grow in a graph.
Journal ArticleDOI
An Algorithm for Path Connections and Its Applications
TL;DR: The algorithm described in this paper is the outcome of an endeavor to answer the following question: Is it possible to find procedures which would enable a computer to solve efficiently path-connection problems inherent in logical drawing, wiring diagramming, and optimal route finding?
Journal ArticleDOI
The Rectilinear Steiner Tree Problem is $NP$-Complete
TL;DR: The problem of determining the minimum length of an optimum rectilinear Steiner tree for a set A of points in the plane is shown to be NP-complete and the emphasis of the literature on heuristics and special case algorithms is well justified.