NDLI: Detailed-Routing Algorithms for Dense Pin Clusters in Integrated Circuits

Content Provider	IEEE Xplore Digital Library
Author	Ozdal, M.M.
Copyright Year	1982
Abstract	As design complexities and circuit densities are increasing, the detailed-routing (DR) problem is becoming a more and more challenging problem. Due to the high complexity of DR algorithms, it is very important to start the routing process with clean solutions rather than starting with suboptimal routes and trying to fix them in an iterative process. In this paper, we propose an escape-routing algorithm that can optimize routing of a set of nets around their terminals. For this, we first propose a polynomial-time algorithm that guarantees to find the optimal escape-routing solution for a set of nets when the track structures are uniform. Then, we use this algorithm as a baseline and study the general problem with arbitrary track structures. For this, we propose a novel multicommodity-flow (MCF) model that has a one-to-one correspondence with the escape-routing problem. This MCF model is novel in the sense that the interdependence and contention between different flow commodities is minimal. Using this model, we propose a Lagrangian-relaxation-based algorithm to solve the escape problem. Our experiments demonstrate that this algorithm improves the overall routability significantly by reducing the number of nets that require rip-up and reroute.
Sponsorship	IEEE Council on Electronic Design Automation IEEE Circuits and Systems Society
Starting Page	340
Ending Page	349
Page Count	10
File Size	882380
File Format	PDF
ISSN	02780070
Volume Number	28
Issue Number	3
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2009-03-01
Publisher Place	U.S.A.
Access Restriction	One Nation One Subscription (ONOS)
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Clustering algorithms Routing Iterative algorithms Circuits Lagrangian functions Design for manufacture Design automation Polynomials Transistors Algorithm design and analysis network flow Detailed routing escape routing Lagrangian relaxation
Content Type	Text
Resource Type	Article
Subject	Computer Graphics and Computer-Aided Design Electrical and Electronic Engineering Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Archer: A History-Based Global Routing Algorithm

Iterative placement improvement by network flow methods

Correctly Modeling the Diagonal Capacity in Escape Routing

Algorithms for simultaneous escape routing and Layer assignment of dense PCBs

A Polygon-to-Rectangle Conversion Algorithm

Fast and exact simultaneous gate and wire sizing by Lagrangian relaxation

Wolverines: standard cell placement on a network of workstations

Optimal channel pin assignment

A New Strategy for Simultaneous Escape Based on Boundary Routing

Detailed-Routing Algorithms for Dense Pin Clusters in Integrated Circuits

Similar Documents

Archer: A History-Based Global Routing Algorithm

Iterative placement improvement by network flow methods

Correctly Modeling the Diagonal Capacity in Escape Routing

Algorithms for simultaneous escape routing and Layer assignment of dense PCBs

A Polygon-to-Rectangle Conversion Algorithm

Fast and exact simultaneous gate and wire sizing by Lagrangian relaxation

Wolverines: standard cell placement on a network of workstations

Optimal channel pin assignment

A New Strategy for Simultaneous Escape Based on Boundary Routing

Detailed-Routing Algorithms for Dense Pin Clusters in Integrated Circuits