TY - GEN
T1 - Optimizing the antenna area and separators in layer assignment of multi-layer global routing
AU - Liu, Wen Hao
AU - Li, Yih-Lang
PY - 2012/5/1
Y1 - 2012/5/1
N2 - Traditional solutions to antenna effect, such as jumper insertion and diode insertion peformed at post-route stage may produce extra vias and degrade circuit performance. The work in [1] suggests combining layer assignment, jumper insertion and diode insertion together to achieve a better design quality with less additional cost. Based on our observations on global and local antenna violations, this work proposes a dynamic-programming based single-net layer assignment called NALAR, which first enumerates all antenna-violation-safe layer assignment solutions of a net, and then extracts the minimum-cost one for the net. NALAR can minimize via count and separators as well. In addition, an antenna avoidance layer assignment algorithm (ANLA) adopting NALAR as its kernel not only avoids global antenna violations, but also eliminates local antenna violations. Experimental results reveal that, in 11 benchmarks, ANLA can yield 5 violation-free assignments while the algorithms of other works yield no violation-free assignment. As for the total number of antenna violations in all benchmarks, this work and the works in [2], [3] and [4] yield 21, 43506, 41261 and 29671 antenna violations, respectively. However, ANLA performs about 7 times slower than other antenna-aware layer assignment [4].
AB - Traditional solutions to antenna effect, such as jumper insertion and diode insertion peformed at post-route stage may produce extra vias and degrade circuit performance. The work in [1] suggests combining layer assignment, jumper insertion and diode insertion together to achieve a better design quality with less additional cost. Based on our observations on global and local antenna violations, this work proposes a dynamic-programming based single-net layer assignment called NALAR, which first enumerates all antenna-violation-safe layer assignment solutions of a net, and then extracts the minimum-cost one for the net. NALAR can minimize via count and separators as well. In addition, an antenna avoidance layer assignment algorithm (ANLA) adopting NALAR as its kernel not only avoids global antenna violations, but also eliminates local antenna violations. Experimental results reveal that, in 11 benchmarks, ANLA can yield 5 violation-free assignments while the algorithms of other works yield no violation-free assignment. As for the total number of antenna violations in all benchmarks, this work and the works in [2], [3] and [4] yield 21, 43506, 41261 and 29671 antenna violations, respectively. However, ANLA performs about 7 times slower than other antenna-aware layer assignment [4].
KW - Antenna effect
KW - Global routing
KW - Layer assignment
KW - Separator
KW - Via
UR - http://www.scopus.com/inward/record.url?scp=84860239999&partnerID=8YFLogxK
U2 - 10.1145/2160916.2160946
DO - 10.1145/2160916.2160946
M3 - Conference contribution
AN - SCOPUS:84860239999
SN - 9781450311670
T3 - Proceedings of the International Symposium on Physical Design
SP - 137
EP - 144
BT - ISPD'12 - Proceedings of the 2012 International Symposium on Physical Design
T2 - 2012 ACM International Symposium on Physical Design, ISPD'12
Y2 - 25 March 2012 through 28 May 2012
ER -