MR: A New Framework for Multilevel Full-Chip Routing
Journal
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Journal Volume
23
Journal Issue
5
Pages
793-800
Date Issued
2004-05
Date
2004-05
Author(s)
Lin, Shih-Ping
DOI
246246/200611150121528
Abstract
In this paper, we propose a novel framework for multilevel
full-chip routing considering both routabilityand performance called MR.
The two-stage multilevel framework consists of coarsening, followed byuncoarsening.
Unlike the previous multilevel routing, MR integrates global
routing, detailed routing, and resource estimation, together at each level
of the framework, leading to more accurate routing resource estimation
during coarsening and thus facilitating the solution refinement during uncoarsening.
Further, the exact routing information obtained at each level
makesMR more flexible in dealing with various routing objectives (such as
crosstalk, power, etc.). Experimental results show that MR obtains significantlybetter
routing solutions than previous works. For example, for a set
of 11 commonlyused benchmark circuits,MRachieves 100% routing completion
for all circuits, while the previous multilevel routing, the three-level
routing, and the hierarchical routing can complete routing for only2, 0, 2
circuits, respectively. In particular, the number of routing layers used by
MR is even smaller.We also have performed experiments on timing-driven
routing. The results are also verypr omising.
full-chip routing considering both routabilityand performance called MR.
The two-stage multilevel framework consists of coarsening, followed byuncoarsening.
Unlike the previous multilevel routing, MR integrates global
routing, detailed routing, and resource estimation, together at each level
of the framework, leading to more accurate routing resource estimation
during coarsening and thus facilitating the solution refinement during uncoarsening.
Further, the exact routing information obtained at each level
makesMR more flexible in dealing with various routing objectives (such as
crosstalk, power, etc.). Experimental results show that MR obtains significantlybetter
routing solutions than previous works. For example, for a set
of 11 commonlyused benchmark circuits,MRachieves 100% routing completion
for all circuits, while the previous multilevel routing, the three-level
routing, and the hierarchical routing can complete routing for only2, 0, 2
circuits, respectively. In particular, the number of routing layers used by
MR is even smaller.We also have performed experiments on timing-driven
routing. The results are also verypr omising.
Subjects
Detailed routing
estimation
global routing
layout
physical
design
design
routing
timing optimization
Other Subjects
Estimation; Iterative methods; Linear programming; Optimization; Routers; Simulated annealing; VLSI circuits; Detailed routing; Global routing; Layouts; Physical design; Routing; Timing optimization; Microprocessor chips
Publisher
Taipei:National Taiwan University Dept Chem Engn
Type
journal article
File(s)![Thumbnail Image]()
Loading...
Name
5213.pdf
Size
473.95 KB
Format
Adobe PDF
Checksum
(MD5):964b22ce191ed13709f62bf40da22be0