Xilinx, Inc.

Sreesan Venkatakrishnan

Sabyasachi Das

Satish B Sivaswamy

Nitin Deshmukh

Zhiyong Wang

Ruibing Lu

Brian Guttag

Routing a circuit design includes generating a graph of the circuit design where each connected component is represented as a vertex, generating a routing solution for the circuit design by routing packet-switched nets so that the packet-switched nets of a same connected component do not overlap, and, for each routing resource that is shared by packet-switched nets of different connected components, indicating the shared routing resource on the graph by adding an edge. Cycle detection may be performed on the graph. For each cycle detected on the graph, the cycle may be broken by deleting the edge from the graph and ripping-up a portion of the routing solution corresponding to the deleted edge. The circuit design, or portion thereof, for which the routing solution was ripped up may be re-routed using an increased cost for a shared routing resource freed from the ripping-up.

Deadlock detection and prevention for routing packet-switched nets in electronic systems

Embodiments herein describe techniques for preventing a stall when transmitting data between a producer and a consumer in the same integrated circuit (IC). A stall can occur when there is a split point and a convergence point between the producer and consumer. To prevent the stall, the embodiments herein adjust the latencies of one of the paths (or both paths) such that a maximum latency of the shorter path is greater than, or equal to, the minimum latency of the longer path. When this condition is met, this means the shortest path has sufficient buffers (e.g., a sufficient number of FIFOs and registers) to queue/store packets along its length so that a packet can travel along the longer path and reach the convergence point before the buffers in the shortest path are completely full (or just become completely full).

Optimizing hardware design throughput by latency aware balancing of re-convergent paths

Methods, systems, and apparatus, including computer programs encoded on computer storage media, for performing post-routing and post-placement physical synthesis optimizations. One of the methods includes receiving a circuit design of a multi-die integrated circuit (IC) device having a first die connected with a second die, wherein the circuit design specifies a respective initial component placement of each of a plurality of components on the first die and the second die. A first driver on the first die having a plurality of loads on the second die is selected. A transmit site is selected on the first die that reduces a distance between the first driver and a load of the plurality of loads on the second die. The circuit design is modified including moving the first driver to the selected transmit site on the first die.

Post-placement and post-routing physical synthesis for multi-die integrated circuits

Physical synthesis for a circuit design can include determining, using a processor, a candidate net from a circuit design, wherein the candidate net spans a plurality of dies of a multi-die integrated circuit, and modifying, using the processor, the candidate net by performing physical synthesis resulting in a modified candidate net. The physical synthesis includes relocating a driver or a load of the candidate net or replicating the driver of the candidate net. An incremental routing can be performed on the modified candidate net using the processor. Further, the modified candidate net can be selectively committed using the processor based upon a timing analysis.

Growing community of inventors

San Jose, CA, United States of America

Sreesan Venkatakrishnan