Abstract: Seamless transitions between routing modes are provided via providing a cursor in association with a design layout; in response to receiving a follow-the-cursor (FTC) command at a first position in the design layout, create a first trace in the design layout where the cursor is displayed; in response to receiving a start command for point-to-point routing at a second position in the design layout: complete the first trace at the second position; and provide an indicator at the second position; in response to receiving an end command for point-to-point routing at a third position in the design layout: create a second trace in the design layout where the cursor is displayed; and create a third trace in the design layout, wherein the third trace is routed from the first trace to the second trace.

Abstract: Techniques and systems for capturing and using routing intent in an integrated circuit (IC) design are described. Some embodiments use a graphical user interface (GUI) to capture routing intent for a net, wherein the routing intent includes a set of circuit objects associated with the net, a routing pattern, and optionally a set of user-provided attribute values. Next, the embodiments provide the routing intent to a router, wherein the router uses the routing intent to route the net.

Abstract: Seamless transitions between routing modes are provided via providing a cursor in association with a design layout; in response to receiving a follow-the-cursor (FTC) command at a first position in the design layout, create a first trace in the design layout where the cursor is displayed; in response to receiving a start command for point-to-point routing at a second position in the design layout: complete the first trace at the second position; and provide an indicator at the second position; in response to receiving an end command for point-to-point routing at a third position in the design layout: create a second trace in the design layout where the cursor is displayed; and create a third trace in the design layout, wherein the third trace is routed from the first trace to the second trace.

Abstract: Techniques and systems for determining a route from a start point to a target point in an integrated circuit (IC) design using topology-driven line probing are described. Some embodiments can create a data structure to store a set of nodes, wherein each node is located on a horizontal probe or a vertical probe, and wherein each node has a cost. The embodiments can then perform a set of operations in an iterative loop, the set of operations comprising: selecting a lowest cost node from the set of nodes; terminating the iterative loop if the lowest cost node is located at the target point; extending a probe from the lowest cost node if the lowest cost node is not located at the target point; creating at least one new node on the probe or on an ancestor of the probe; and adding the new node to the set of nodes.

Abstract: Techniques and systems for determining a route from a start point to a target point in an integrated circuit (IC) design using topology-driven line probing are described. Some embodiments can create a data structure to store a set of nodes, wherein each node is located on a horizontal probe or a vertical probe, and wherein each node has a cost. The embodiments can then perform a set of operations in an iterative loop, the set of operations comprising: selecting a lowest cost node from the set of nodes; terminating the iterative loop if the lowest cost node is located at the target point; extending a probe from the lowest cost node if the lowest cost node is not located at the target point; creating at least one new node on the probe or on an ancestor of the probe; and adding the new node to the set of nodes.

Abstract: Techniques and systems for capturing and using routing intent in an integrated circuit (IC) design are described. Some embodiments use a graphical user interface (GUI) to capture routing intent for a net, wherein the routing intent includes a set of circuit objects associated with the net, a routing pattern, and optionally a set of user-provided attribute values. Next, the embodiments provide the routing intent to a router, wherein the router uses the routing intent to route the net.

Abstract: A scaled-down representation of input to a compute-intensive application is created. A computing requirement based on the scaled-down representation is calculated. A turn-around time and an actual cost to a customer to run the compute-intensive application with the input, on one or more processors, based on the calculated computing requirement, is calculated and then sent to the customer.

Abstract: A replacement path is identified for a signal path of a circuit design from if possible, topological equivalent alternate paths of the signal path, and if not possible, from topologically morphed versions of the signal path. In various embodiments, topological equivalent alternate paths are identified by sliding one or more path segments of (the topologically morphed version of the) the signal path. In various embodiments, topology morphing may be effectuated through breaking of one or more path segments, each at one or more points.

Abstract: In one embodiment the invention is a method. The method includes finding costs to route a net to a set of crosspoints on a boundary. The method also includes propagating the costs to a succeeding set of nodes.

Abstract: In one embodiment the invention is a method. The method includes finding costs to route a net to a set of crosspoints on a boundary. The method also includes propagating the costs to a succeeding set of nodes.