Selective cuts to remove predicted interconnect bulging regions
US-2024419882-A1 · Dec 19, 2024 · US
US2017357744A1 · US · A1
| Field | Value |
|---|---|
| Publication number | US-2017357744-A1 |
| Application number | US-201615181970-A |
| Country | US |
| Kind code | A1 |
| Filing date | Jun 14, 2016 |
| Priority date | Jun 14, 2016 |
| Publication date | Dec 14, 2017 |
| Grant date | — |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
The present disclosure relates to methods, processing systems and computer program products of global routing of integrated circuits based on localized routing optimization. In certain embodiments, the method may include one or more of: defining one or more regions, one or more netgroups, and combinations thereof of an integrated circuit, associating at least one optimization objective with each region and/or each netgroup defined, generating one or more constraints for each region and/or each netgroup based on the associated optimization objectives, and performing global routing of the integrated circuit according to the one or more constraints.
Opening claim text (preview).
What is claimed is: 1 . A method of global routing of integrated circuits based on localized routing optimization, the method comprising: defining, using a processor, one or more regions, one or more netgroups, and combinations thereof of an integrated circuit; associating, using the processor, at least one optimization objective with each region and/or each netgroup defined; generating, using the processor, one or more constraints for each region and/or each netgroup, based on the associated optimization objectives; and performing, using the processor, global routing of the integrated circuit according to the one or more constraints generated. 2 . The method of claim 1 , wherein the generating comprises: adding corresponding optimization objectives in a region to a corresponding constraint for each of the one or more regions when solution space for nets contains a route that at least one segment is in the corresponding region, or the corresponding netgroup. 3 . The method of claim 2 , wherein the associated optimization objective for a region applies to the entire region; and the associated optimization objective for a netgroup applies to the entire netgroup. 4 . The method of claim 2 , wherein the associated optimization objective for a region applies to a net in the region when at least one part of the net is effective in the region and/or the netgroup. 5 . The method of claim 2 , wherein the performing comprises: performing a global routing of each of one or more segments of a net of the integrated circuit when the global routing is performed in accordance with the optimization objective and the constraints of the region and/or the netgroup. 6 . The method of claim 2 , wherein the performing comprises: performing a global routing using a revised resource sharing algorithm (RSA). 7 . The method of claim 6 , wherein the revised resource sharing algorithm (RSA) comprises performing the global routing when one or more segments of a net contribute to the optimization objective in the region and/or the netgroup. 8 . A processing system for global routing of integrated circuits based on localized routing optimization comprising: a processor configured to perform global routing of an integrated circuit; a graphical user interface configured to display layout of the integrated circuit, and allow a user to perform global and detail routing manually; and a memory storing computer executable instructions having an integrated circuit processing module, and a global and detailed routing module, wherein when executed at the processor of the processing system, the computer executable instructions cause the processor to perform: defining, by the integrated circuit processing module, one or more regions, one or more netgroups, and combinations thereof of an integrated circuit; associating, by the integrated circuit processing module, at least one optimization objective with each region and/or each netgroup defined; generating, by the integrated circuit processing module, one or more constraints for each region and/or each netgroup based on the associated at least one optimization objective; and performing, by the global and detailed routing module, global and detailed routing of the integrated circuit according to the one or more constraints generated. 9 . The processing system of claim 8 , wherein the generating comprises: adding corresponding optimization objectives in a region to a corresponding constraints for each of the one or more regions when solution space for nets contains a route that at least one segment is in the corresponding net of the region. 10 . The processing system of claim 8 , wherein the associated optimization objective for a region applies to the entire region, and/or the corresponding netgroup. 11 . The processing system of claim 8 , wherein the associated optimization objective for a region applies to a net in a region when at least one part of the net is effective in the region; and the associated optimization objective for a netgroup applies to the entire netgroup. 12 . The processing system of claim 8 , wherein the performing comprises: performing a global routing of each of one or more segments of a net of the integrated circuit when the global routing is performed in accordance with the optimization objective and the constraints of the region and/or the netgroup. 13 . The processing system of claim 8 , wherein the performing comprises: performing a global routing using a revised resource sharing algorithm (RSA). 14 . The processing system of claim 13 , wherein the revised resource sharing algorithm (RSA) comprises performing the global routing when one or more segments of a net contribute to the optimization objective in the region and/or the netgroup. 15 . A computer program product comprising: a non-transitory storage medium readable by a processor and storing computer executable instructions for execution by the processor to perform a method of global routing of integrated circuits based on localized routing optimization, the method comprising: defining, using the processor, one or more regions, one or more netgroups, and combinations thereof of an integrated circuit; associating, using the processor, at least one optimization objective with each region and/or each netgroup defined; generating, using the processor, one or more constraints for each region and/or each netgroup based on the associated at least one optimization objective; and performing, using the processor, global routing of the integrated circuit according to the one or more constraints generated. 16 . The computer program product of claim 15 , wherein the generating comprises: adding corresponding optimization objectives in a region to a corresponding constraints for each of the one or more regions when solution space for nets contains a route that at least one segment is in the corresponding net of the region and/or the corresponding netgroup. 17 . The computer program product of claim 16 , wherein the associated optimization objective for a region applies to the entire region; and the associated optimization objective for a netgroup applies to the entire netgroup. 18 . The computer program product of claim 16 , wherein the associated optimization objective for a region applies to a net in a region when at least one part of the net is effective in the region and/or the netgroup. 19 . The computer program product of claim 16 , wherein the performing comprises: performing a global routing of each of one or more segments of a net of the integrated circuit when the global routing is performed in accordance with the optimization objective and the constraints of the region and/or the netgroup. 20 . The computer program product of claim 19 , wherein the performing comprises performing a global routing using a revised resource sharing algorithm (RSA), wherein the revised resource sharing algorithm (RSA) comprises performing the global routing when one or more segments of a net contribute to the optimization objective in the region and/or the netgroup.
Routing (G06F30/396 takes precedence) · CPC title
Physics · mapped topic
Related publications grouped by family.
Answers are generated from the same data shown on this page.