针对宏模块的合法化技术

计算机科学 ›› 2010, Vol. 37 ›› Issue (12): 266-269.

针对宏模块的合法化技术

高文超,陈福真,闫海霞,吕勇强,钱旭,周强

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

出版日期:2018-12-01 发布日期:2018-12-01
基金资助:
本文受国家自然科学基金(No. 60876026)，国家重点基础研究发展计划(No. 2009AA011901)资助。

Legalization Algorithm for Macro Problems

GAO Wen-chao,CHEN Fu-zhen,YAN Hai-xia,LU Yong-qiang,QIAN Xu,ZHOU Qiang

Online:2018-12-01 Published:2018-12-01

摘要/Abstract

摘要： 在传统的总体布局完成之后，一个很重要的步骤是消除单元之间的重叠，即合法化过程。混合模式下的宏模块会对合法化过程带来很大困难。针对宏模块的结构特点，考虑宏模块布局合理位置(site)的约束，设计实现了特别应用于宏模块的合法化算法，并在mPL6全局布局结果上进行测试，结果表明，与FastPlace相比该方法更具合理性和有效性。

关键词: 详细布局，宏模块，布局合法化，超大规模集成电路

Abstract: Placement legalization removes the overlap among cells after the global placement, and moves the cells to their final position. Macros make legalization harder to resolve in the mixed mode. According to the structure characteristics of macros,and considering the site constraint an algorithm for macros legalization was designed and implemented.The algorithm was tested on mPL6 global placement Experimental results show its reasonable quality compared with FastPlace.

Key words: Detail placement, Macro, Placement legalization, VLSI

高文超,陈福真,闫海霞,吕勇强,钱旭,周强. 针对宏模块的合法化技术[J]. 计算机科学, 2010, 37(12): 266-269. https://doi.org/

GAO Wen-chao,CHEN Fu-zhen,YAN Hai-xia,LU Yong-qiang,QIAN Xu,ZHOU Qiang. Legalization Algorithm for Macro Problems[J]. Computer Science, 2010, 37(12): 266-269. https://doi.org/

参考文献

Metrics

Viewed

Full text

Abstract

Cited

Shared

Discussed