2011 21st International Conference on Field Programmable Logic and Applications 2011
DOI: 10.1109/fpl.2011.84
|View full text |Cite
|
Sign up to set email alerts
|

Timing-Driven Routing of High Fanout Nets

Abstract: It has been observed in the past that the PathFinder routing algorithm runtime could be hampered by high fanout nets, primarily due to the time spent on the initialization of the priority queue. However, a solution has only been reported for routability/wirelength driven routers. In this paper, we report two heuristics that address the same issue for timing-driven routers. We show that on standard MCNC benchmarks, the proposed techniques can achieve 1.53 and 1.56 time speed up against the versatile placement a… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Year Published

2013
2013
2020
2020

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 9 publications
references
References 11 publications
0
0
0
Order By: Relevance