Detailed routing has become much challenging in modern circuit designs due to the extreme scaling of chip size and the complicated design rules.In this paper,we give an effective algorithm for detailed routing conside...Detailed routing has become much challenging in modern circuit designs due to the extreme scaling of chip size and the complicated design rules.In this paper,we give an effective algorithm for detailed routing considering advanced technology nodes.First,we present a valid pin-access candidates generation technology for handling complex pin shapes.Then,we propose a tree-based nets components selection algorithm to decide connecting order for multiple nets components.Finally,combined with global routing results and advanced technology nodes,an initial routing results optimization algorithm is presented to achieve the final detailed routing results.Experimental results on industry benchmarks show that,our proposed algorithm not only achieves 100%routability on real industrial cases in a reasonable runtime,but also optimizes total wirelength,total vias and other advanced technology nodes simultaneously.展开更多
文摘Detailed routing has become much challenging in modern circuit designs due to the extreme scaling of chip size and the complicated design rules.In this paper,we give an effective algorithm for detailed routing considering advanced technology nodes.First,we present a valid pin-access candidates generation technology for handling complex pin shapes.Then,we propose a tree-based nets components selection algorithm to decide connecting order for multiple nets components.Finally,combined with global routing results and advanced technology nodes,an initial routing results optimization algorithm is presented to achieve the final detailed routing results.Experimental results on industry benchmarks show that,our proposed algorithm not only achieves 100%routability on real industrial cases in a reasonable runtime,but also optimizes total wirelength,total vias and other advanced technology nodes simultaneously.
