期刊文献+

随程序规模动态调整的通道优化布线算法 被引量:3

Optimized channel routing algorithms for dynamically adjusting channel with the program size
下载PDF
导出
摘要 针对常规层次型布图算法在大规模程序中布线混乱的缺点,借鉴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.
出处 《计算机应用》 CSCD 北大核心 2013年第4期1136-1138,1145,共4页 journal of Computer Applications
基金 陕西省教育厅教学改革重点项目(11J15)
关键词 软件可视化 层次图 广义张量平衡算法 交叉最小化 通道布线 software visualization hierarchical graph generalized tensility balance algorithm crossing minimization channel routing
  • 相关文献

参考文献14

二级参考文献29

  • 1欧胜高,刘超.一种基于通道的层次布图算法的研究和实现[J].计算机应用研究,2004,21(11):173-174. 被引量:2
  • 2赵国庆,黄荣怀,陆志坚.知识可视化的理论与方法[J].开放教育研究,2005,11(1):23-27. 被引量:354
  • 3黄荣怀.关于教育技术学领域中的若干关键技术[J].中国电化教育,2005(4):5-9. 被引量:33
  • 4沈海华.对象模型图的逆向分析与自动生成工具的研究与开发[M].北京:北京航空航天大学计算机科学与工程系,1997..
  • 5-.基于程序可视化理论的算法教学环境的研究[M].济南:山东工业大学出版社,..
  • 6NIKOLOV N S, TARASSOV A. Graph layering by promotion of nodes[ J]. Discrete Applied Mathematics, 2006, 154 (5) : 848 - 860.
  • 7MARTIR. Arc crossing minimization in graphs With GRASP[ J]. IIE Transactions, 2001,33(10) : 913 -919.
  • 8E R Gansner,et al.Dag:A Program that Draws Directed Graphs[J].Software:Practice and Experience,1988,18(11):1047- 1062.
  • 9P Luder,R Ernst,S Stille.An Approach to Automatic Display Layout Using Combinatorial Optimization Algorithms[J].Software:Practice and Experience,1995,25(11):1183- 1202.
  • 10Battista,G. D. , Eades,P. ,Tamassia,R. & Tollis,I. G. (1999).Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, 1999.

共引文献42

同被引文献37

  • 1赵国庆,杨南应,贾振洋,范典,黄荣怀.概念图的布局算法研究[J].开放教育研究,2005,11(5):32-37. 被引量:13
  • 2王鑫,袁晓洁.实现UML二元关系的规范化方法[J].计算机工程,2006,32(21):79-81. 被引量:3
  • 3何鹏,陆建新,施佺,陈继红.一种园区级网络拓扑图布局算法[J].微计算机信息,2007,23(03X):143-145. 被引量:5
  • 4Rohrer R M,Swing E.Web-based information visualization[J].Computer Graphics and Applications,1997,17(4):52-59.
  • 5孙小红,武伟磊.基于标量场的网络拓扑布局算法[C].中国计算机用户协会信息系统分会2008 年信息交流大会论文集,2008:196-199.
  • 6Eades P.A heuristic for graph drawing[J].Congressus Numerantium,1984,42:149-160.
  • 7Kamada T,Kawai S.An algorithm for drawing generalundirected graphs[J].Information Processing Letters,1989,31(1):7-15.
  • 8Davidson R,Harel D.Drawing graphs nicely using simulatedannealing[J].ACM Transactions on Graphics,1996,15(4):301-303.
  • 9Fruchterman T M J,Reingold E M.Graph drawing by forcedirectedplacement[J].Software:Practice and Experience,1991,21(11):1129-1164.
  • 10Noack A.Graph drawing[M].Berlin/Heidelberg:Springer,2004:425-436.

引证文献3

二级引证文献9

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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