Method and apparatus for storing routes for groups of related net configurations
AssigneeCadence Design Systems, Inc.
InventorsSteven Teig, Joseph L. Ganley
Life of this patent
Estimating the term…
Abstract
Some embodiments of the invention provide a method that pre-computes routes for groups of related net configurations. These routes are used by a router that uses a set of partitioning lines to partition a region of a design layout into a plurality of sub-regions. The method identifies groups of related sub-region configurations. For each group, the method stores a base set of routes. For each configuration in each group, the method also stores an indicia that specifies how to obtain a related set of routes for the particular configuration from the base set of routes stored for the configuration's group.
Claims20
For a router that uses a set of partitioning lines to partition a region of a design layout into a plurality of sub-regions, a method of pre-computing routes for nets, wherein a sub-region configuration is a set of sub-regions, and different sub-region configurations represent different sets of sub-regions, the method comprising:
- a) identifying groups of related sub-region configurations, wherein each group comprises different first and second sub-region configurations;
- b) for each group:
- i) identifying and storing a base set of routes for the first configuration in the group, wherein each route in the base set connects the sub-regions of the first configuration;
- ii) storing a set of indicia specifying how to generate a related set of routes for the second configuration from the base set of routes.
For an electronic design automation (“EDA”) router that routes nets within a region of an integrated-circuit layout, a method of pre-computing routes, the method comprising:
- a) defining a set of partitioning lines for partitioning the region into a plurality of sub-regions, wherein different sets of sub-regions represent different sub-region configurations;
- b) for a first sub-region configuration, identifying a first set of routes, wherein each route in the first set connects the first set of sub-regions;
- c) identifying a second sub-region configuration that is symmetrical to the first sub-region configuration;
- d) storing the first set of routes in a storage structure;
- e) storing a set of indicia specifying how to generate a second set of routes for the second sub-region configuration from the first set of routes stored for the first sub-region configuration.
For a router that uses a set of partitioning lines to partition a region of a design layout into a plurality of sub-regions, a computer medium having a computer program that pre-computes routes for nets, wherein a sub-region configuration is a set of sub-regions, and different sub-region configurations represent different sets of sub-regions, the computer program comprising:
- a) a first set of instructions for identifying groups of related sub-region configurations, wherein each group comprises different first and second sub-region configurations;
- b) a second set of instructions for, for each group:
- i) identifying and storing a base set of routes for the first configuration in the group, wherein each route in the base set connects the sub-regions of the first configuration;
- ii) storing a set of indicia specifying how to generate a related set of routes for the second configuration from the base set of routes.
Dependencies are inferred from the claim text.