Advertisement

Journal of Computer Science and Technology

, Volume 20, Issue 2, pp 231–236 | Cite as

Crosstalk-Aware Routing Resource Assignment

  • Hai-Long YaoEmail author
  • Yi-Ci Cai
  • Qiang Zhou
  • Xian-Long Hong
Article

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.

Keywords

crosstalk interconnect physical design routing track/layer assignment VLSI 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Bakoglu H B. Circuits, Interconnections, and Packaging for VLSI. Addison Wesley, 1990, pp.283–303.Google Scholar
  2. [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.Google Scholar
  3. [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.Google Scholar
  4. [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.Google Scholar
  5. [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.Google Scholar
  6. [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.Google Scholar
  7. [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. [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.Google Scholar
  9. [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. [10]
    Xue T, Kuh E S. Post global routing crosstalk synthesis. TCAD, December 1997, pp.1418–1430.Google Scholar
  11. [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.Google Scholar
  12. [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.Google Scholar
  13. [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.Google Scholar
  14. [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. [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

Copyright information

© Springer Science + Business Media, Inc. 2005

Authors and Affiliations

  • Hai-Long Yao
    • 1
    Email author
  • Yi-Ci Cai
    • 1
  • Qiang Zhou
    • 1
  • Xian-Long Hong
    • 1
  1. 1.Department of Computer Science and TechnologyTsinghua UniversityBeijingP.R. China

Personalised recommendations