Efficient timing graph update for dynamic netlist changes
US7657855B1 · kind B1 · utility
Assignee
Inventors
Key dates
| Filing date | May 25, 2007 |
| Grant date | Feb 2, 2010 |
| Priority date | — |
| Expiry date | Feb 19, 2028 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F30/3312
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
Various approaches for incrementally updating the timing of an implementation of an electronic circuit design are disclosed. In one approach, a subset timing graph is selected from a primary timing graph. Alternative subset timing graphs are generated that are functionally equivalent and structurally different with respect to the selected subset timing graph. For each of the alternative timing graphs, a respective timing metric is determined. The determined timing metrics and a timing metric for the selected subset timing graph are compared. An alternative timing graph is selected in response to the comparison. Structurally different portions of the selected one of the one or more alternative timing graphs are verified with regard to the design constraints. The structurally different portions are stored to the primary timing graph.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.