Crosstalk-aware routing resource assignment

Authors:
Hai-Long Yao;Yi-Ci Cai;Qiang Zhou;Xian-Long Hong
Affiliations:
Department of Computer Science and Technology, Tsinghua University, Beijing, P.R. China;Department of Computer Science and Technology, Tsinghua University, Beijing, P.R. China;Department of Computer Science and Technology, Tsinghua University, Beijing, P.R. China;Department of Computer Science and Technology, Tsinghua University, Beijing, P.R. China
Venue:
Journal of Computer Science and Technology
Year:
2005

Citing 13
Cited 1

Minimum crosstalk switchbox routing

ICCAD '94 Proceedings of the 1994 IEEE/ACM international conference on Computer-aided design
An optimal algorithm for river routing with crosstalk constraints

Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
Minimum crosstalk channel routing

ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
Global routing with crosstalk constraints

DAC '98 Proceedings of the 35th annual Design Automation Conference
Timing and crosstalk driven area routing

DAC '98 Proceedings of the 35th annual Design Automation Conference
Pseudo pin assignment with crosstalk noise control

ISPD '00 Proceedings of the 2000 international symposium on Physical design
Wire packing: a strong formulation of crosstalk-aware chip-level track/layer assignment with an efficient integer programming solution

ISPD '00 Proceedings of the 2000 international symposium on Physical design
An exact algorithm for coupling-free routing

Proceedings of the 2001 international symposium on Physical design
Towards global routing with RLC crosstalk constraints

Proceedings of the 39th annual Design Automation Conference
Assignment and Matching Problems: Solution Methods with FORTRAN-Programs

Assignment and Matching Problems: Solution Methods with FORTRAN-Programs
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Track assignment: a desirable intermediate step between global routing and detailed routing

Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design
Post global routing crosstalk synthesis

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Priority-based routing resource assignment considering crosstalk

Journal of Computer Science and Technology

Quantified Score

Hi-index	0.01

Visualization

Abstract

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.