Proceedings of the 46th Annual Design Automation Conference 2009
DOI: 10.1145/1629911.1629999
|View full text |Cite
|
Sign up to set email alerts
|

Grip

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2015
2015
2024
2024

Publication Types

Select...
3
3

Relationship

0
6

Authors

Journals

citations
Cited by 42 publications
(1 citation statement)
references
References 10 publications
0
1
0
Order By: Relevance
“…There are two main strategies to solve the global routing problem: three-dimensional (3D) global routing and two-dimensional (2D) global routing followed by layer assignment. A 3D global router transforms the global tiles of all routing layers into a 3D global routing graph and applies maze routing or an integer linear programming (ILP) formulation to directly derive 3D routing paths [13,16]. Due to the increasing number of routing layers and chip size, the extremely high routing complexity can result in prohibitively large runtime cost.…”
Section: Introductionmentioning
confidence: 99%
“…There are two main strategies to solve the global routing problem: three-dimensional (3D) global routing and two-dimensional (2D) global routing followed by layer assignment. A 3D global router transforms the global tiles of all routing layers into a 3D global routing graph and applies maze routing or an integer linear programming (ILP) formulation to directly derive 3D routing paths [13,16]. Due to the increasing number of routing layers and chip size, the extremely high routing complexity can result in prohibitively large runtime cost.…”
Section: Introductionmentioning
confidence: 99%