SEQUENTIAL DELAY ANALYSIS BY PLACEMENT ENGINES
Some embodiments provide a method of designing an integrated circuit (IC). The design is expressed as a graph that includes several nodes that represent several IC components. The nodes include a first set of nodes that represent a set of clocked elements. The method creates a second set of nodes by removing all nodes in the first set from the nodes that represent the IC components. The method identifies a set of edges that connect two nodes in the second set without encompassing a third node in the second set. The method assigns an event time to each node in the second set. The method assigns a cost function based on the event times of the nodes connected by each edge and the number of nodes in the first set encompassed by each edge. The method optimizes the cost function and places the components based on the cost function optimization.
The present invention is directed towards placement engines for integrated circuits.
BACKGROUND OF THE INVENTIONAn IC is a device that includes numerous electronic components (e.g., transistors, resistors, diodes, etc.) that are embedded typically on the same substrate, such as a single piece of semiconductor wafer. These components are connected with one or more layers of wiring to form multiple circuits, such as Boolean gates, memory cells, arithmetic units, controllers, decoders, etc. An IC is often packaged as a single IC chip in one IC package, although some IC chip packages can include multiple pieces of substrate or wafer.
Electronic Design Automation (EDA) tools are automated tools used in IC design. Placement and routing are steps in automatic design of ICs in which a layout of a larger block of the circuit or the whole circuit is created from layouts of smaller sub-blocks. During placement, the positions of the sub-blocks in the design area are determined. These sub-blocks are interconnected during routing. A placer assigns exact locations for circuit components within the IC chip's core area. A placer typically has several objectives such as minimizing total wire length, timing optimization, reducing congestion, and minimizing power. The placer takes a given synthesized circuit netlist with a technology library and produces a placement layout. The layout is optimized according to a set of placer objectives.
The maximum delay through the critical path of a chip determines the clock cycle and, therefore, the speed of the chip. The timing optimization is performed to ensure that no path exists with delay exceeding a maximum specified delay.
SUMMARY OF THE INVENTIONSome embodiments provide a method of designing an integrated circuit (IC). The design is expressed as a graph that includes several nodes that represent several IC components. The nodes include a first set of nodes that represent a set of clocked elements. The method creates a second set of nodes by removing all nodes in the first set from the nodes that represent the IC components. The method identifies a set of edges that connect two nodes in the second set without encompassing a third node in the second set. The method assigns an event time to each node in the second set. The method assigns a cost function based on the event times of the nodes connected by each edge and the number of nodes in the first set encompassed by each edge. The method optimizes the cost function and places the components based on the cost function optimization.
In some embodiments, the cost function is further based on horizontal and vertical coordinates of the nodes on the graph. In some embodiments, the cost function is optimized by changing at least one of the event time and a coordinate of a node. In some embodiments, all clocked elements in the first set of nodes are retimable clocked elements. In some embodiments, the nodes in the second set include clocked elements that cannot be retimed. In some embodiments, the nodes in the second set include input and out nodes of the graph. In some embodiments, the nodes in the second set include any nodes with timing constraints. In some embodiments, the nodes in the second set include storage elements. In some embodiments, the IC is either an application-specific integrated circuit (ASIC), structured ASIC, field-programmable gate arrays (FPGA), programmable logic devices (PLD), complex programmable logic devices (CPLD), or system on chip (SOC), or system-in-package (SIP).
In some embodiments, the IC is a reconfigurable IC that includes at least one reconfigurable circuit that reconfigures during an operation of the IC. In some embodiments, at least one reconfigurable circuit can reconfigure at a first clock rate that is faster than a second clock rate which is specified for a particular design of the IC. In some embodiments, the second clock has a clock cycle that includes several sub-cycles. In these embodiments, placing the IC components includes assigning each node in the second set of nodes to a particular sub-cycle of the second clock.
Some embodiments provide a method of designing an integrated circuit (IC). The method optimizes a cost function that includes at least one time variable. The method places the IC components based on the cost function optimization. The placing is performed only once after optimizing the cost function. In some embodiments, the time variable includes several event times that are assigned to the components in the IC design. In some embodiments, the cost function further includes horizontal and vertical coordinates of each component. The cost function is optimized by changing at least one of the event time and a coordinate of a component.
Some embodiments provide a method of designing an integrated circuit (IC). The IC design is expressed as a graph that includes several edges and several nodes that represent several IC components. Each edge connects two nodes without encompassing a third node. The method assigns an event time to each node in the graph. The method assigns a cost function for each edge based on the event times of the nodes connected by each edge. The method optimizes the cost function and places the IC components based on the optimized cost function. In some embodiments, the cost function is further based on horizontal and vertical coordinates of the nodes on the graph. In some embodiments, the cost function is optimized by changing at least one of the event time and a coordinate of a node. In some embodiments, the IC is either an application-specific integrated circuit (ASIC), structured ASIC, field-programmable gate arrays (FPGA), programmable logic devices (PLD), complex programmable logic devices (CPLD), system on chip (SOC), system-in-package (SIP), or reconfigurable IC.
The novel features of the invention are set forth in the appended claims. However, for purpose of explanation, several embodiments of the invention are set forth in the following figures.
In the following description, numerous details are set forth for purpose of explanation. However, one of ordinary skill in the art will realize that the invention may be practiced without the use of these specific details. For instance, not all embodiments of the invention need to be practiced with the specific devices referred to below. In other instances, well-known structures and devices are shown in block diagram form in order not to obscure the description of the invention with unnecessary detail.
I. OverviewSome embodiments provide a method of designing an integrated circuit (IC). The design is expressed as a graph that includes several nodes that represent several IC components. The nodes include a first set of nodes that represent a set of clocked elements. The method creates a second set of nodes by removing all nodes in the first set from the nodes that represent the IC components. The method identifies a set of edges that connect two nodes in the second set without encompassing a third node in the second set. The method assigns an event time to each node in the second set. The method assigns a cost function based on the event times of the nodes connected by each edge and the number of nodes in the first set encompassed by each edge. The method optimizes the cost function and places the components based on the cost function optimization.
In some embodiments, the cost function is further based on horizontal and vertical coordinates of the nodes on the graph. In some embodiments, the cost function is optimized by changing at least one of the event time and a coordinate of a node. In some embodiments, all clocked elements in the first set of nodes are retimable clocked elements. In some embodiments, the nodes in the second set include clocked elements that cannot be retimed. In some embodiments, the nodes in the second set include input and out nodes of the graph. In some embodiments, the nodes in the second set include any nodes with timing constraints. In some embodiments, the nodes in the second set include storage elements. In some embodiments, the IC is either an application-specific integrated circuit (ASIC), structured ASIC, field-programmable gate arrays (FPGA), programmable logic devices (PLD), complex programmable logic devices (CPLD), or system on chip (SOC), or system-in-package (SIP).
In some embodiments, the IC is a reconfigurable IC that includes at least one reconfigurable circuit that reconfigures during an operation of the IC. In some embodiments, at least one reconfigurable circuit can reconfigure at a first clock rate that is faster than a second clock rate which is specified for a particular design of the IC. In some embodiments, the second clock has a clock cycle that includes several sub-cycles. In these embodiments, placing the IC components includes assigning each node in the second set of nodes to a particular sub-cycle of the second clock.
Some embodiments provide a method of designing an integrated circuit (IC). The method optimizes a cost function that includes at least one time variable. The method places the IC components based on the cost function optimization. The placing is performed only once after optimizing the cost function. In some embodiments, the time variable includes several event times that are assigned to the components in the IC design. In some embodiments, the cost function further includes horizontal and vertical coordinates of each component. The cost function is optimized by changing at least one of the event time and a coordinate of a component.
Some embodiments provide a method of designing an integrated circuit (IC). The IC design is expressed as a graph that includes several edges and several nodes that represent several IC components. Each edge connects two nodes without encompassing a third node. The method assigns an event time to each node in the graph. The method assigns a cost function for each edge based on the event times of the nodes connected by each edge. The method optimizes the cost function and places the IC components based on the optimized cost function. In some embodiments, the cost function is further based on horizontal and vertical coordinates of the nodes on the graph. In some embodiments, the cost function is optimized by changing at least one of the event time and a coordinate of a node. In some embodiments, the IC is either an application-specific integrated circuit (ASIC), structured ASIC, field-programmable gate arrays (FPGA), programmable logic devices (PLD), complex programmable logic devices (CPLD), system on chip (SOC), system-in-package (SIP), or reconfigurable IC.
Several more detailed embodiments of the invention are described in sections below. Before describing these embodiments further, several terms and concepts used in the disclosure is described below in Section II. This discussion is followed by the discussion in Section III of combinational and sequential delays. Next, Section IV describes several embodiments of placement engines that also perform timing analysis. Last, Section V describes an electronics system with which some of the embodiments of the invention are implemented.
II. Terms and ConceptsA. Graph Representation of IC Designs
A netlist is a graph representation of an IC design. The graph is represented by a collection of node and edges. The nodes represent components of the IC and the edges represent connections between these components. The edges connect the nodes but do not go through (i.e., do not encompass) any nodes. In an IC design, each component lies on one or more signal paths (“paths”). A path is a sequence of nodes and edges in a netlist. The starting node is referred to as the source node and the end node is referred to as the sink or target node. The source and target nodes are also referred to as endpoints of a path. The source and target designations of the endpoints are based on the direction of the signal flow through the path.
A timed path is a path whose both endpoints are timed elements. Timed elements include primary inputs (through which the circuit receives external input), primary outputs (through which the circuit sends outputs to external circuits), clocked elements, storage elements, or any node with timing constraints (e.g., a node with a fixed time, either because the node cannot be retimed or the node is specified as when it should occur).
The arrival time of a signal is the time elapsed for a signal to arrive at a certain point. The reference, or time 0, is taken from a source node. In some embodiments, when the source node is a primary input, the reference time is taken as the arrival time of a signal received at the primary input. Also, when the source node is a clocked element, the reference time is taken as the time a clock signal is received at the clocked element.
To calculate the arrival time of a signal at a node, delay calculation for all components and edges on the path are required. The required time is the latest time at which a signal can arrive without making the clock cycle longer than desired.
The time difference between the arrival time of a signal and the required arrival time of the signal is referred to as slack. The slack for a node is expressed by the following equation (A):
slack=required arrival time−arrival time (A)
A positive (or zero) slack at a node indicates that the node has met its timing requirements. A positive slack also implies that the arrival time of the signal at that node may be increased by the value of the slack without affecting the overall delay of the circuit. Conversely, a negative slack implies that a path is too slow. Therefore, the path must sped up (or the reference signal delayed) if the whole circuit is to work at the desired speed. A critical path is defined as a timed path with largest negative slack.
B. Configurable IC's
A configurable IC is a circuit that can “configurably” perform a set of operations. Specifically, a configurable circuit receives “configuration data” that specifies the operation that the configurable circuit has to perform from the set of operations that it can perform. In some embodiments, the configuration data is generated outside of the configurable IC. In these embodiments, a set of software tools converts a high-level IC design description (e.g., a circuit representation or a hardware description language design) into a set of configuration data that can configure the configurable IC (or more accurately, the configurable circuits of the configurable IC) to implement the IC design.
C. Reconfigurable IC's
A reconfigurable IC is a configurable IC that has at least one circuit that reconfigures during runtime. In other words, a reconfigurable IC is an IC that has reconfigurable logic circuits and/or reconfigurable interconnect circuits, where the reconfigurable logic and/or interconnect circuits are configurable logic and/or interconnect circuits that can “reconfigure” more than once at runtime. A configurable logic or interconnect circuit reconfigures when it receives a different set of configuration data. Some embodiments of the invention are implemented in reconfigurable ICs that are sub-cycle reconfigurable (i.e., can reconfigure circuits on a sub-cycle basis). In some embodiments, a reconfigurable IC has a large number of logic and interconnect circuits (e.g., hundreds, thousands, etc. of such circuits). Some or all of these circuits can be reconfigurable.
In some embodiments, runtime reconfigurability means reconfiguring without resetting the reconfigurable IC. Resetting a reconfigurable IC entails in some cases resetting the values stored in the state elements of the IC, where state elements are elements like latches, registers, and non-configuration memories (e.g., memories that store the user signals as opposed to the memories that store the configuration data of the configurable circuits). In some embodiments, runtime reconfigurability means reconfiguring after the reconfigurable IC has started processing of the user data. Also, in some embodiments, runtime reconfigurability means reconfiguring after the reconfigurable IC has powered up. These definitions of runtime reconfigurability are not mutually exclusive. Examples of configurable and reconfigurable ICs are described in detail in U.S. patent application Ser. No. 11/081,859, “Configurable IC with Interconnect Circuits that also Perform Storage Operations”, filed on Mar. 15, 2005.
D. Sub-Cycle Reconfigurable IC
As further illustrated in
A. Combinational Delay
Combinational delay computation is performed on a path that starts from a clocked element source node and ends to a clocked element target node without encompassing any other clocked elements. Alternatively, the path can either start with any timed element and end to a clocked element or start with a clocked element and end to a timed element without encompassing any other clocked elements. The delay starts at zero and is accumulated as the path is traversed in the signal direction from a source node to a target node.
Furthermore, for simplicity, it is assumed that there are no delays attributed to wiring lengths in this example. Alternatively, the delays attributed to wiring lengths between two endpoints can be added to the delay of the target node. As shown in
Calculation of accumulated delays for each path is described by reference to
Next, the process accumulates delays from the source node to the target node by adding the delays for each computational element. If the delays caused by interconnect wire lengths are not negligible, the process also adds (at 415) these delays to the accumulated delays. Also, when a node has more than one input, the delay of the input path with maximum delay is considered in computation of the sequential delay.
Utilizing process 400, the combinational delays for the elements of the four paths identified on
B. Sequential Delay
Sequential delay computation is similar to combinational delay computation, except sequential delay computation accounts for paths that can go through clocked elements.
Next, the delays are accumulated (at 415) through the clocked elements. Since clocked elements are assigned negative delays, the effect of each clocked element is subtraction of one clock period from the accumulated delay. The delay is accumulated until the target node 710 is reached. The results of these computations for each node are shown on top of the nodes in
For instance, in
C. Retiming
As shown in
Utilizing process 400, the combinational delays for the elements of the four paths (705 to 725, 725 to 740, 740 to 750, and 750 to 710) are computed and the results are displayed on top of each element. These four paths are the paths between two clocked elements or a clocked element and a non-clock timed element. None of the paths encompasses another clocked element other than the source and/or the target nodes.
Utilizing process 500, combinational delays are compared with required times for the signals to get from source to target nodes in each path. As shown in
IV. Placement Engines that Perform Timing Analysis
In some embodiments, the timing analysis is performed by the placement engine while the placement engine is optimizing other costs (such as wiring lengths and congestion) of the netlist. However, calculating sequential delays can be very time consuming.
Next, the process optimizes (at 1010) the cost function by changing one or more of the variables. Next, the process performs (at 1015) sequential delay timing analysis for each path from a source node to a target node in the netlist. These paths can go through clocked elements. The process then determines (at 1020) whether the target nodes in each path meet their timing requirements. When at least one target does not meet the timing requirements, the process proceeds to 1040 which is described below.
Otherwise, the process determines (at 1025) whether a shorter clock period can be examined to further improve the clock period. The process may utilize a binary search to find shorter values for clock period until a clock period acceptable by the circuit design is reached or the clock period cannot be improved any further. When the process determines that the clock period cannot be improved any further, the process proceeds to 1065 which is described below. Otherwise, the process saves the current clock period as a clock period that has met the timing requirements. Next, the process decreases (at 1035) the clock period and proceeds to 1010 which was described above.
When the test at 1020 fails, the process determines (at 1040) whether all target nodes had met their timing requirements in a previous iteration. If not, the process increases (at 1040) the clock period and proceeds to 1010 that was described above. The process may utilize a binary search to find the next value for the clock period.
After 1040, when the process determines that all target nodes have met the timing requirements, the process determines (at 1050) whether a different clock period can be examined to further improve the clock period. Although the current clock period satisfies the timing requirements of all target nodes, some circuit designs may set a goal of further improving the clock period until a certain number of iterations are performed, the clock period becomes smaller than a certain value, the improvement in the clock period becomes negligible after certain number of iterations, or other criteria is met.
When (after 1050) the process determines that the clock period can be further improved, a new clock period which is longer than the current clock period but shorter than the previously acceptable period is selected (at 1055). The process then proceeds to 1010 that was described above.
On the other hand, when (after 1045) the process determines that the clock period cannot be improved any further, the process restores (at 1060) the best value of the clock period that met the timing requirements in a previous iteration. Finally, the process analyzes (at 1065) each path in the netlist and retimes the clocked elements between computational elements to make the delays between each two adjacent clocked elements or between each timed element and its adjacent clocked elements less than or equal to a clock period. As shown in
A. Failing Loops
Sequential delay computation is an expensive computation. When a netlist includes a loop and the clock period is relatively small, the sequential delay computation for the given clock period may not converge.
Utilizing process 400, an initial value for the sequential delays of the nodes in netlist 1100 is computed.
After all sequential delays are updated node 1145 will have a sequential delay of six time units as shown for the second iteration in Table 1200. This new value of delay for 1145 results in an updated value of eight time units for the sequential delay of node 1115 in the third iteration. As shown in Table 1200, the sequential delay values do not converge for the given clock period. The value of the clock period has to be increased in order for the sequential delay values to converge. In a complicated netlist in which loops are not easily detectable, the sequential delay computation will be very time consuming and will take a long time to find an appropriate value of clock period for which all sequential delays converge.
B. Timing Driven Placement Engines that Assign Event Times to Nodes in the Netlist
Typically, placement engines model the netlist by assigning a horizontal and a vertical coordinate (x and y location) to each node in the graph. In some embodiments, a new dimension is added to the placement engine by assigning an event time to each node in the netlist. In these embodiments, the placement engine performs a three dimensional placement.
Next, the process defines (at 1420) a cost function for the netlist. In some embodiments, the cost function is a function of the interconnect delays and the event times of the source and target nodes. In these embodiments, the cost function is expressed by the following equation (B):
Σedges,ifn(Δti,d(Δxi,Δyi)) (B)
where for each edge, i, Δti is the difference between the event times of the target and the source nodes; Δxi is the difference between the x coordinates of the target and the source nodes; and Δyi is the difference between the y coordinates of the target and the source nodes.
Finally, the process optimizes (at 1425) the cost function based on given criteria for clock period, interconnect wiring length, congestion, etc. The process places (at 1430) the IC components after timing requirements are met. The placement meets timing requirements when:
Σedges,i(Δti≧d(Δxi,Δyi)) (C)
where for each edge, i, Δti is the difference between the event times of the target and the source nodes and d(Δxi,Δyi) is the delay function for edge i.
Since the cost function in equation (B) is based on edges of the graph, when the placement engine changes the event time of a particular node to optimize the cost function, only the time difference, Δt, for the edges that start or end on that particular node are affected. The placement engine does not have to recalculate the delays throughout the netlist.
C. Timing Driven Placement Engines that Compute Sequential Delays
In some embodiments, the placement engine performs sequential delay computation as a part of its timing analysis.
Next, the process assigns (at 1510) an event time to each source and target node which is on a sequential edge. As described above, in some embodiments each node is represented by three variables x, y, and t representing horizontal coordinate, vertical coordinate, and time respectively. In some embodiments, the event times are absolute values given from a time when the execution of the netlist will start during runtime.
Next, the process counts (at 1515) the number of clocked elements located on each sequential edge.
In some embodiments, a placement engine conceptually transforms a path such as 1600 to a path such as 1650 in which the clocked elements are not considered as source or target nodes of the smaller paths. Instead, in path 1650, the smaller paths are sequential edges that start from either timed elements (other than retimable clocked element) or computational elements as source nodes and end to the next timed element (other than a retimable clocked element) or computational element. In other words, the sequential edges are allowed to go through the retimable clocked elements. The number of clocked elements on each sequential edge is counted and is used in computation of sequential delay as indicated further below. For example, the sequential edge between computational elements 1620 and 1625 goes through one clocked element while the sequential edge between computational elements 1625 and 1630 goes through two clocked elements. The number of clocked elements (when more than zero) are shown on top of each node in
Referring back to
Next, the process defines (at 1525) a cost function for all sequential edges in the netlist. In some embodiments, the cost function for a sequential edge is a function of (1) the interconnect delay, d(Δx, Δy), of the sequential edge and (2) the difference between the event times of the source and target nodes of the sequential edge. In these embodiments, the cost function is expressed by the following equation (D):
Σsequential edges,ifn(Δti,d(Δxi,Δyi)) (D)
where Δxi is the difference between the x coordinates of the target and the source nodes, Δyi is the difference between the y coordinates of the target and the source nodes, and Δti is the difference between the event times of the target and the source nodes.
However, when there are retimable clocked elements on a sequential edge, the difference between the event times of the target node and the source node of the edge is increased by the number of clocked elements on the edge multiplied by the clock period. The cost function is, therefore, expressed by the following equation (E):
Σsequential edges,ifn((Δti+(# of clock elements on the sequential edges*clock period)),d(Δxi,Δyi)) (E)
Next, the process optimizes (at 1530) the cost function based on given criteria for clock period, interconnect wiring length, congestion, and other optimization criteria. The process analyzes (at 1535) the netlist and moves the clocked elements (if necessary) between the computational elements to make the delays between each two adjacent clocked elements less than or equal to a clock period. Finally, the process places the IC components.
D. Placement Engines for Reconfigurable ICs
The embodiments disclosed in previous sections are applicable to any kind of ICs such as application-specific integrated circuits (ASICs), structured ASICs, field-programmable gate arrays (FPGAs), programmable logic devices (PLDs), complex programmable logic devices (CPLDs), system on chips (SOCs), system-in-packages (SIPs), reconfigurable ICs (e.g., space-time machines), etc. The embodiments disclosed in this section are applicable to reconfigurable ICs and the reconfigurable portions of SOCs, SIPs, etc. As described below, some embodiments are implemented to perform placement for reconfigurable ICs. In some embodiments with a sub-cycle reconfigurable IC, the placement engine determines which sub-cycle each computational element falls into.
Next, for each node other than a retimable clocked element, the process determines (at 1710) the user clock cycle in which the element will be executed during the operation of the IC. In some embodiments, the placement engine determines the cycle for the node by performing the following equation (F):
user cycle in which a node is executed=event time of the node \ clock period (F) where \ denotes an integer division and the event time of the node is measured in absolute time. Next, the process determines (at 1720) the particular sub-cycle in which the node will be executed by determining the relative time from the beginning the user cycle and the time the node is executed. In some embodiments, the placement engine determines the relative time from the beginning of the user cycle by performing the following equation (G):
execution time of the node relative to the beginning of the user clock cycle=the event time of the node Modulo clock period (G)
In some embodiments equations (F) and (G) are part of the same integer division operation. The operation divides the event time of the node by the clock period where the quotient is shown in equation (F) and the remainder is shown in equation (G).
Similarly, node 1820 is assigned to the second sub-cycle 2135 of the user cycle six, as shown in
The bus 2210 collectively represents all system, peripheral, and chipset interconnects (including bus and non-bus interconnect structures) that communicatively connect the numerous internal devices of the system 2200. For instance, the bus 2210 communicatively connects the processor 2205 with the non-volatile memory 2220, the system memory 2215, and the permanent storage device 2225.
From these various memory units, the processor 2205 receives data for processing and retrieves from the various memory units, instructions to execute. The non-volatile memory 2220 stores static data and instructions that are needed by the processor 2205 and other modules of the system 2200. The storage device 2225 is read-and-write memory device. This device is a non-volatile memory unit that stores instruction and/or data even when the system 2200 is off. Like the storage device 2225, the system memory 2215 is a read-and-write memory device. However, unlike storage device 2225, the system memory is a volatile read-and-write memory, such as a random access memory. The system memory stores some of the instructions and/or data that the processor 2205 needs at runtime.
The bus 2210 also connects to the input and output devices 2230 and 2235. The input devices enable the user to enter information into the system 2200. The input devices 2230 can include touch-sensitive screens, keys, buttons, keyboards, cursor-controllers, microphone, etc. The output devices 2235 display the output of the system 2200.
Finally, as shown in
Some embodiments include electronic components, such as microprocessors, storage, and memory that store computer program instructions (such as instructions for performing operations of a placement engine) in a machine-readable or computer-readable medium. Examples of machine-readable media or computer-readable media include, but are not limited to magnetic media such as hard disks, memory modules, magnetic tape, optical media such as CD-ROMS and holographic devices, magneto-optical media such as optical disks, and hardware devices that are specially configured to store and execute program code, such as application specific integrated circuits (ASICs), field-programmable gate arrays (FPGA), programmable logic devices (PLDs), ROM, and RAM devices. Examples of computer programs or computer code include machine code, such as produced by a compiler, and files including higher-level code that are executed by a computer, an electronic component, or a microprocessor using an interpreter.
While the invention has been described with reference to numerous specific details, one of ordinary skill in the art will recognize that the invention can be embodied in other specific forms without departing from the spirit of the invention. Thus, one of ordinary skill in the art would understand that the invention is not to be limited by the foregoing illustrative details, but rather is to be defined by the appended claims.
Claims
1-19. (canceled)
20. A method for designing an integrated circuit (IC), the method comprising:
- receiving a specification of a particular path between a source node and a target node in the IC, the particular path comprises a set of computational elements and a set of clocked elements;
- attributing a positive combinational delay to each of the computational elements and a negative combinational delay to each of the clocked elements, wherein the negative combinational delay attributed to each clocked element is based on a clock period for operating the clocked element;
- computing a sequential delay for the particular path by adding the combinational delays attributed to the clocked elements and the computational elements; and
- determining whether the sequential delay of the particular path meets a timing requirement.
21. The method of claim 20 further comprising retiming the clocked elements between computation elements to make the delays between each two adjacent clocked element less than or equal to the clock period.
22. The method of claim 21, wherein the cumulative delay being less than one clock period indicates that there exists a retiming of the clocked elements such that all elements in the particular path meet their required timing.
23. The method of claim 20, wherein each clocked element in the set of clocked elements is a retimable clocked element.
24. The method of claim 20, wherein the IC comprises a plurality of reconfigurable circuits, each reconfigurable circuit reconfigurable each cycle to implement a computational element.
25. The method of claim 20 further comprising increasing the clock period when the particular path fails to meet the timing requirement.
26. The method of claim 20 further comprising decreasing the clock period when the particular path successfully meets the timing requirement.
27. The method of claim 20, wherein the set of clocked elements in the particular path comprises a latch.
28. The method of claim 20, wherein the specification of the particular path is provided by a netlist.
29. A method for designing an integrated circuit (IC), the method comprising:
- receiving a specification of a particular path between a source node and a target node in the IC, the particular path comprises a set of computational elements and a set of clocked elements, wherein each computational elements is attributed a positive timing delay and each clocked element is attributed a negative delay that is based on a clock period for operating the clocked element;
- computing a cumulative timing delay from the source node to the target node by adding the timing delays attributed to the set of computational elements and the set of clocked elements; and
- determining whether the particular path meets a timing requirement at the target node based on the computed cumulative timing delay.
30. The method of claim 29 further comprising retiming the clocked elements between computation elements to make the delays between each two adjacent clocked element less than or equal to the clock period.
31. The method of claim 30, wherein the cumulative delay being less than one clock period indicates that there exists a retiming of the clocked elements such that all elements in the particular path meet their required timing.
32. The method of claim 29, wherein each clocked element in the set of clocked elements is a retimable clocked element.
33. The method of claim 29, wherein the IC comprises a plurality of reconfigurable circuits, each reconfigurable circuit reconfigurable each cycle to implement a computational element.
34. The method of claim 29 further comprising increasing the clock period when the particular path fails to meet the timing requirement.
35. The method of claim 29 further comprising decreasing the clock period when the particular path successfully meets the timing requirement.
36. The method of claim 29, wherein the set of clocked elements in the particular path comprises a latch.
37. The method of claim 29, wherein the specification of the particular path is provided by a netlist.
38. A non-transitory computer readable medium storing a program for execution by one or more processing units, the program comprising sets of instructions for:
- receiving a specification of a particular path between a source node and a target node in the IC, the particular path comprises a set of computational elements and a set of clocked elements;
- attributing a positive combinational delay to each of the computational elements and a negative combinational delay to each of the clocked elements, wherein the negative combinational delay attributed to each clocked element is based on a clock period for operating the clocked element;
- computing a sequential delay for the particular path by adding the combinational delays attributed to the clocked elements and the computational elements; and
- determining whether the sequential delay of the particular path meets a timing requirement.
39. The non-transitory computer readable medium of claim 39, wherein the program further comprising a set of instructions for retiming the clocked elements between computation elements to make the delays between each two adjacent clocked element less than or equal to the clock period.
Type: Application
Filed: Aug 15, 2014
Publication Date: Feb 5, 2015
Inventors: Andrew Caldwell (Santa Clara, CA), Steven Teig (Menlo Park, CA)
Application Number: 14/461,290