基于最小生成树的动态通道布线算法  

Dynamic Channel Routing Algorithm Based on Minimum Spanning Tree

作　　者：魏建军[1] 康继昌[1] 雷艳静[1] 陈付龙[1] 

机构地区：[1]西北工业大学计算机学院,陕西西安710072

出　　处：《中北大学学报（自然科学版）》2008年第2期120-124,共5页Journal of North University of China(Natural Science Edition)

基　　金：国家863计划引导项目(2003AA001018);航空科学基金资助项目(02F53031)

摘　　要：针对电子设计自动化中低的通道布线布通率,对影响布通率的因素进行了研究,分析了线网布线次序对通道布线结果的影响,比较了静态排序和动态排序的优缺点,基于最小生成树,提出了一种动态通道布线算法.在布线过程中,根据通道已布线状态,计算剩余线网加权后各自的最小生成树,优先选择受已布线线网影响最大的线网进行连接,避免连接点距离较远的线网对连接点距离较近的线网的约束.实验结果表明,对同一个布局,采用相同的布线规则,算法占有空间资源少,比商用软件在通道布线方面具有更高的布通率.Aiming at the low connection ratio of the channel routing in electronic design automation （EDA）, the influence factors are studied in detail. The routing order of the channel routing is analyzed and the characteristics of static and dynamic ordering are compared. On these bases, a minimum spanning tree （MST） based dynamic channel routing algorithm is proposed. In the routing process, the individual MST of the remaining wire nets is calculated according to the channel state. The wire net suffered most from the wire net that is routed recently is selected first to be connected to avoid the fact that the wire net with near nodes is restricted by the one with far nodes. The experiment shows that for the same layout, the MST based dynamic channel routing algorithm occupies less memory and possesses higher connection ratio than the commercial software in the channel routing under the same routing rules.

关 键 词：线网 通道布线 静态排序 动态排序 最小生成树 

分 类 号：TP391.72[自动化与计算机技术—计算机应用技术]