Dynamic planning of local congestion from varying-size vias for global routing layer assignment

摘要: This work is the first to present global routing models for capturing impact of local congestion caused by varying-size vias. The are then incorporated dynamically drive a proposed layer assignment algorithm. A typical characteristic advanced technology nodes significantly-high variation in wire sizes that may exist between adjacent metal layers. Routing from cell (g-cell) its top results using via which be up twice size unit track within g-cell. significant decrease available tracks could pass boundaries Ignoring this issue hampers effectiveness traditional algorithms due acting as, now, source mismatch with detailed stage. Based on these observations, we propose “via-aware edge overflow” and “edge-aware both unstacked stacked vias arbitrary during routing. Our can used any algorithm replace overflow metrics. To show our models, also incorporate them two-stage compare competitive technique. actually evaluate solutions commercial router. In experiments report less number DRC violations only changing at routing, route Olympus-SoC Mentor Graphics.