Routing Congestion
Cross-source consensus on Routing Congestion from 1 sources and 4 claims.
1 sources · 4 claims
How it works
Highlighted claims
- Routing congestion is modeled as a sparse demand-supply field over routing grid edges rather than only as a netlist node label. — Graph Computation Meets Circuit Algebra: A Task-Aligned Analysis of Graph Neural Networks for Electronic Design Automation
- Congestion is defined as the positive excess of demand over supply, and overflow sums that excess over grid edges. — Graph Computation Meets Circuit Algebra: A Task-Aligned Analysis of Graph Neural Networks for Electronic Design Automation
- Congestion models need to encode both hypergraph connectivity and spatial resource fields. — Graph Computation Meets Circuit Algebra: A Task-Aligned Analysis of Graph Neural Networks for Electronic Design Automation
- RUDY estimates routing demand from nets crossing bounding boxes, with variants that account for practical routing details. — Graph Computation Meets Circuit Algebra: A Task-Aligned Analysis of Graph Neural Networks for Electronic Design Automation