Multiple level spine routing
First Claim
Patent Images
1. A computer implemented method for routing a net, comprising:
- selecting, using one or more computer systems, a first spine routing track from a first plurality of routing tracks, wherein the selecting is based on;
data associated with the net,data associated with the first plurality of spine routing tracks,a first cost function, anda solution to a Linear Assignment Problem; and
generating, using one or more computer systems, a first spine wire on the selected first spine routing track.
1 Assignment
0 Petitions
Accused Products
Abstract
A computer implemented method for routing a net includes selecting, using one or more computer systems, a first spine routing track from a first multitude of routing tracks in accordance with a first cost function, and further in accordance with data associated with the net and the first multitude of routing tracks. The method further includes generating, using one or more computer systems, a first spine wire on the selected first spine routing track.
-
Citations
39 Claims
-
1. A computer implemented method for routing a net, comprising:
-
selecting, using one or more computer systems, a first spine routing track from a first plurality of routing tracks, wherein the selecting is based on; data associated with the net, data associated with the first plurality of spine routing tracks, a first cost function, and a solution to a Linear Assignment Problem; and generating, using one or more computer systems, a first spine wire on the selected first spine routing track. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18)
-
-
19. A system for routing a net, comprising:
-
a processor; and a memory storing a set of instructions which when executed by the processor configures the processor to; select a first spine routing track from a first plurality of routing tracks, wherein the selecting is based on; data associated with the net, data associated with the first plurality of spine routing tracks, a first cost function, and a solution to a Linear Assignment Problem; and generate a first spine wire on the selected first spine routing track. - View Dependent Claims (20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31)
-
-
32. A non-transitory computer-readable medium storing computer-executable code for routing a net, the non-transitory computer-readable medium comprising:
-
code for selecting, using one or more computer systems, a first spine routing track from a first plurality of routing tracks, wherein the selecting is based on; data associated with the net, data associated with the first plurality of spine routing tracks, a cost function, and a solution to a Linear Assignment Problem; and code for generating, using one or more computer systems, a first spine wire on the selected first spine routing track. - View Dependent Claims (33, 34, 35, 36, 37, 38, 39)
-
Specification