Skip to main content
SpringerLink
Log in

Crosstalk-Aware Routing Resource Assignment

  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bakoglu H B. Circuits, Interconnections, and Packaging for VLSI. Addison Wesley, 1990, pp.283–303.

  2. Gao T, Liu C L. Minimum crosstalk channel routing. In Proc. Int. Conf. Computer-Aided Design, Santa Clara, CA, November 1993, pp.692–696.

  3. Gao T, Liu C L. Minimum crosstalk switchbox routing. In Proc. Int. Conf. Computer-Aided Design, San Jose, CA, November 1994, pp.610–615.

  4. Zhou H, Wong D F. An optimal algorithm for river routing with crosstalk constraints. In Proc. Int. Conf. Computer-Aided Design, San Jose, CA, 1996, pp.310–315.

  5. Kastner R, Bozorgzadeh E, Sarrafzadeh M. An exact algorithm for coupling-free routing. In Proc. Int. Symp. Physical Design, Sonoma, CA, USA, April 2001, pp.10–15.

  6. Batterywala S H, Shenoy N, Nicholls W, Zhou H. Track assignment: A desirable intermediate step between global routing and detailed routing. IEEE Int. Conf. Computer Aided Design, San Jose, CA, 2002, pp.59–66.

  7. Tseng H P, Scheffer L, Sechen C. Timing and crosstalk driven area routing. In Proc. 35th ACM/IEEE Design Automation Conf., Moscone Center, San Francico, CA, USA, June 1998, pp.378–381.

    Google Scholar 

  8. Chang C C, Cong J. Pseudo pin assignment with crosstalk noise control. In Proc. Int. Symp. Physical Design, San Diego, CA, USA, 2000, pp.41–47.

  9. Yao H L, Zhou Q, Hong X L, Cai Y C. Cross point assignment algorithm with crosstalk constraint. Chinese Journal of Semiconductors, 2004, 25(4): 388–393.

    Google Scholar 

  10. Xue T, Kuh E S. Post global routing crosstalk synthesis. TCAD, December 1997, pp.1418–1430.

  11. Zhou H, Wong D F. Global routing with crosstalk constraints. In Proc. ACM/IEEE Design Automation Conference, San Francisco, CA, USA, June 1998, pp.374–377.

  12. Kay R, Rutenbar R A. Wire packing: A strong formulation of crosstalk-aware chip-level track/layer assignment with an efficient integer programming solution. In Proc. Int. Symp. Physical Design, San Diego, CA, USA, May 2000, pp.61–68.

  13. Ma J D, He L. Towards global routing with RLC crosstalk constraints. In Proc. IEEE/ACM Design Automation Conference, New Orleans, Louisiana, USA, June 2002, pp.669–672.

  14. Burkard R E, Derigs U. Assignment and Matching Problem: Solution Methods with Fortran-Programs. New York: Springer-Verlag, 1980, pp.1–15.

    Google Scholar 

  15. Garey M R, Johnson D S. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York, 1979, pp.53–56.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Technology, Tsinghua University, Beijing, 100084, P.R. China

    Hai-Long Yao, Yi-Ci Cai, Qiang Zhou & Xian-Long Hong

Authors
  1. Hai-Long Yao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yi-Ci Cai
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Qiang Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Xian-Long Hong
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hai-Long Yao.

Additional information

Supported by the National Natural Science Foundation of China under Grant No.60176016, the National Hi-Tech Development 863 Program of China under Grant No. 2002AA1Z1460, and the Specialized Research Fund for the Doctoral Program of Higher Education under Grant No.20020003008.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yao, HL., Cai, YC., Zhou, Q. et al. Crosstalk-Aware Routing Resource Assignment. J Comput Sci Technol 20, 231–236 (2005). https://doi.org/10.1007/s11390-005-0231-x

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11390-005-0231-x

Keywords

Search

Navigation