应用于大规模ASIC的线长驱动的合法化算法

计算机科学 ›› 2013, Vol. 40 ›› Issue (10): 18-20.

应用于大规模ASIC的线长驱动的合法化算法

高文超,周强,钱旭,蔡懿慈

中国矿业大学北京机电与信息工程学院计算机系北京100083;清华大学计算机科学与技术系北京100084;中国矿业大学北京机电与信息工程学院计算机系北京100083;清华大学计算机科学与技术系北京100084

出版日期:2018-11-16 发布日期:2018-11-16
基金资助:
本文受国家自然科学基金(61176035,60833004)资助

Wire-length Driven Legalization Algorithm for Large-scale ASIC

GAO Wen-chao,ZHOU Qiang,QIAN Xu and CAI Yi-ci

Online:2018-11-16 Published:2018-11-16

摘要/Abstract

摘要： 总体布局完成之后的核心任务就是单元位置的合法化,即在将所有的单元安放到布局区并且与合理位置(site)对齐的同时,消除单元间的重叠。为了高效地实现大规模ASIC(Application Specific Integrated Circuit,专用集成电路)的布局过程,提出一种基于线长驱动的合法化算法。它以电路总线长为优化目标,同时考虑单元布局合理位置的约束和预布障碍。在ISPD’11和DAC’12竞赛例子上进行的测试结果表明了算法在线长保护及优化方面的效果。这些测试用例都是来源于现代工业ASIC设计的实例,由此说明了算法可以稳定有效地解决工业界中大规模ASIC多种特征电路的布局合法化问题。

关键词: 布局合法化,线长驱动,大规模,集成电路

Abstract: Legalization is core task of the detail placement after global distribution of generous cells．It removes cells overlap,aligns them to the sites and places them to their final position．A wire-length driven legalization algorithm was presented in this paper．The algorithm takes the total wire-length as objective,considers the site constraint and predefined blockage．Experiments on ISPD’11and DAC’12benchmarks show that this legalization algorithm can get good wire-length results．These test cases are derived from modern industrial ASIC design,which also testify the algorithm can effectively solve the varying characteristics circuit layout legalization issues of large-scale ASIC.

Key words: Placement legalization,Wire-length driven,Large-scale,ASIC

高文超,周强,钱旭,蔡懿慈. 应用于大规模ASIC的线长驱动的合法化算法[J]. 计算机科学, 2013, 40(10): 18-20. https://doi.org/

GAO Wen-chao,ZHOU Qiang,QIAN Xu and CAI Yi-ci. Wire-length Driven Legalization Algorithm for Large-scale ASIC[J]. Computer Science, 2013, 40(10): 18-20. https://doi.org/

参考文献

[1] Hill D．Method and system for high speed detailed placement of cells within an integrated circuit design:US,6370673[P]．http://www.google.com.hk/patents/US6370673.pdf,2002-04
[2] Kahng A,Reda S,Wang Q．Architecture and details of a highquality,large-scale analytical placer[A]∥Proceedings of IEEE/ACM International Conference on Computer-Aided Design,2005[C]．California,USA,2005:890-897
[3] Viswanathan N,Pan M,Chu C．FastPlace 2.0:An efficient analytical placer for mixed-mode designs[A]∥Proceedings of Asia South Pacific Design Automation Conference,2006[C]．Yokohama,Japan,2006:195-200
[4] Cong J,Xie M．A robust detailed placement for mixed size IC designs[A]∥Proceedings of Asia South Pacific Design Automatic Conference,2006[C]．Yokohama,Japan,2006:188-194
[5] Brenner U,Paulia,Vygen J．Almost optimum placement legalization by minimum cost flow and dynamic programming[A]∥Proceedings of Intl．Symp．on Physical Design(ISPD),2004[C]．USA,2004:2-8
[6] Viswanathan N,Alpert C,Sze C,et al．The ISPD-2011 Routabi-lity-Driven Placement Contest and Benchmark Suite[A]∥Proceedings of ACM International Symposium on Physical Design,2011[C]．California,USA,2011:141-146
[7] Viswanathan N,Alpert C,Sze C,et al．The DAC 2012Routability-driven Placement Contest and Benchmark Suite[A]∥Proceedings of Design Automation Conference,2012[C]．California,USA,2012:774-782
[8] http://archive.sigda.org/dac2012/contest/other_files/dac2012_check_legality.gz
[9] http://www.gnuplot.info/download.html

Metrics

Viewed

Full text

Abstract

Cited

Shared

Discussed