基于线网类型分析的过点分配算法  

Cross Point Assignment Algorithm Based on Analysis of Net Type

作　　者：李江[1] 洪先龙[1] 乔长阁[1] 蔡懿慈[1] 

机构地区：[1]清华大学计算机系,北京100084

出　　处：《Journal of Semiconductors》1997年第8期609-615,共7页半导体学报（英文版）

基　　金：国家攻关项目

摘　　要：过点分配是布线过程中位于总体布线和详细布线之间的一个步骤，它用于在详细布线之前确定线网在总体布线单元边界上的物理位置．本文提出一种新的过点分配的启发式算法，它基于总体布线后的线网类型的分析，考虑了总体布线单元中障碍对过点分配的影响，把整个布线区域的过点分配问题转化成一系列的单列（行）总体布线单元边界的过点分配问题，然后利用经典的线性分配方法进行过点的分配．Cross Point Assignment (CPA) is a routing process in the routing system between global routing and detailed routing. The aim of this process is to decide the precisephysical position on the boundaries of the global routing cells(GRCs). This paper gives anew heuristic algorithm for the CPA, which bases on the analysis of the net type afterglobal roting and takes into account the effect of the obstacles inside the GRC during theprocess of the CPA. This algorithm translates the CPA for the whole rouiting area into asequence of single column(row) cross point assignment, and does the CPA using the classic linear assignment algorithm.

关 键 词：集成电路 布线 过点分配 

分 类 号：TN405.97[电子电信—微电子学与固体电子学]