期刊文献+

Priority-Based Routing Resource Assignment Considering Crosstalk

Priority-Based Routing Resource Assignment Considering Crosstalk
原文传递
导出
摘要 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 ,nany 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. 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 ,nany 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.
出处 《Journal of Computer Science & Technology》 SCIE EI CSCD 2006年第6期913-921,共9页 计算机科学技术学报(英文版)
基金 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.
关键词 CROSSTALK resource assignment ROUTING track reservation VLSI crosstalk, resource assignment, routing, track reservation, VLSI
  • 相关文献

参考文献2

二级参考文献17

  • 1Bakoglu H B. Circuits, Interconnections, and Packaging for VLSI. Addison Wesley, 1990, 0p.283-303.
  • 2Gao T, Liu C L. Minimum crosstalk channel routing. In Proc. Int. Conf. Computer-Aided Design, Santa Clara, CA,November 1993, pp.692-696.
  • 3Gao T, Liu C L. Minimum crosstalk switchbox routing. In Proc. Int. Conf. Computer-Aided Design, San Jose, CA,November 1994, pp.6104i15.
  • 4Zhou H, Wong D F. An optimal algorithm for river routing with crosstalk constraints. In Proc. Int. Conf. Computer-Aided Desiqn, San Jose, CA, 1996, pp.310-315.
  • 5Kastner R, Bozorgzadeh E, Sarrafzadeh M. An exact algorithm for coupling-free routing. In Proc. Int. Syrup. Physical Design, Sonoma, CA, USA, April 2001, pp.10-15.
  • 6Batterywala 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 Desiqn, San Jose, CA, 2002, pp.59-66.
  • 7Tseng 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,DD.378-381.
  • 8Chang C C, Cong J. Pseudo pin assignment with crosstalk noise control.In Proc.Int.Syrup.Physical Design, San Diego, CA, USA, 2000, pp.41-47.
  • 9Yao 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.
  • 10Xue T, Kuh E S. Post global routing crosstalk synthesis.TCAD, December 1997, pp.1418-1430.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部