摘要
创新点
多层绕障斯坦纳布线是现代超大规模集成电路物理设计的一个基础性问题。 此外, 随着当前芯片特征尺寸步入深亚微米阶段, 传统的曼哈顿布线结构不能较好的满足设计需求, 因此新兴的非曼哈顿成为了当前的研究热点。 在本文, 我们设计了 MLXR, 它是一种针对分布在芯片层上的漏点和障碍物集合, 能高效地构建一棵多层绕障 X-结构斯坦纳最小树的布线算法。 更详细地讲, MLXR 采用一种基于查找表的框架, 通过构建一棵三维无障最小生成树作为基本架构, 采用三种新颖的基于投影的绕障策略, 并结合两种有效的精炼技术, 最终将这棵三维最小生成树转化为一棵多层绕障 X-结构斯坦纳最小树。 实验结果表明, 同现有的最先进算法相比, MLXR 在布线总长和运行速度两个方面都是非常出色的。
References
Lin C W, Chen S Y, Li C F, et al. Multilayer obstacleavoiding rectilinear Steiner tree construction based on spanning graphs. IEEE Trans Comput-Aided Des Integr Circuits Syst, 2008, 27: 2007–2016
Liu C H, Chen I C, Lee D T. An efficient algorithm for multi-layer obstacle-avoiding rectilinear Steiner tree construction. In: Proceedings of the 49th Annual Design Automation Conference. New York: ACM, 2012. 613–622
Shen W X, Cai Y C, Hong X L, et al. A single layer zero skew clock routing in X architecture. Sci China Ser F-Inf Sci, 2009, 52: 1466–1475
Huang X, Liu G, Guo W, et al. Obstacle-avoiding algorithm in X-architecture based on discrete particle swarm optimization for VLSI design. ACM Trans Des Autom Electron Syst, 2015, 20: 1–28
Ho T Y, Chang C F, Chang Y W, et al. Multilevel full-chip routing for the X-based architecture. In: Proceedings of the 42nd Annual Design Automation Conference. New York: ACM, 2005. 597–602
Liu G, Huang X, Guo W, et al. Multilayer obstacleavoiding X-architecture Steiner minimal tree construction based on particle swarm optimization. IEEE Trans Syst Man Cybern B, 2015, 45: 989–1002
Lin Y C, Chien H A, Shih C C, et al. A multilayer obstacles-avoiding router using X-architecture. WSEAS Trans Circuits Syst, 2008, 7: 879–888
Bentley J L, Friedman J H. Fast algorithm for constructing minimal spanning trees in coordinate spaces. IEEE Trans Comput, 1978, 100: 97–105
Author information
Authors and Affiliations
Corresponding author
Additional information
The authors declare that they have no conflict of interest.
Rights and permissions
About this article
Cite this article
Huang, X., Guo, W., Liu, G. et al. MLXR: multi-layer obstacle-avoiding X-architecture Steiner tree construction for VLSI routing. Sci. China Inf. Sci. 60, 19102 (2017). https://doi.org/10.1007/s11432-015-0850-4
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s11432-015-0850-4