Crosstalk-Aware Routing Resource Assignment

被引:0
作者
Hai-Long Yao
Yi-Ci Cai
Qiang Zhou
Xian-Long Hong
机构
[1] Tsinghua University,Department of Computer Science and Technology
来源
Journal of Computer Science and Technology | 2005年 / 20卷
关键词
crosstalk; interconnect; physical design; routing; track/layer assignment; VLSI;
D O I
暂无
中图分类号
学科分类号
摘要
Crosstalk noise is one of the emerging issues in deep sub-micrometer technology which causes many undesired effects on the circuit performance. In this paper, a Crosstalk-Aware Routing Resource Assignment (CARRA) algorithm is proposed, which integrates the routing layers and tracks to address the crosstalk noise issue during the track/layer assignment stage. The CARRA problem is formulated as a weighted bipartite matching problem and solved using the linear assignment algorithm. The crosstalk risks between nets are represented by an undirected graph and the maximum number of the concurrent crosstalk risking nets is computed as the max clique of the graph. Then the nets in each max clique are assigned to disadjacent tracks. Thus the crosstalk noise can be avoided based on the clique concept. The algorithm is tested on IBM benchmarks and the experimental results show that it can improve the final routing layout a lot with little loss of the completion rate.
引用
收藏
页码:231 / 236
页数:5
相关论文
共 4 条
  • [1] Yao H L(2004)Cross point assignment algorithm with crosstalk constraint Chinese Journal of Semiconductors 25 388-393
  • [2] Zhou Q(undefined)undefined undefined undefined undefined-undefined
  • [3] Hong X L(undefined)undefined undefined undefined undefined-undefined
  • [4] Cai Y C(undefined)undefined undefined undefined undefined-undefined