Redundant-via-aware ECO routing

Chien, Hsi-An; Wang, Ting-Chi

doi:10.1109/aspdac.2014.6742927

Cited by 5 publications

(1 citation statement)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Double via insertion during post-routing layout optimization or identifying a viafailure aware routing [7] as depicted in Fig. 1 or even redundant via aware ECO routing during mask optimization [8] for increased reliability and yield of the fabricated design are some of the known approaches to minimize these failures. Moreover, vias consume substantial routing area and pose as additional routing blockages in the routing regions impacting routability of the design.…”

Section: Introductionmentioning

confidence: 99%

Exploring the Scope of Unconstrained Via Minimization by Recursive Floorplan Bipartitioning

Kar¹,

Sur-Kolay²,

Mandal³

2018

Preprint

View full text Add to dashboard Cite

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 pa ern routing and layer assignment of nets. It also includes a recent floorplan based early global routability assessment tool STAIRoute [15].is 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. ese regions facilitate monotone pa ern routing of a set of nets in the floorplan by STAIRoute.e area/number balanced floorplan bipartitionining is a multi-objective optimization problem and known to be NP-hard [25]. 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 multiobjective 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.

show abstract

Section: Introductionmentioning

confidence: 99%