Technique to assess timing delay by use of layout quality analyzer comparison
First Claim
1. A method comprising:
- computing a first plurality of routes, each route of the first plurality of routes corresponding to a respective net of a plurality of nets in an integrated circuit layout, and each route representing a theoretically optimal route of the respective net according to a graph theory based algorithm, but omitting from computing a route for a net if a computation time is to exceed a timeout value; and
comparing each of the first plurality of routes not omitted to a corresponding route of a second plurality of routes, each of the second plurality of routes corresponding to the respective net of the plurality of nets, but currently existing in the integrated circuit layout;
identifying one or more routes from the second plurality of routes having a predetermined measurable difference from a corresponding one or more routes from the theoretically optimal routes, the predetermined measurable difference to affect timing delay in the integrated circuit layout.
4 Assignments
0 Petitions
Accused Products
Abstract
In one embodiment, a computer readable medium comprises at least first instructions and second instructions. The first instructions, when executed, compute a first plurality of routes. Each route of the first plurality of routes corresponds to a respective net of a plurality of nets in an integrated circuit layout, and represents a theoretically optimal route of the respective net according to a graph theory based algorithm. The second instructions, when executed, compare each of the first plurality of routes to a corresponding route of a current plurality of routes, each of the current plurality of routes corresponding to the respective net of the plurality of nets and currently existing in the integrated circuit layout. A method is also contemplated.
6 Citations
7 Claims
-
1. A method comprising:
-
computing a first plurality of routes, each route of the first plurality of routes corresponding to a respective net of a plurality of nets in an integrated circuit layout, and each route representing a theoretically optimal route of the respective net according to a graph theory based algorithm, but omitting from computing a route for a net if a computation time is to exceed a timeout value; and
comparing each of the first plurality of routes not omitted to a corresponding route of a second plurality of routes, each of the second plurality of routes corresponding to the respective net of the plurality of nets, but currently existing in the integrated circuit layout;
identifying one or more routes from the second plurality of routes having a predetermined measurable difference from a corresponding one or more routes from the theoretically optimal routes, the predetermined measurable difference to affect timing delay in the integrated circuit layout. - View Dependent Claims (2, 3, 4, 5)
-
-
6. A computer readable medium comprising:
-
first instructions which, when executed, compute a first plurality of routes, each route of the first plurality of routes corresponding to a respective net of a plurality of nets in an integrated circuit layout, and each route representing a theoretically optimal route of the respective net according to a graph theory based algorithm, but the first instructions include instructions to omit from computing a route for a net if a computation time is to exceed a timeout value; and
second instructions which, when executed, compare each of the first plurality of routes not omitted to a corresponding route of a second plurality of routes, each of the second plurality of routes corresponding to the respective net of the plurality of nets, but currently existing in the integrated circuit layout;
third instructions which, when executed, identify one or more routes from the second plurality of routes having a predetermined measurable difference from a corresponding one or more routes from the theoretically optimal routes, the predetermined measurable difference to affect timing delay in the integrated circuit layout. - View Dependent Claims (7)
-
Specification