Skip to main content
Log in

Priority-Based Routing Resource Assignment Considering Crosstalk

Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

Crosstalk has become one of the most critical concerns in very deep sub-micron era. This paper deals with the problem of crosstalk mitigation at both methodological and algorithmic levels. Noting that intermediate operations between global routing and detailed routing are very effective in crosstalk estimation and reduction, the authors propose to incorporate several intermediate steps that are separated in traditional design flow into an integrated routing resource assignment stage, so that the operations could easily cooperate to fully exert their power on crosstalk reduction. An efficient priority-based heuristic algorithm is developed, which works slice by slice. Crosstalk avoidance, and many other aspects that are critical in routing practice including congestion, vias, layer preference, etc., are taken into account. A track reservation strategy is adopted in the algorithm framework to compensate the undesired effects caused by sequential routing. Experimental results on a series of ISPD98 and industrial benchmarks show that the proposed approach is able to reduce capacitive crosstalk by about 70% on average without compromising completion ratio compared with a previously reported graph based algorithm, demonstrating the advantages of the approach.

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

Access this article

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. Becer M R, Blaauw D, Panda R et al. Early probabilistic noise estimation for capacitively coupled interconnects. IEEE Trans. Computer-Aided Design, 2003, 22(3): 337–345.

    Article  Google Scholar 

  2. Gao T, Liu C L. Minimum crosstalk channel routing. IEEE Trans. Computer-Aided Design, 1996, 15(5): 465–474.

    Article  MathSciNet  Google Scholar 

  3. Pan S, Chang Y. Crosstalk constrained performance optimization by using wire sizing and perturbation. In Proc. Int. Conf. Computer Design, Austin, Texas, Sept. 17–20, 2000, pp.581–584.

  4. Lepak K M, Xu M, Chen J, He L. Simultaneous shield insertion and net ordering under explicit RLC noise constraint. ACM Trans. Des. Automat. Elect. Syst., 2004, 9(3):290–309.

    Article  Google Scholar 

  5. Gala K, Blaauw D, Zolotov V, Vaidya P M, Joshi A. Inductance model and analysis methodology for high-speed on-chip interconnect. IEEE Trans. VLSI Syst., 2002, 10(6): 730–745.

    Article  Google Scholar 

  6. Wu D, Hu J, Maphapatra R, Zhao M. Layer assignment for crosstalk risk minimization. In Proc. Asia and South Pacific Design Automation Conf., Yokohama, Japan, Jan. 27–30, 2004, pp.159–162.

  7. Liu B, Cai Y, Zhou Q, Hong X. Layer assignment algorithm for RLC crosstalk minimization. In Proc. Int. Symp. Circuits and Systems, Vancouver, Canada, May 23–26, 2004, pp.V85–V88.

  8. Tseng H, Scheffer L, Sechen C. Timing and crosstalk driven area routing. IEEE Trans. Computer-Aided Design, 2001, 20(4): 528–544.

    Article  Google Scholar 

  9. Zhou H, Wang D F. Global routing with crosstalk constraints. IEEE Trans. Computer-Aided Design, 1999, 18(11): 1683–1688.

    Article  MathSciNet  Google Scholar 

  10. Kay R, Rutenbar R A. Wire packing—A strong formulation of crosstalk-aware chip-level track/layer assignment with an efficient integer programming solution. IEEE Trans. Computer-Aided Design, 2001, 20(5): 672–679.

    Article  Google Scholar 

  11. Batterywala S, Shenoy N, Nicholls W, Zhou H. Track assignment: A desirable intermediate step between global routing and detailed routing. In Proc. Int. Conf. Computer-Aided Design, San Jose, California, Nov. 10–14, 2002, pp.59–66.

  12. Yao H, Zhou Q, Hong X, Cai Y. Crosstalk aware routing resource assignment. J. Comput. Sci. Technol., 2005, 20(2): 231–236.

    Article  Google Scholar 

  13. Xiong J, He L. Full-chip routing optimization with RLC crosstalk budgeting. IEEE Trans. Computer-Aided Design, 2004, 23(3): 366–377.

    Article  Google Scholar 

  14. Devgan A, Kashyap C. Block-based static timing analysis with uncertainty. In Proc. Int. Conf. Computer-Aided Design, San Jose, California, Nov. 9–13, 2003, pp.607–614.

  15. Pal R K, Datta A K, Pal S P et al. A general graph theoretic framework for multi-layer channel routing. In Proc. 8th Int. Conf. VLSI Design, Delhi, India, Jan. 4–7, 1995, pp.202–207.

  16. QAPLIB. Available at http://www.opt.math.tu-graz.ac.at/qaplib/.

  17. Shi W, Fang J. Evaluation of closed-form crosstalk models of coupled transmission lines. IEEE Trans. Adv. Packag., 1999, 22(2): 174–181.

    Article  Google Scholar 

  18. Nabors K, White J. Fastcap: A multipole accelerated 3D capacitance extraction program. IEEE Trans. Computer-Aided Design, 1991, 10(11): 1447–1459.

    Article  Google Scholar 

  19. Kamon M, Tsuk M J, White J. Fasthenry: A multipole accelerated 3D inductance extraction program. IEEE Trans. Microwave Theory Tech., 1994, 42(9): 1750–1758.

    Article  Google Scholar 

  20. Restle P J, Ruehli A E, Walker S G et al. Full-wave PEEC time domain method for the modeling of on-chip interconnects. IEEE Trans. Computer-Aided Design, 2001, 20(7): 877–886.

    Article  Google Scholar 

  21. http://www.synopsys.com/products/mixedsignal/hspice/hspice.html. Synopsys Inc.

  22. Hu J, Sapatnekar S S. A survey on multi-net global routing for integrated circuits. Integration, the VLSI Journal, 2001, 31: 1–49.

    Article  MATH  Google Scholar 

  23. Alpert C J. The ISPD98 circuit benchmark suite. In Proc. Int. Symp. Physical Design, Monterey, California, Apr. 6–8, 1998, pp.85–90.

  24. Su H, Hu J, Sapatnekar S S et al. Congestion-driven codesign of power and signal networks. In Proc. Design Automation Conf., New Orleans, Louisiana, June 10–14, 2002, pp.64–69.

  25. Saxena P, Gupta S. On integrating power and signal routing for shield count minimization in congested regions. IEEE Trans. Computer-Aided Design, 2003, 22(4): 437–445.

    Article  Google Scholar 

  26. Hou W, Hong X, Wu W, Cai Y. Fasa: Fast and stable quadratic placement algorithm. J. Comput. Sci. Technol., 2003, 18(3): 318–324.

    Article  MATH  Google Scholar 

  27. Hong X, Jing T, Xu J, Bao H, Gu J. CNB: A critical-network-based timing optimization method for standard cell global routing. J. Comput. Sci. Technol., 2003, 18(6): 732–738.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yi-Ci Cai.

