| 基于延迟合并嵌入的带障碍的时钟树布线算法 |
| |
| 引用本文： | 黄惠萍,陆伟成,付强,赵文庆. 基于延迟合并嵌入的带障碍的时钟树布线算法[J]. 计算机辅助设计与图形学学报, 2008, 20(6): 718-723 |
| |
| 作者姓名： | 黄惠萍 陆伟成 付强 赵文庆 |
| |
| 作者单位： | 复旦大学专用集成电路与系统国家重点实验室,上海,201203 |
| |
| 基金项目： | 国家自然科学基金 , 国家重点基础研究发展计划(973计划) , 教育部跨世纪优秀人才培养计划 , 高等学校博士学科点专项科研项目 , 上海市自然科学基金 |
| |
| 摘 要： | 提出一种在带障碍情况下，基于延迟合并嵌入方法的时钟树构建算法，并在时钟树构造过程中引入了轨迹图以保证布线可以绕过障碍．该算法以已知障碍为布线约束，首先自底向上计算时钟树内部节点的可能位置，然后自顶向下确定每个节点的确切位置．实验结果表明，该算法能够正确、有效地实现有障碍存在时的时钟树布线，线长优化率超过7％．
|
| 关 键 词： | 时钟布线 障碍 延迟合并嵌入 指定偏差 |
A DME-Based Clock Routing Algorithm with the Treatment of Obstacles |
| |
| Huang Huiping,Lu Wai-Shing,Fu Qiang,Zhao Wenqing. A DME-Based Clock Routing Algorithm with the Treatment of Obstacles[J]. Journal of Computer-Aided Design & Computer Graphics, 2008, 20(6): 718-723 |
| |
| Authors: | Huang Huiping Lu Wai-Shing Fu Qiang Zhao Wenqing |
| |
| Affiliation: | Huang Huiping Luk Wai-Shing Fu Qiang Zhao Wenqing(State Key Laboratory of ASIC & System,Fudan University,Shanghai 201203) |
| |
| 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... |
| |
| Keywords: | clock routing obstacles deferred-merge embedding prescribed skew |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
