2021
DOI: 10.1109/tcad.2020.3002546
|View full text |Cite
|
Sign up to set email alerts
|

A DAG-Based Algorithm for Obstacle-Aware Topology-Matching On-Track Bus Routing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
0
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 13 publications
(1 citation statement)
references
References 14 publications
0
0
0
Order By: Relevance
“…Kim et al [14] introduced a compact topologyaware bus routing approach capable of synthesizing the routing topology of the bus while minimizing design rule violations in designs with high bus density and track utilization. Chen et al [15] proposed a maze routing method to address non-uniform track resources using a concurrent and hierarchical scheme for buses, whereas Hsu et al [16] applied a directed acyclic graph (DAG)-based algorithm to connect buses and alleviate routing congestion through rip-up and rerouting. Additionally, Zhang et al [17] introduced the concept of topological Boolean satisfiability to verify the legality of a segment during the detailed routing stage and determine the existence of feasible bit ordering.…”
Section: Previous Workmentioning
confidence: 99%
“…Kim et al [14] introduced a compact topologyaware bus routing approach capable of synthesizing the routing topology of the bus while minimizing design rule violations in designs with high bus density and track utilization. Chen et al [15] proposed a maze routing method to address non-uniform track resources using a concurrent and hierarchical scheme for buses, whereas Hsu et al [16] applied a directed acyclic graph (DAG)-based algorithm to connect buses and alleviate routing congestion through rip-up and rerouting. Additionally, Zhang et al [17] introduced the concept of topological Boolean satisfiability to verify the legality of a segment during the detailed routing stage and determine the existence of feasible bit ordering.…”
Section: Previous Workmentioning
confidence: 99%