随程序规模动态调整的通道优化布线算法  

Optimized channel routing algorithms for dynamically adjusting channel with the program size

作　　者：胡开宝[1] 张毅坤[1] 赵明 

机构地区：[1]西安理工大学计算机科学与工程学院,西安710048 [2]上海零一拼装信息技术有限公司,上海200120

出　　处：《计算机应用》2013年第4期1136-1138,1145,共4页journal of Computer Applications

基　　金：陕西省教育厅教学改革重点项目(11J15)

摘　　要：针对常规层次型布图算法在大规模程序中布线混乱的缺点,借鉴Sugiyama层次布局算法,提出了一种随着程序规模动态调整的通道优化布线算法。通过将节点的通道数目与程序规模建立函数关系,以解决现有算法在布图时出现的线路重叠和效率低下的问题;在布图中结合广义张量平衡思想,以减少交叉并实现布图的美观性;并根据调用节点之间的相对位置关系,给出了相应的线路分配和申请策略,实现了布线的有序性。实践证明,该算法能够提高布图效率,有效地减少交叉,实现节点的有序布线和实现简单等优点。To solve the routing confusion of the conventional hierarchical layout algorithm in the large-scale program,based on the Sugiyama hierarchical layout algorithm,this paper proposed an optimized algorithm for channel routing,which dynamically adjusted the number of channel according to the program size.In order to solve the low efficiency and lines overlap,the algorithm built functional relationships between channel number and program size.And by using the generalized tensor balance algorithm to reduce the crossings and realize the artistic layout.The algorithm also gave the corresponding line distribution and application strategy in accordance with the relative positional relationship between the calling nodes to achieve the ordered routing.The experimental results show that the algorithm has greater layout efficiency.It can reduce the crossings effectively,realize clear layout and is easy to implement.

关 键 词：软件可视化 层次图 广义张量平衡算法 交叉最小化 通道布线 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]