基于延迟合并嵌入的带障碍的时钟树布线算法
A DME-Based Clock Routing Algorithm with the Treatment of Obstacles
-
摘要: 提出一种在带障碍情况下,基于延迟合并嵌入方法的时钟树构建算法,并在时钟树构造过程中引入了轨迹图以保证布线可以绕过障碍.该算法以已知障碍为布线约束,首先自底向上计算时钟树内部节点的可能位置,然后自顶向下确定每个节点的确切位置.实验结果表明,该算法能够正确、有效地实现有障碍存在时的时钟树布线,线长优化率超过7%.Abstract: An effective algorithm DMEO applying the deferred-merge embedding (DME) algorithm is presented for clock tree construction in the presence of obstacles.During the clock routing,a track graph is constructed in order to guarantee the obstacle-avoidance.By considering obstruction as routing constraint,the method is composed of a bottom-up phase computing possible loci of nodes and a top-down step to determine the exact placement of each node in the clock topology tree.Experimental results show that the algorithm is promising with more than 7% wirelength reduction.
下载: