期刊文献+

基于线网类型分析的过点分配算法 被引量:3

Cross Point Assignment Algorithm Based on Analysis of Net Type
下载PDF
导出
摘要 过点分配是布线过程中位于总体布线和详细布线之间的一个步骤,它用于在详细布线之前确定线网在总体布线单元边界上的物理位置.本文提出一种新的过点分配的启发式算法,它基于总体布线后的线网类型的分析,考虑了总体布线单元中障碍对过点分配的影响,把整个布线区域的过点分配问题转化成一系列的单列(行)总体布线单元边界的过点分配问题,然后利用经典的线性分配方法进行过点的分配. 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.
出处 《Journal of Semiconductors》 EI CAS CSCD 北大核心 1997年第8期609-615,共7页 半导体学报(英文版)
基金 国家攻关项目
关键词 集成电路 布线 过点分配 Algorithms Computer circuits Electric network analysis
  • 相关文献

参考文献1

  • 1Hong X L,Proc of 29th Design Autom*ation Conference,1992年

同被引文献23

  • 1Batterywala S H,Shenoy H,Nicholls W,et al.Track assignment:a desirable intermediate step between global routing and detailed routing.IEEE International Conference on Computer Aided Design,San Jose,CA,2002:59
  • 2Kao W O,Parng T M.Cross point assignment with global rerouting for general-architecture designs.IEEE Trans Comput-Aided Des,1995,14:337
  • 3Tseng H P,Scheffer L,Sechen C.Timing and crosstalk driven area routing.In:Proc 35th ACM/IEEE Design Automation Conf,1998:378
  • 4Chang C C,Cong J.Pseudo pin assignment with crosstalk noise control.In:Proc Int Symp on Physical Design,2000:41
  • 5Huang Songjue,Hong Xianlong,Cai Yici,et al.Parallel cross point assignment algorithm with nets priority.Microelectronics,2000,30:28(in Chinese)[黄松珏,洪先龙,蔡懿慈,等.带线网优先级分类的并行过点分配算法.微电子学,2000,30:
  • 6Zhang Yiqian,Xie Min,Hong Xianlong,et al.Cross point assignment algorithm under consideration of very long nets.Chinese Journal of Semiconductors,2002,23(6):582
  • 7Burkard R E,Derigs U.Assignment and matching problem:solution methods with fortran-programs.New York:Springer-Verlag,1980
  • 8Hong X L,Huang J,Cheng C K,et al.FARM:an efficient feed-through pin assignment algorithm.29th Design Automation Conference,1992:530
  • 9Kastner R, Bozorgzadeh E, Sarrafzadeh M. An exact algo-rithm for coupling-free routing.In:Proc International Symposium on Physical Design,2001:10
  • 10Jagota A,Pelillo M,Rangarajan A.A new deterministic annealing algorithm for maximum clique.Proc IJCNN'2000-Int J Conf on Neural Networks,IEEE Computer Society Press,2000,6:505

引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部