Priority-Based Routing Resource Assignment Considering Crosstalk

Crosstalk has become one of the most critical concerns in verydeep sub-micron era. This paper deals with the problem ofcrosstalk mitigation at both methodological and algorithmiclevels. Noting that intermediate operations between global routingand detailed routing are very effective in crosstalk estimationand reduction, the authors propose to incorporate several intermediatesteps that are separated in traditional design flow into anintegrated routing resource assignment stage, so that theoperations could easily cooperate to fully exert their power oncrosstalk reduction. An efficient priority-basedheuristic algorithm is developed, which works slice by slice. Crosstalkavoidance, and many other aspects that are critical inrouting practice including congestion, vias, layer preference,etc., are taken into account. A track reservation strategy isadopted in the algorithm framework to compensate the undesiredeffects caused by sequential routing. Experimental results on aseries of ISPD98 and industrial benchmarks show that the proposedapproach is able to reduce capacitive crosstalk by about 70\% onaverage without compromising completion ratio compared with apreviously reported graph based algorithm, demonstrating theadvantages of the approach.