快速有效的超大型集成电路设计布线拥挤度优化算法的研究  

Fast and Effective VLSI Routing Congestion Refinement Algorithm Research

作　　者：赵彦[1] 赵殷瑶 乔旭[1] 钱旭[1] 

机构地区：[1]中国矿业大学(北京)机电与信息工程学院,北京100083 [2]国家认证认可监督管理委员会信息中心,北京100020

出　　处：《机电产品开发与创新》2014年第5期32-34,38,共4页Development & Innovation of Machinery & Electrical Products

摘　　要：论文提出一种基于拥挤度优化的技术简称(CRT),它独立于任何布局器和布线器之外,并且适用于各类布局结果,有效的提升集成电路的布通率。CRT是一种基于模块移动的拥挤度驱动技术,通过模块的移动来有效的分配布线资源,在不影响原有布局的情况下,使水平和垂直两个方向分别进行模块移动,最后采用一种最长路径的方法快速有效的解布线拥挤决问题。In this paper, we proposed a tool called CRT （Congestion Refinement Technique）, which is independent of any placer and any router, and can be applied to various placement to improve the routability. CRT is a congestion-driven based module shifting technique. BasicaUy, it is one kind of technology that better allocating routing resources by shifting the modules. The boundary of tile is shifted in the horizontal and vertical directions without affecting the original placement. Here a longest path solution is presented to solve the problem fast and effectively.

关 键 词：快速有效 CRT 模块移动 最长路径 

分 类 号：TB47[一般工业技术—工业设计]