Additional information

This work is supported by the National Hi-Tech Research & Development 863 Program of China under Grant No. 2004AA1Z14600 and the National Natural Science Foundation of China (NSFC) under Grant No. 60476014.

Yi-Ci Cai received her B.S. degree in electronic engineering in 1983 and M.S. degree in computer science & technology in 1986, both from Tsinghua University. She is currently an associate professor in Department of Computer Science & Technology, Tsinghua University. Her research interests include VLSI layout theory and algorithms.

Bin Liu received the B.E. degree in computer science & technology from Tsinghua University in 2004. He is currently pursuing an M.S. degree in EDA Lab, Tsinghua University. His research interests include VLSI routing optimization and low power VLSI design automation.

Yan Xiong is a Ph.D. candidate and professor in the Department of Computer Science and Technology, University of Science and Technology of China. His research interests include mobile computing, information security, distributed computing and computer networks.

Qiang Zhou received the B.S. degree in computer science from University of Science and Technology of China in 1983, the M.S. degree in computer science from Tsinghua University in 1986, and the Ph.D. degree from Chinese University of Mining and Technology, Beijing in 2002. He has been an associate professor in the Department of Computer Science & Technology, Tsinghua University. His research interests include VLSI layout algorithms and systems.

Xian-Long Hong graduated from Tsinghua University, China in 1964. Since 1988, he has been a professor in the Department of Computer Science & Technology, Tsinghua University. His research interests include VLSI layout algorithms and DA systems. He is a fellow of IEEE and the Senior Member of Chinese Institute of Electronics.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cai, YC., Liu, B., Xiong, Y. et al. Priority-Based Routing Resource Assignment Considering Crosstalk. J Comput Sci Technol 21, 913–921 (2006). https://doi.org/10.1007/s11390-006-0913-z

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11390-006-0913-z

Keywords

Navigation