US20160283638A1 - Circuit routing based on total negative slack - Google Patents
Circuit routing based on total negative slack Download PDFInfo
- Publication number
- US20160283638A1 US20160283638A1 US14/921,271 US201514921271A US2016283638A1 US 20160283638 A1 US20160283638 A1 US 20160283638A1 US 201514921271 A US201514921271 A US 201514921271A US 2016283638 A1 US2016283638 A1 US 2016283638A1
- Authority
- US
- United States
- Prior art keywords
- routing
- net
- circuit
- slack
- computer
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 claims abstract description 24
- 238000000638 solvent extraction Methods 0.000 claims abstract description 6
- 238000004458 analytical method Methods 0.000 claims description 3
- 238000004590 computer program Methods 0.000 abstract description 6
- 238000003860 storage Methods 0.000 description 31
- 230000015654 memory Effects 0.000 description 17
- 238000010586 diagram Methods 0.000 description 14
- 230000006870 function Effects 0.000 description 10
- 230000008901 benefit Effects 0.000 description 9
- 230000002085 persistent effect Effects 0.000 description 8
- 238000012545 processing Methods 0.000 description 8
- 238000013507 mapping Methods 0.000 description 7
- 230000005540 biological transmission Effects 0.000 description 4
- 230000003287 optical effect Effects 0.000 description 4
- 238000013461 design Methods 0.000 description 3
- 239000004744 fabric Substances 0.000 description 3
- 230000008569 process Effects 0.000 description 3
- 238000003491 array Methods 0.000 description 2
- 230000001419 dependent effect Effects 0.000 description 2
- 238000009826 distribution Methods 0.000 description 2
- 238000004519 manufacturing process Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000003334 potential effect Effects 0.000 description 2
- 230000001902 propagating effect Effects 0.000 description 2
- 239000004065 semiconductor Substances 0.000 description 2
- 210000003813 thumb Anatomy 0.000 description 2
- RYGMFSIKBFXOCR-UHFFFAOYSA-N Copper Chemical compound [Cu] RYGMFSIKBFXOCR-UHFFFAOYSA-N 0.000 description 1
- 238000013459 approach Methods 0.000 description 1
- 229910052802 copper Inorganic materials 0.000 description 1
- 239000010949 copper Substances 0.000 description 1
- 239000000835 fiber Substances 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 230000002093 peripheral effect Effects 0.000 description 1
- 230000009467 reduction Effects 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 239000000758 substrate Substances 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
Images
Classifications
-
- G06F17/5077—
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F30/00—Computer-aided design [CAD]
- G06F30/30—Circuit design
- G06F30/39—Circuit design at the physical level
- G06F30/394—Routing
-
- G06F17/5072—
-
- G06F17/5081—
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F30/00—Computer-aided design [CAD]
- G06F30/30—Circuit design
- G06F30/39—Circuit design at the physical level
- G06F30/392—Floor-planning or layout, e.g. partitioning or placement
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F30/00—Computer-aided design [CAD]
- G06F30/30—Circuit design
- G06F30/39—Circuit design at the physical level
- G06F30/398—Design verification or optimisation, e.g. using design rule check [DRC], layout versus schematics [LVS] or finite element methods [FEM]
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2119/00—Details relating to the type or aim of the analysis or the optimisation
- G06F2119/12—Timing analysis or timing optimisation
Definitions
- the present invention relates generally to designing electronic circuits such as integrated circuits, and more particularly to routing signal paths for electronic circuits.
- circuit elements such as gates, latches, and drivers in addition to scores of I/O pins.
- Each of these circuit elements must be electrically connected to other circuit elements, or to I/O pins, via wires (a.k.a. traces).
- wires a.k.a. traces. The process of determining the connection path for the circuit wires is referred to as routing.
- Circuit timing is dependent on the length and path of the selected route for each wire. Consequently, circuit timing must be considered when routing a circuit.
- An initial timing analysis for an un-routed circuit may assume an optimal routing such as a ‘Steiner’ routing for each path in the circuit based on horizontal and vertical channels.
- the timing analysis may compute a slack for each path in the circuit that is the difference of a desired arrival time (which may include a timing margin) and the estimated arrival time.
- a positive slack implies that the arrival time at a node can be increased without affecting the overall delay of the circuit.
- a negative slack implies that a signal path is too slow, and the signal path must be sped up.
- a method, executed by a computer, for routing a circuit includes partitioning a netlist for a circuit into a plurality of nets, determining, for each net of the plurality of nets, a corresponding net cone to provide a corresponding plurality of net cones, computing a total negative timing slack for each net cone of the corresponding plurality of net cones, assigning routing constraints for the plurality of nets according to the total negative timing slack for the corresponding plurality of net cones, and routing the netlist according to the routing constraints. Examples of routing constraints include a routing priority, a routing weight, a scenic ratio, a wire code assignment, and a layer assignment.
- a corresponding computer program product and computer system are also disclosed herein.
- FIG. 1 is flowchart of one embodiment of a circuit routing method in accordance with the present invention
- FIG. 2 is a pictorial circuit diagram that illustrates the difference between prioritizing routing according to a most negative slack and a total negative slack;
- FIGS. 3A and 3B are tables that show how various circuit parameters can be used to determine routing constraints
- FIGS. 4A and 4B are graphs depicting the potential effects of one or more embodiments of the present invention on circuit performance and circuit design effort.
- FIG. 5 is a block diagram depicting one example of a computing apparatus (i.e., computer) suitable for executing the methods disclosed herein.
- a computing apparatus i.e., computer
- the embodiments disclosed herein reduce the need for timing cleanup changes when routing circuits such as integrated circuits.
- references throughout this specification to features, advantages, or similar language herein do not imply that all of the features and advantages that may be realized with the embodiments disclosed herein should be, or are in, any single embodiment of the invention. Rather, language referring to the features and advantages is understood to mean that a specific feature, advantage, or characteristic described in connection with an embodiment is included in at least one embodiment of the present invention. Thus, discussion of the features, advantages, and similar language, throughout this specification may, but do not necessarily, refer to the same embodiment.
- FIG. 1 is flowchart of one embodiment of a circuit routing method 100 in accordance with the present invention.
- the circuit routing method 100 includes partitioning ( 110 ) a circuit netlist, receiving ( 120 ) placement information, computing ( 130 ) a total negative timing slack, assigning ( 140 ) routing constraints, routing ( 150 ) the circuit netlist, and fabricating ( 160 ) a circuit.
- the circuit routing method 100 enables circuit routing that reduces the total amount of negative timing slack in the routed circuit and thereby reduces the need for timing cleanup changes.
- Partitioning ( 110 ) a circuit netlist may include partitioning the circuit netlist into nets and determining a corresponding net cone for each net.
- each net corresponds to a driver that supplies a signal to the net.
- the driver may be associated with an output of a circuit element, an input pin for the circuit, or the like.
- the net cone for a net may encompass every path in the circuit that propagates the driver output to an output pin for the circuit or an input for a latch.
- Receiving ( 120 ) placement information may include receiving information from a placement engine or the like, as to the best expected placement for the circuit elements.
- the placement information may indicate the expected best location of each circuit element (e.g., logic gate or latch) in the circuit.
- the placement information may correspond to an initial placement for a circuit or a subsequent placement that attempts to improve on the initial placement.
- Computing ( 130 ) a total negative timing slack may include summing the negative slack values for all the paths in a net cone. Non-negative slack values may be omitted from the summation or set to zero. A total negative timing slack may be computed for each net cone. For an initial placement, Steiner routings paths may be assumed when summing the negative slack values. In some embodiments, computing ( 130 ) a total negative timing slack includes subtracting a slack target (e.g., a timing margin) from an estimated timing slack for each path in the net cone.
- a slack target e.g., a timing margin
- Assigning ( 140 ) routing constraints may include assigning routing constraints to each net based (partially or fully) on the total negative slack for the corresponding net cone. Examples of routing constraints include routing priority, routing weight, scenic ratio, wire code assignment, and layer assignment. In one embodiment, a mapping function is used to map total negative slack to a set of routing constraints.
- Routing ( 150 ) the circuit netlist may include routing the circuit netlist according to the routing constraints to provide a routing for the netlist.
- the routing may be an electronic file that indicates where various wires and vias are placed along with the shape or dimensions of the wires and vias.
- the electronic routing file may conform to a design standard such as OpenAccess.
- Fabricating ( 160 ) a circuit may include using the routing created by operation 150 to direct a circuit fabrication process.
- multiple layers of insolation and wiring are deposited and patterned on a substrate such as a wafer, printed circuit board, or interposer.
- interconnections provided by the wiring layers may form a number of integrated circuits on a wafer which may be diced and packaged to provide packaged integrated circuits.
- FIG. 2 is a pictorial circuit diagram that illustrates the difference between prioritizing routing according to a most negative slack and a total negative slack.
- a first net cone 210 and a second net cone 220 may have various slack values 230 for each path in the net cone that corresponds to an output pin or latch 240 .
- the routing constraints are typically based on the path with the most negative slack which is ⁇ 10 for the first net cone 210 and ⁇ 9 for the second net cone 220 . Consequently, Net1 would have a higher routing priority than Net2 for conventional routing approaches (assuming that routing priority was used as a constraint by the routing engine).
- the routing constraints are based on the total negative slack for all of the paths in the net cone. For purposes of summing the total negative slack, paths with a positive slack may be assigned a slack value of zero. Given the foregoing, the total negative slack for Net1 is ⁇ 11 and the total negative slack for Net2 is ⁇ 30. Consequently, Net2 would have higher routing priority than Net1 for the various embodiments presented herein.
- FIGS. 3A and 3B are mapping tables 300 (i.e., 300 A and 300 B) that show how various path-based circuit parameters can be used to determine routing constraints.
- various slack ranges 310 and routing length ranges 320 i.e., discretized buckets
- mapping tables 300 A and 300 B respectively.
- mapping functions are used instead of mapping tables.
- the slack ranges may be total negative slack for a net cone.
- other circuit parameters may be used to determine routing constraints.
- the depicted embodiment uses routing length in addition to circuit slack.
- routing constraints may be determined from the circuit parameters. For example, in addition to the depicted routing constraints of scenic range and wire code, a wide variety of routing constraints can be determined via mapping tables or mapping functions such as routing priority, routing weight, and a layer assignment.
- FIGS. 4A and 4B are graphs depicting the potential effects of one or more embodiments of the present invention on circuit performance and circuit design effort.
- the embodiments disclosed herein may reduce the amount of negative slack in a routed circuit.
- conventional circuit routing may result in a significant number of paths within a negative slack region 410 as depicted with a conventional slack distribution 420 .
- the overall negative slack of the entire circuit may be reduced resulting in an improved distribution 430 . As shown in FIG.
- the reduction of the number of paths within the negative slack region 410 may reduce the amount of timing cleanup changes that must be made to a routed circuit. Consequently, an improved cleanup duration 440 may be significantly shorter than a conventional cleanup duration 450 .
- FIG. 5 is a block diagram depicting one example of a computing apparatus (i.e., computer 500 ) suitable for executing the methods disclosed herein. It should be appreciated that FIG. 5 provides only an illustration of one embodiment and does not imply any limitations with regard to the environments in which different embodiments may be implemented. Many modifications to the depicted environment may be made.
- the computer 500 includes communications fabric 502 , which provides communications between computer processor(s) 505 , memory 506 , persistent storage 508 , communications unit 512 , and input/output (I/O) interface(s) 515 .
- Communications fabric 502 can be implemented with any architecture designed for passing data and/or control information between processors (such as microprocessors, communications and network processors, etc.), system memory, peripheral devices, and any other hardware components within a system.
- processors such as microprocessors, communications and network processors, etc.
- Communications fabric 502 can be implemented with one or more buses.
- Memory 506 and persistent storage 508 are computer readable storage media.
- memory 506 includes random access memory (RAM) 516 and cache memory 518 .
- RAM random access memory
- cache memory 518 In general, memory 506 can include any suitable volatile or non-volatile computer readable storage media.
- One or more programs may be stored in persistent storage 508 for execution by one or more of the respective computer processors 505 via one or more memories of memory 506 .
- the persistent storage 508 may be a magnetic hard disk drive, a solid state hard drive, a semiconductor storage device, read-only memory (ROM), erasable programmable read-only memory (EPROM), flash memory, or any other computer readable storage media that is capable of storing program instructions or digital information.
- the media used by persistent storage 508 may also be removable.
- a removable hard drive may be used for persistent storage 508 .
- Other examples include optical and magnetic disks, thumb drives, and smart cards that are inserted into a drive for transfer onto another computer readable storage medium that is also part of persistent storage 508 .
- Communications unit 512 in these examples, provides for communications with other data processing systems or devices.
- communications unit 512 includes one or more network interface cards.
- Communications unit 512 may provide communications through the use of either or both physical and wireless communications links.
- I/O interface(s) 515 allows for input and output of data with other devices that may be connected to computer 500 .
- I/O interface 515 may provide a connection to external devices 520 such as a keyboard, keypad, a touch screen, and/or some other suitable input device.
- external devices 520 can also include portable computer readable storage media such as, for example, thumb drives, portable optical or magnetic disks, and memory cards.
- I/O interface(s) 515 may also connect to a display 522 .
- Display 522 provides a mechanism to display data to a user and may be, for example, a computer monitor.
- the embodiments disclosed herein include a system, a method, and/or a computer program product.
- the computer program product may include a computer readable storage medium (or media) having computer readable program instructions thereon for causing a processor to carry out the methods disclosed herein.
- the computer readable storage medium can be a tangible device that can retain and store instructions for use by an instruction execution device.
- the computer readable storage medium may be, for example, but is not limited to, an electronic storage device, a magnetic storage device, an optical storage device, an electromagnetic storage device, a semiconductor storage device, or any suitable combination of the foregoing.
- a non-exhaustive list of more specific examples of the computer readable storage medium includes the following: a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), a static random access memory (SRAM), a portable compact disc read-only memory (CD-ROM), a digital versatile disk (DVD), a memory stick, a floppy disk, a mechanically encoded device such as punch-cards or raised structures in a groove having instructions recorded thereon, and any suitable combination of the foregoing.
- RAM random access memory
- ROM read-only memory
- EPROM or Flash memory erasable programmable read-only memory
- SRAM static random access memory
- CD-ROM compact disc read-only memory
- DVD digital versatile disk
- memory stick a floppy disk
- a mechanically encoded device such as punch-cards or raised structures in a groove having instructions recorded thereon
- a computer readable storage medium is not to be construed as being transitory signals per se, such as radio waves or other freely propagating electromagnetic waves, electromagnetic waves propagating through a waveguide or other transmission media (e.g., light pulses passing through a fiber-optic cable), or electrical signals transmitted through a wire.
- Computer readable program instructions described herein can be downloaded to respective computing/processing devices from a computer readable storage medium or to an external computer or external storage device via a network, for example, the Internet, a local area network, a wide area network and/or a wireless network.
- the network may comprise copper transmission cables, optical transmission fibers, wireless transmission, routers, firewalls, switches, gateway computers and/or edge servers.
- a network adapter card or network interface in each computing/processing device receives computer readable program instructions from the network and forwards the computer readable program instructions for storage in a computer readable storage medium within the respective computing/processing device.
- Computer readable program instructions for carrying out operations of the present invention may be assembler instructions, instruction-set-architecture (ISA) instructions, machine instructions, machine dependent instructions, microcode, firmware instructions, state-setting data, or either source code or object code written in any combination of one or more programming languages, including an object oriented programming language such as Smalltalk, C++ or the like, and conventional procedural programming languages, such as the “C” programming language or similar programming languages.
- the computer readable program instructions may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server.
- the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet Service Provider).
- electronic circuitry including, for example, programmable logic circuitry, field-programmable gate arrays (FPGA), or programmable logic arrays (PLA) may execute the computer readable program instructions by utilizing state information of the computer readable program instructions to personalize the electronic circuitry, in order to perform aspects of the present invention.
- These computer readable program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.
- These computer readable program instructions may also be stored in a computer readable storage medium that can direct a computer, a programmable data processing apparatus, and/or other devices to function in a particular manner, such that the computer readable storage medium having instructions stored therein comprises an article of manufacture including instructions which implement aspects of the function/act specified in the flowchart and/or block diagram block or blocks.
- the computer readable program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other device to cause a series of operational steps to be performed on the computer, other programmable apparatus or other device to produce a computer implemented process, such that the instructions which execute on the computer, other programmable apparatus, or other device implement the functions/acts specified in the flowchart and/or block diagram block or blocks.
- each block in the flowchart or block diagrams may represent a module, segment, or portion of instructions, which comprises one or more executable instructions for implementing the specified logical function(s).
- the functions noted in the block may occur out of the order noted in the figures.
- two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved.
Landscapes
- Engineering & Computer Science (AREA)
- Computer Hardware Design (AREA)
- Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Evolutionary Computation (AREA)
- Geometry (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Computer Networks & Wireless Communication (AREA)
- Architecture (AREA)
- Design And Manufacture Of Integrated Circuits (AREA)
Abstract
Description
- The present invention relates generally to designing electronic circuits such as integrated circuits, and more particularly to routing signal paths for electronic circuits.
- Modern integrated circuits often have millions of circuit elements such as gates, latches, and drivers in addition to scores of I/O pins. Each of these circuit elements must be electrically connected to other circuit elements, or to I/O pins, via wires (a.k.a. traces). The process of determining the connection path for the circuit wires is referred to as routing.
- Circuit timing is dependent on the length and path of the selected route for each wire. Consequently, circuit timing must be considered when routing a circuit. An initial timing analysis for an un-routed circuit may assume an optimal routing such as a ‘Steiner’ routing for each path in the circuit based on horizontal and vertical channels. The timing analysis may compute a slack for each path in the circuit that is the difference of a desired arrival time (which may include a timing margin) and the estimated arrival time. A positive slack implies that the arrival time at a node can be increased without affecting the overall delay of the circuit. Conversely, a negative slack implies that a signal path is too slow, and the signal path must be sped up.
- A method, executed by a computer, for routing a circuit includes partitioning a netlist for a circuit into a plurality of nets, determining, for each net of the plurality of nets, a corresponding net cone to provide a corresponding plurality of net cones, computing a total negative timing slack for each net cone of the corresponding plurality of net cones, assigning routing constraints for the plurality of nets according to the total negative timing slack for the corresponding plurality of net cones, and routing the netlist according to the routing constraints. Examples of routing constraints include a routing priority, a routing weight, a scenic ratio, a wire code assignment, and a layer assignment. A corresponding computer program product and computer system are also disclosed herein.
-
FIG. 1 is flowchart of one embodiment of a circuit routing method in accordance with the present invention; -
FIG. 2 is a pictorial circuit diagram that illustrates the difference between prioritizing routing according to a most negative slack and a total negative slack; -
FIGS. 3A and 3B are tables that show how various circuit parameters can be used to determine routing constraints; -
FIGS. 4A and 4B are graphs depicting the potential effects of one or more embodiments of the present invention on circuit performance and circuit design effort; and -
FIG. 5 is a block diagram depicting one example of a computing apparatus (i.e., computer) suitable for executing the methods disclosed herein. - The embodiments disclosed herein reduce the need for timing cleanup changes when routing circuits such as integrated circuits.
- It should be noted that references throughout this specification to features, advantages, or similar language herein do not imply that all of the features and advantages that may be realized with the embodiments disclosed herein should be, or are in, any single embodiment of the invention. Rather, language referring to the features and advantages is understood to mean that a specific feature, advantage, or characteristic described in connection with an embodiment is included in at least one embodiment of the present invention. Thus, discussion of the features, advantages, and similar language, throughout this specification may, but do not necessarily, refer to the same embodiment.
- Furthermore, the described features, advantages, and characteristics of the invention may be combined in any suitable manner in one or more embodiments. One skilled in the relevant art will recognize that the invention may be practiced without one or more of the specific features or advantages of a particular embodiment. In other instances, additional features and advantages may be recognized in certain embodiments that may not be present in all embodiments of the invention.
- These features and advantages will become more fully apparent from the following drawings, description and appended claims, or may be learned by the practice of the invention as set forth hereinafter.
-
FIG. 1 is flowchart of one embodiment of acircuit routing method 100 in accordance with the present invention. As depicted, thecircuit routing method 100 includes partitioning (110) a circuit netlist, receiving (120) placement information, computing (130) a total negative timing slack, assigning (140) routing constraints, routing (150) the circuit netlist, and fabricating (160) a circuit. Thecircuit routing method 100 enables circuit routing that reduces the total amount of negative timing slack in the routed circuit and thereby reduces the need for timing cleanup changes. - Partitioning (110) a circuit netlist may include partitioning the circuit netlist into nets and determining a corresponding net cone for each net. In some embodiments, each net corresponds to a driver that supplies a signal to the net. The driver may be associated with an output of a circuit element, an input pin for the circuit, or the like. The net cone for a net may encompass every path in the circuit that propagates the driver output to an output pin for the circuit or an input for a latch.
- Receiving (120) placement information may include receiving information from a placement engine or the like, as to the best expected placement for the circuit elements. The placement information may indicate the expected best location of each circuit element (e.g., logic gate or latch) in the circuit. The placement information may correspond to an initial placement for a circuit or a subsequent placement that attempts to improve on the initial placement.
- Computing (130) a total negative timing slack may include summing the negative slack values for all the paths in a net cone. Non-negative slack values may be omitted from the summation or set to zero. A total negative timing slack may be computed for each net cone. For an initial placement, Steiner routings paths may be assumed when summing the negative slack values. In some embodiments, computing (130) a total negative timing slack includes subtracting a slack target (e.g., a timing margin) from an estimated timing slack for each path in the net cone.
- Assigning (140) routing constraints may include assigning routing constraints to each net based (partially or fully) on the total negative slack for the corresponding net cone. Examples of routing constraints include routing priority, routing weight, scenic ratio, wire code assignment, and layer assignment. In one embodiment, a mapping function is used to map total negative slack to a set of routing constraints.
- Routing (150) the circuit netlist may include routing the circuit netlist according to the routing constraints to provide a routing for the netlist. The routing may be an electronic file that indicates where various wires and vias are placed along with the shape or dimensions of the wires and vias. The electronic routing file may conform to a design standard such as OpenAccess.
- Fabricating (160) a circuit may include using the routing created by
operation 150 to direct a circuit fabrication process. In some embodiments, multiple layers of insolation and wiring are deposited and patterned on a substrate such as a wafer, printed circuit board, or interposer. For example, interconnections provided by the wiring layers may form a number of integrated circuits on a wafer which may be diced and packaged to provide packaged integrated circuits. -
FIG. 2 is a pictorial circuit diagram that illustrates the difference between prioritizing routing according to a most negative slack and a total negative slack. As depicted, a firstnet cone 210 and a secondnet cone 220 may havevarious slack values 230 for each path in the net cone that corresponds to an output pin orlatch 240. With conventional routing, the routing constraints are typically based on the path with the most negative slack which is −10 for the firstnet cone 210 and −9 for thesecond net cone 220. Consequently, Net1 would have a higher routing priority than Net2 for conventional routing approaches (assuming that routing priority was used as a constraint by the routing engine). In various embodiments of the present invention, the routing constraints are based on the total negative slack for all of the paths in the net cone. For purposes of summing the total negative slack, paths with a positive slack may be assigned a slack value of zero. Given the foregoing, the total negative slack for Net1 is −11 and the total negative slack for Net2 is −30. Consequently, Net2 would have higher routing priority than Net1 for the various embodiments presented herein. -
FIGS. 3A and 3B are mapping tables 300 (i.e., 300A and 300B) that show how various path-based circuit parameters can be used to determine routing constraints. In the depicted embodiments, various slack ranges 310 and routing length ranges 320 (i.e., discretized buckets) are mapped to a scenic range constraint inFIG. 3A and a wire code constraint inFIG. 3B via mapping tables 300A and 300B, respectively. In other embodiments, mapping functions are used instead of mapping tables. The slack ranges may be total negative slack for a net cone. In addition to circuit slack, other circuit parameters may be used to determine routing constraints. For example, the depicted embodiment uses routing length in addition to circuit slack. The longest source to sink path of a net cone is another example of a circuit parameter that can be used to determine routing constraints. Various routing constraints may be determined from the circuit parameters. For example, in addition to the depicted routing constraints of scenic range and wire code, a wide variety of routing constraints can be determined via mapping tables or mapping functions such as routing priority, routing weight, and a layer assignment. -
FIGS. 4A and 4B are graphs depicting the potential effects of one or more embodiments of the present invention on circuit performance and circuit design effort. As depicted inFIG. 4A , the embodiments disclosed herein may reduce the amount of negative slack in a routed circuit. For example, conventional circuit routing may result in a significant number of paths within a negativeslack region 410 as depicted with aconventional slack distribution 420. However, by prioritizing routing according to total negative slack computed for each net in a circuit netlist, the overall negative slack of the entire circuit may be reduced resulting in animproved distribution 430. As shown inFIG. 4B , the reduction of the number of paths within thenegative slack region 410, may reduce the amount of timing cleanup changes that must be made to a routed circuit. Consequently, animproved cleanup duration 440 may be significantly shorter than aconventional cleanup duration 450. -
FIG. 5 is a block diagram depicting one example of a computing apparatus (i.e., computer 500) suitable for executing the methods disclosed herein. It should be appreciated thatFIG. 5 provides only an illustration of one embodiment and does not imply any limitations with regard to the environments in which different embodiments may be implemented. Many modifications to the depicted environment may be made. - As depicted, the
computer 500 includescommunications fabric 502, which provides communications between computer processor(s) 505,memory 506,persistent storage 508,communications unit 512, and input/output (I/O) interface(s) 515.Communications fabric 502 can be implemented with any architecture designed for passing data and/or control information between processors (such as microprocessors, communications and network processors, etc.), system memory, peripheral devices, and any other hardware components within a system. For example,communications fabric 502 can be implemented with one or more buses. -
Memory 506 andpersistent storage 508 are computer readable storage media. In the depicted embodiment,memory 506 includes random access memory (RAM) 516 andcache memory 518. In general,memory 506 can include any suitable volatile or non-volatile computer readable storage media. - One or more programs may be stored in
persistent storage 508 for execution by one or more of therespective computer processors 505 via one or more memories ofmemory 506. Thepersistent storage 508 may be a magnetic hard disk drive, a solid state hard drive, a semiconductor storage device, read-only memory (ROM), erasable programmable read-only memory (EPROM), flash memory, or any other computer readable storage media that is capable of storing program instructions or digital information. - The media used by
persistent storage 508 may also be removable. For example, a removable hard drive may be used forpersistent storage 508. Other examples include optical and magnetic disks, thumb drives, and smart cards that are inserted into a drive for transfer onto another computer readable storage medium that is also part ofpersistent storage 508. -
Communications unit 512, in these examples, provides for communications with other data processing systems or devices. In these examples,communications unit 512 includes one or more network interface cards.Communications unit 512 may provide communications through the use of either or both physical and wireless communications links. - I/O interface(s) 515 allows for input and output of data with other devices that may be connected to
computer 500. For example, I/O interface 515 may provide a connection toexternal devices 520 such as a keyboard, keypad, a touch screen, and/or some other suitable input device.External devices 520 can also include portable computer readable storage media such as, for example, thumb drives, portable optical or magnetic disks, and memory cards. - Software and data used to practice embodiments of the present invention can be stored on such portable computer readable storage media and can be loaded onto
persistent storage 508 via I/O interface(s) 515. I/O interface(s) 515 may also connect to adisplay 522.Display 522 provides a mechanism to display data to a user and may be, for example, a computer monitor. - The programs described herein are identified based upon the application for which they are implemented in a specific embodiment of the invention. However, it should be appreciated that any particular program nomenclature herein is used merely for convenience, and thus the invention should not be limited to use solely in any specific application identified and/or implied by such nomenclature.
- The embodiments disclosed herein include a system, a method, and/or a computer program product. The computer program product may include a computer readable storage medium (or media) having computer readable program instructions thereon for causing a processor to carry out the methods disclosed herein.
- The computer readable storage medium can be a tangible device that can retain and store instructions for use by an instruction execution device. The computer readable storage medium may be, for example, but is not limited to, an electronic storage device, a magnetic storage device, an optical storage device, an electromagnetic storage device, a semiconductor storage device, or any suitable combination of the foregoing. A non-exhaustive list of more specific examples of the computer readable storage medium includes the following: a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), a static random access memory (SRAM), a portable compact disc read-only memory (CD-ROM), a digital versatile disk (DVD), a memory stick, a floppy disk, a mechanically encoded device such as punch-cards or raised structures in a groove having instructions recorded thereon, and any suitable combination of the foregoing. A computer readable storage medium, as used herein, is not to be construed as being transitory signals per se, such as radio waves or other freely propagating electromagnetic waves, electromagnetic waves propagating through a waveguide or other transmission media (e.g., light pulses passing through a fiber-optic cable), or electrical signals transmitted through a wire.
- Computer readable program instructions described herein can be downloaded to respective computing/processing devices from a computer readable storage medium or to an external computer or external storage device via a network, for example, the Internet, a local area network, a wide area network and/or a wireless network. The network may comprise copper transmission cables, optical transmission fibers, wireless transmission, routers, firewalls, switches, gateway computers and/or edge servers. A network adapter card or network interface in each computing/processing device receives computer readable program instructions from the network and forwards the computer readable program instructions for storage in a computer readable storage medium within the respective computing/processing device.
- Computer readable program instructions for carrying out operations of the present invention may be assembler instructions, instruction-set-architecture (ISA) instructions, machine instructions, machine dependent instructions, microcode, firmware instructions, state-setting data, or either source code or object code written in any combination of one or more programming languages, including an object oriented programming language such as Smalltalk, C++ or the like, and conventional procedural programming languages, such as the “C” programming language or similar programming languages. The computer readable program instructions may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the latter scenario, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet Service Provider). In some embodiments, electronic circuitry including, for example, programmable logic circuitry, field-programmable gate arrays (FPGA), or programmable logic arrays (PLA) may execute the computer readable program instructions by utilizing state information of the computer readable program instructions to personalize the electronic circuitry, in order to perform aspects of the present invention.
- Aspects of the present invention are described herein with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer readable program instructions.
- These computer readable program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks. These computer readable program instructions may also be stored in a computer readable storage medium that can direct a computer, a programmable data processing apparatus, and/or other devices to function in a particular manner, such that the computer readable storage medium having instructions stored therein comprises an article of manufacture including instructions which implement aspects of the function/act specified in the flowchart and/or block diagram block or blocks.
- The computer readable program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other device to cause a series of operational steps to be performed on the computer, other programmable apparatus or other device to produce a computer implemented process, such that the instructions which execute on the computer, other programmable apparatus, or other device implement the functions/acts specified in the flowchart and/or block diagram block or blocks.
- The flowcharts and block diagrams in the Figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods, and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of instructions, which comprises one or more executable instructions for implementing the specified logical function(s). In some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems that perform the specified functions or acts or carry out combinations of special purpose hardware and computer instructions.
- It should be noted that this description is not intended to limit the invention. On the contrary, the embodiments presented are intended to cover some of the alternatives, modifications, and equivalents, which are included in the spirit and scope of the invention as defined by the appended claims. Further, in the detailed description of the disclosed embodiments, numerous specific details are set forth in order to provide a comprehensive understanding of the claimed invention. However, one skilled in the art would understand that various embodiments may be practiced without such specific details.
- Although the features and elements of the embodiments disclosed herein are described in particular combinations, each feature or element can be used alone without the other features and elements of the embodiments or in various combinations with or without other features and elements disclosed herein.
- This written description uses examples of the subject matter disclosed to enable any person skilled in the art to practice the same, including making and using any devices or systems and performing any incorporated methods. The patentable scope of the subject matter is defined by the claims, and may include other examples that occur to those skilled in the art. Such other examples are intended to be within the scope of the claims.
Claims (7)
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US14/921,271 US9471741B1 (en) | 2015-03-24 | 2015-10-23 | Circuit routing based on total negative slack |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US14/666,416 US9483601B2 (en) | 2015-03-24 | 2015-03-24 | Circuit routing based on total negative slack |
US14/921,271 US9471741B1 (en) | 2015-03-24 | 2015-10-23 | Circuit routing based on total negative slack |
Related Parent Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US14/666,416 Continuation US9483601B2 (en) | 2015-03-24 | 2015-03-24 | Circuit routing based on total negative slack |
Publications (2)
Publication Number | Publication Date |
---|---|
US20160283638A1 true US20160283638A1 (en) | 2016-09-29 |
US9471741B1 US9471741B1 (en) | 2016-10-18 |
Family
ID=56975410
Family Applications (2)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US14/666,416 Expired - Fee Related US9483601B2 (en) | 2015-03-24 | 2015-03-24 | Circuit routing based on total negative slack |
US14/921,271 Expired - Fee Related US9471741B1 (en) | 2015-03-24 | 2015-10-23 | Circuit routing based on total negative slack |
Family Applications Before (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US14/666,416 Expired - Fee Related US9483601B2 (en) | 2015-03-24 | 2015-03-24 | Circuit routing based on total negative slack |
Country Status (1)
Country | Link |
---|---|
US (2) | US9483601B2 (en) |
Families Citing this family (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US10546095B2 (en) | 2017-06-13 | 2020-01-28 | International Business Machines Corporation | Parameter collapsing and corner reduction in an integrated circuit |
Family Cites Families (29)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6591407B1 (en) | 2000-03-01 | 2003-07-08 | Sequence Design, Inc. | Method and apparatus for interconnect-driven optimization of integrated circuit design |
US6415426B1 (en) * | 2000-06-02 | 2002-07-02 | Incentia Design Systems, Inc. | Dynamic weighting and/or target zone analysis in timing driven placement of cells of an integrated circuit design |
US6622291B1 (en) * | 2000-10-30 | 2003-09-16 | Cadence Design Systems, Inc. | Method and apparatus for physical budgeting during RTL floorplanning |
US7219048B1 (en) * | 2001-01-02 | 2007-05-15 | Magma Design Automation, Inc. | Methodology and applications of timing-driven logic resynthesis for VLSI circuits |
US6886152B1 (en) | 2002-08-09 | 2005-04-26 | Xilinx, Inc. | Delay optimization in signal routing |
US7111268B1 (en) | 2002-08-26 | 2006-09-19 | Xilinx, Inc. | Post-layout optimization in integrated circuit design |
US6886147B2 (en) * | 2002-12-31 | 2005-04-26 | Lsi Logic Corporation | Method, system, and product for achieving optimal timing in a data path that includes variable delay lines and coupled endpoints |
US7149999B2 (en) * | 2003-02-25 | 2006-12-12 | The Regents Of The University Of California | Method for correcting a mask design layout |
US7251800B2 (en) * | 2003-05-30 | 2007-07-31 | Synplicity, Inc. | Method and apparatus for automated circuit design |
WO2005119531A2 (en) * | 2004-06-01 | 2005-12-15 | Tera Systems, Inc. | Rule-based design consultant and method for integrated circuit design |
US7191417B1 (en) * | 2004-06-04 | 2007-03-13 | Sierra Design Automation, Inc. | Method and apparatus for optimization of digital integrated circuits using detection of bottlenecks |
US7380228B2 (en) * | 2004-11-08 | 2008-05-27 | Lsi Corporation | Method of associating timing violations with critical structures in an integrated circuit design |
US7484194B2 (en) * | 2005-07-18 | 2009-01-27 | Synopsys, Inc. | Automation method and system for assessing timing based on Gaussian slack |
US7454731B2 (en) * | 2006-09-22 | 2008-11-18 | Synopsys, Inc. | Generation of engineering change order (ECO) constraints for use in selecting ECO repair techniques |
US7853915B2 (en) * | 2008-06-24 | 2010-12-14 | Synopsys, Inc. | Interconnect-driven physical synthesis using persistent virtual routing |
US8028260B1 (en) | 2008-10-14 | 2011-09-27 | Altera Corporation | Determination of most critical timing paths in digital circuits |
US8255860B1 (en) * | 2009-04-03 | 2012-08-28 | Altera Corporation | Exploiting independent portions of logic designs for timing optimization |
US8316339B2 (en) * | 2010-01-28 | 2012-11-20 | Synopsys, Inc. | Zone-based leakage power optimization |
US9064073B2 (en) * | 2010-07-28 | 2015-06-23 | Synopsys, Inc. | Hyper-concurrent optimization over multi-corner multi-mode scenarios |
US8707241B2 (en) * | 2010-07-30 | 2014-04-22 | Synopsys, Inc. | Performing scenario reduction using a dominance relation on a set of corners |
US8615727B2 (en) | 2010-12-16 | 2013-12-24 | Synopsys, Inc. | Simultaneous multi-corner static timing analysis using samples-based static timing infrastructure |
US8621408B2 (en) * | 2011-12-02 | 2013-12-31 | Synopsys, Inc. | Progressive circuit evaluation for circuit optimization |
US8789005B1 (en) | 2012-05-04 | 2014-07-22 | Cadence Design Systems, Inc. | Method and apparatus for efficiently processing an integrated circuit layout |
US8635577B2 (en) | 2012-06-01 | 2014-01-21 | International Business Machines Corporation | Timing refinement re-routing |
US9058456B2 (en) * | 2012-09-25 | 2015-06-16 | International Business Machines Corporation | Method and system to fix early mode slacks in a circuit design |
US8683398B1 (en) * | 2012-11-27 | 2014-03-25 | International Business Machines Corporation | Automated synthesis of high-performance two operand binary parallel prefix adder |
CN104969226B (en) * | 2012-12-26 | 2018-08-28 | 美商新思科技有限公司 | Across pipeline sequential bottleneck analysis to be guided to optimize using useful skew |
US8788995B1 (en) * | 2013-03-15 | 2014-07-22 | Cadence Design Systems, Inc. | System and method for guiding remedial transformations of a circuit design defined by physical implementation data to reduce needed physical corrections for detected timing violations in the circuit design |
US8806412B1 (en) | 2013-05-07 | 2014-08-12 | Atoptech, Inc. | Statistical optimization in place-and-route |
-
2015
- 2015-03-24 US US14/666,416 patent/US9483601B2/en not_active Expired - Fee Related
- 2015-10-23 US US14/921,271 patent/US9471741B1/en not_active Expired - Fee Related
Also Published As
Publication number | Publication date |
---|---|
US9483601B2 (en) | 2016-11-01 |
US9471741B1 (en) | 2016-10-18 |
US20160283637A1 (en) | 2016-09-29 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US9767240B2 (en) | Temperature-aware integrated circuit design methods and systems | |
US10031996B2 (en) | Timing based net constraints tagging with zero wire load validation | |
US9740815B2 (en) | Electromigration-aware integrated circuit design methods and systems | |
US9697322B2 (en) | Hierarchical wire-pin co-optimization | |
US9576091B1 (en) | Preparing engineering change orders for physical design using boolean equivalence checking tools | |
US9384316B2 (en) | Path-based congestion reduction in integrated circuit routing | |
US9298872B2 (en) | Apportioning synthesis effort for better timing closure | |
US9536030B2 (en) | Optimization of integrated circuit physical design | |
US9684751B2 (en) | Slack redistribution for additional power recovery | |
US9760669B2 (en) | Congestion mitigation by wire ordering | |
US9495502B2 (en) | Congestion aware layer promotion | |
US9471741B1 (en) | Circuit routing based on total negative slack | |
US9875326B2 (en) | Addressing coupled noise-based violations with buffering in a batch environment | |
US10372866B2 (en) | Data processing system to implement wiring/silicon blockages via parameterized cells | |
US10552570B2 (en) | Pessimism reduction in hierarchical blockage aggressors using estimated resistor and capacitor values | |
US10719654B2 (en) | Placement and timing aware wire tagging | |
US20200050730A1 (en) | Re-routing time critical multi-sink nets in chip design | |
US9672314B2 (en) | Logic structure aware circuit routing | |
US10372864B2 (en) | Global routing in circuit design | |
US9852259B2 (en) | Area and/or power optimization through post-layout modification of integrated circuit (IC) design blocks | |
US10650113B2 (en) | Modifying circuits based on timing reports for critical paths |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AS | Assignment |
Owner name: INTERNATIONAL BUSINESS MACHINES CORPORATION, NEW Y Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:FOLBERTH, HARALD D.;PEYER, SVEN;SAHA, SOURAV;SIGNING DATES FROM 20150302 TO 20150303;REEL/FRAME:036866/0866 |
|
STCF | Information on status: patent grant |
Free format text: PATENTED CASE |
|
FEPP | Fee payment procedure |
Free format text: MAINTENANCE FEE REMINDER MAILED (ORIGINAL EVENT CODE: REM.); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY |
|
LAPS | Lapse for failure to pay maintenance fees |
Free format text: PATENT EXPIRED FOR FAILURE TO PAY MAINTENANCE FEES (ORIGINAL EVENT CODE: EXP.); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY |
|
STCH | Information on status: patent discontinuation |
Free format text: PATENT EXPIRED DUE TO NONPAYMENT OF MAINTENANCE FEES UNDER 37 CFR 1.362 |
|
FP | Lapsed due to failure to pay maintenance fee |
Effective date: 20201018 |