Constrained via minimization

Ahn, Kyu Ho; Sahni, Sartaj

doi:10.1109/43.205007

Cited by 13 publications

(3 citation statements)

References 11 publications

(19 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Layer assignment impacts several design objectives, such as timing, noise, and manufacturability, but our layer assignment mainly focuses on via minimization without altering any routing topology. This problem is known as constrained via minimization (CVM) [Chang and Du 1988;Chang and Cong 1999;Ahn and Sahni 1993] which is shown to be NP-complete [Naclerio et al 1989]. However, our layer assignment for via minimization inherently differs from previous works on CVM in two aspects.…”

Section: Layer Assignmentmentioning

confidence: 97%

BoxRouter 2.0

Cho

Yuan

et al. 2009

ACM Trans. Des. Autom. Electron. Syst.

View full text Add to dashboard Cite

In this article, we present BoxRouter 2.0, and discuss its architecture and implementation. As highperformance VLSI design becomes more interconnect-dominant, efficient congestion elimination in global routing is in greater demand. Hence, we propose a global router which has a strong ability to improve routability and minimize the number of vias with blockages, while minimizing wirelength. BoxRouter 2.0 is extended from BoxRouter 1.0, but can perform multi-layer routing with 2D global routing and layer assignment. Our 2D global routing is equipped with two ideas: node shifting for congestion-aware Steiner tree and robust negotiation-based A* search for routing stability. After 2D global routing, 2D-to-3D mapping is done by the layer assignment which is powered by progressive via/blockage-aware integer linear programming. Experimental results show that BoxRouter 2.0 has better routability with comparable wirelength than other routers on ISPD07 benchmark, and it can complete (no overflow) the widely used ISPD98 benchmark for the first time in the literature with the shortest wirelength. We further generate a set of harder ISPD98 benchmarks to push the limit of BoxRouter 2.0, and propose the hardened ISPD98 benchmarks to map state-of-the-art solutions for future routing research.

show abstract

Section: Layer Assignmentmentioning

confidence: 97%

BoxRouter 2.0

Cho

Yuan

et al. 2009

ACM Trans. Des. Autom. Electron. Syst.

View full text Add to dashboard Cite

show abstract

“…These algorithms transform the problem into the planar % maximum cut problem, which is solvable in polynomial time. # However, if the layout is not Manhattan with junction degrees " less or equal to three, the two-layer constrained via minimization problem was shown to be NP-hard [13]- [15].…”

mentioning

confidence: 99%

“…However, when one via is eliminated, other 5 vias might be introduced. Ahn and Sahni [15] proved that the # three-layer constrained via minimization problem remains to # be NP-hard for Manhattan routing even if the routing is restricted A to HVH channel routing. They proposed a trackby-track heuristic algorithm for layer assignment in the HVH constrained 0 via minimization problem.…”

mentioning

confidence: 99%