Exploring the Scope of Unconstrained Via Minimization by Recursive Floorplan Bipartitioning

11/13/2018
by   Bapi Kar, et al.
0

Random via failure is a major concern for post-fabrication reliability and poor manufacturing yield. A demanding solution to this problem is redundant via insertion during post-routing optimization. It becomes very critical when a multi-layer routing solution already incurs a large number of vias. Very few global routers addressed unconstrained via minimization (UVM) problem, while using minimal pattern routing and layer assignment of nets. It also includes a recent floorplan based early global routability assessment tool STAIRoute <cit.>. This work addresses an early version of unconstrained via minimization problem during early global routing by identifying a set of minimal bend routing regions in any floorplan, by a new recursive bipartitioning framework. These regions facilitate monotone pattern routing of a set of nets in the floorplan by STAIRoute. The area/number balanced floorplan bipartitionining is a multi-objective optimization problem and known to be NP-hard <cit.>. No existing approaches considered bend minimization as an objective and some of them incurred higher runtime overhead. In this paper, we present a Greedy as well as randomized neighbor search based staircase wave-front propagation methods for obtaining optimal bipartitioning results for minimal bend routing through multiple routing layers, for a balanced trade-off between routability, wirelength and congestion. Experiments were conducted on MCNC/GSRC floorplanning benchmarks for studying the variation of early via count obtained by STAIRoute for different values of the trade-off parameters (γ, β) in this multi-objective optimization problem, using 8 metal layers. We studied the impact of (γ, β) values on each of the objectives as well as their linear combination function Gain of these objectives.

READ FULL TEXT

page 2

page 9

research
10/30/2018

Early Routability Assessment in VLSI Floorplans: A Generalized Routing Model

Multiple design iterations are inevitable in nanometer Integrated Circui...
research
10/24/2018

STAIRoute: Early Global Routing using Monotone Staircases for Congestion Reduction

With aggressively shrinking process nodes, physical design methods face ...
research
08/10/2018

Self-Organization Scheme for Balanced Routing in Large-Scale Multi-Hop Networks

We propose a self-organization scheme for cost-effective and load-balanc...
research
06/30/2020

Deep Learning Based Anticipatory Multi-Objective Eco-Routing Strategies for Connected and Automated Vehicles

This study exploits the advancements in information and communication te...
research
05/03/2023

Algorithmic Theory of Qubit Routing

The qubit routing problem, also known as the swap minimization problem, ...
research
09/14/2011

On the use of reference points for the biobjective Inventory Routing Problem

The article presents a study on the biobjective inventory routing proble...
research
10/22/2020

Minimal Exposure Dubins Orienteering Problem

Different applications, such as environmental monitoring and military op...

Please sign up or login with your details

Forgot password? Click here to reset