Particular embodiments generally relate to circuit design automation tools, and more specifically to clock tree synthesis analysis tools.
Design automation tools allow integrated circuit (IC) (“chip”) or board-level designers to implement increasingly complex designs. One such automation tool is a clock tree synthesis (CTS) tool that can balance and route a clock signal to very large numbers of registers, gates, circuits, etc., while optimizing for skew, capacitance, signal slew rates, and other factors. However, conventional graphical user interfaces (GUIs) for analyzing CTS results are limited.
In one embodiment, a method for performing an analysis of a synthesized clock tree can include: displaying a plurality of variation parameters and one or more analysis values on a display screen; accepting a first signal from a user input device to select one of the variation parameters; accepting a second signal from a user input device to select one or more of the analysis values; and displaying a plurality of pins from the synthesized clock tree with the selected variation parameter and the selected one or more analysis values on the display screen.
A further understanding of the nature and the advantages of particular embodiments disclosed herein may be realized by reference to the remaining portions of the specification and the attached drawings.
User interfaces for design automation tools (e.g., place and route tools, circuit synthesis, clock tree synthesis (CTS) tools, circuit and logic simulation tools, etc.) often include disparate design automation result formats or presentations. For example, some data relating to CTS results in some cases may be in textual format, while other data (e.g., a physical layout representation) may be in graphical format. In particular embodiments, a relatively large variety and volume of data related to a synthesized clock tree is made available to a user via a graphical user interface (GUI).
Referring now to
CTS tool 104 can receive a design, such as an integrated circuit (IC) or board-level design (e.g., in the form of a design netlist), and can perform clock tree synthesis for the design. Netlists typically convey connectivity information (e.g., instances, nets, attributes, etc.). Clock tree synthesis can include building a clock tree to distribute a clock signal to inputs or other signals of devices, components, circuits (e.g., standard cells, buffers, gates, etc.) in the IC design referred to as “pins”. In building the clock tree, CTS tool 104 may use timing information for different sets of clock tree variation parameters. The clock tree variation parameters may include different parameters for one or more process “corners” and/or multiple modes of operation in order to meet design specifications and/or to improve design margin to the specifications. Using these parameters, different sets of timing information may be determined and used to build an optimal clock tree.
A process corner or variation parameter may involve conditions for voltage, temperature, or other process variations (e.g., transistor performance characteristics due to semiconductor processing variations). Variation parameters may model semiconductor manufacturing or other process variations that may occur during fabrication of the integrated circuit design. That is, when the integrated circuit design is fabricated on silicon, different process variations may occur. The variation parameters can also model different voltage and temperature conditions. In one example, a number (e.g., about 9-12) of different variation parameters may be provided. Depending on particular variation parameters, timing delays and other signal characteristics (e.g., within a synthesized clock tree) may differ.
CTS tool 104 may take into account different sets of clock tree variation parameters in determining the placement of clock tree nodes or pins in a clock tree. For example, clock tree nodes include buffers (e.g., a ratioed series of inverters). Clock tree nodes may also include other logic elements used to fan out a clock signal. CTS tool 104 may place clock tree nodes for devices to be clocked. For example, CTS tool 104 synthesizes a clock tree for delivering a clock signal to a number of clocked devices, such as registers, latches, flip-flops, etc., that are clocked by the same clock signal. Each of the clocked devices may include pins to which clock tree nodes are connected. A hierarchy of clock tree nodes may be provided to fan the clock signal out from a root node to the receiving pins.
CTS tool 104 determines the placement of clock tree nodes during clock tree synthesis. In determining the placement, clock skew, and/or other metrics (e.g., area, power, insertion delays, etc.) may be optimized based on different sets of clock tree timing variation parameters. For example, the different sets of variation parameters yield different timing information for the clock tree, and such optimization can be performed substantially in a simultaneous fashion to obtain preferred quality of results (QoR). In one example, when optimizing clock skew using one variation parameter, how the clock skew is affected for other variation parameters is also analyzed. Thus, if the clock tree is adjusted to improve skew for one variation parameter, CTS tool 104 balances whether clock skew for another variation parameter is significantly worsened. Thus, balancing clock skew for multiple variation parameters may be performed in synthesizing the clock tree. Particular embodiments allow for an analysis of multi-corner process information and/or multi-mode process information using a single tool/GUI.
As shown, a synthesized clock tree can be stored (e.g., in storage device 106) for subsequent analysis, as well as further design. In particular embodiments, user interface control 108 can access storage device 106 for CTS GUI analysis on display 110. Further, user interface control 108 can receive user inputs, such as from a user input device (e.g., a keyboard, mouse, any suitable pointing device, speech recognition engine for voice inputs, or any suitable device for receiving commands from a user), or any combination of user input devices, and generate control signals therefrom. In addition, one or more components shown in
Referring now to
A CTS sub-window can be launched in main GUI 200 on display 110. Using a CTS sub-window in particular embodiments, users can trace a synthesized clock tree in a browser and cross-highlight particular circuit nodes or nets to a chip physical view (e.g., in window 202). A user can click on an icon in or near pull-down menus/control 212 to activate a CTS GUI window. Alternatively, a user can employ tool command language (TCL) to activate the CTS GUI window.
Referring now to
Further, pop-out menus and/or buttons can include clock tree specifications 320, process/voltage/temperature (PVT) “corners” or variation parameters 322, time 324 (e.g., arrival time, latency), clock path lines 326 (e.g., color blue), display of skew indication 328, skew value 330 (e.g., max), a maximum for expansion 332, a find control 338 (e.g., find a pin of type 340, as entered 342), a number of levels 344 for expansion 342, a chart control 334 (e.g., for bar graph generation to view skews, insertion delays, etc.), and an update button 336. Clock tree specifications 320 can be a GUI selection box to allow a user to choose one of many different clock networks in a design for analysis, or to otherwise define a starting point for a particular clock tree network for analysis. In addition, certain components (e.g., buffers, inverters, multiplexers, etc.) can be filtered out by using appropriate selector buttons (not shown) on CTS GUI window 302.
In certain embodiments, a user operating via the GUI has full access to any number (e.g., 12) of variation parameters, all at the same time. In other words, there is no timing update to see data at any desired variation parameter, but rather all suitable timing data is available. This is because all such variation parameter CTS data can be enabled prior to loading the GUI. In contrast, conventional approaches may not allow analysis of all such data in context across any number of variation parameters at the same time. For example, expansion of variation parameters selection 322 indicates a wide variety of PVT conditions, such as voltage ranges, and library models (e.g., best, worst, typical) for transistors, process variance for wire capacitance, wire resistance, and via resistance, as well as other libraries that model transistor behavior over years (e.g., 5 years, 10 years, etc.) of use. Another source of variance can be test environments that are used to stress test parts before chip assembly (e.g., burn-in tests, high temperature tests, etc.). Table 1 below shows example variation parameters.
Referring now to
As an alternative to a bar chart, an XY-plot can be generated from the CTS data. While histogram plots may be more suitable for showing accurate skew measurements and analysis of outliers, XY-plots can be an effective analysis approach for viewing leaf registers and clock insertion delays to child blocks at the chip level. A user can select any point in such a plot, in similar fashion to selecting histogram bars, as discussed herein. Also, bar graphs can be used to view distributions, and XY-plots to analyze endpoints and useful skew.
Referring now to
In order to focus on main non-skewed registers, the chart window can be updated to focus on a rise arrival range greater than 0.85 ns. This can be done by typing “0.85” in the minimum value entry 410, followed by the “OK” button 420 in CTS chart utilities window 402. An example of a resulting zoomed-in rise arrival plot is shown in bar chart 504.
Referring now to
Referring now to
Referring now to
Referring now to
Although the description has been described with respect to particular embodiments thereof, these particular embodiments are merely illustrative, and not restrictive. For example, while particular menu choices, layout examples, and variation parameters have been described, any suitable menus, layouts, arrangements, and/or parameters can also be supported in particular embodiments.
Any suitable programming language can be used to implement the routines of particular embodiments including C, C++, Java, assembly language, etc. Different programming techniques can be employed such as procedural or object oriented. The routines can execute on a single processing device or multiple processors. Although the steps, operations, or computations may be presented in a specific order, this order may be changed in different particular embodiments. In some particular embodiments, multiple steps shown as sequential in this specification can be performed at the same time.
A “computer-readable medium” for purposes of particular embodiments may be any medium that can contain, store, communicate, propagate, or transport the program for use by or in connection with the instruction execution system, apparatus, system, or device. The computer readable medium can be, by way of example only but not by limitation, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, system, device, propagation medium, or computer memory. Particular embodiments can be implemented in the form of control logic in software or hardware or a combination of both. The control logic, when executed by one or more processors, may be operable to perform that which is described in particular embodiments.
Particular embodiments may be implemented by using a programmed general purpose digital computer, by using application specific integrated circuits, programmable logic devices, field programmable gate arrays, optical, chemical, biological, quantum or nanoengineered systems, components and mechanisms may be used. In general, the functions of particular embodiments can be achieved by any means as is known in the art. Distributed, networked systems, components, and/or circuits can be used. Communication, or transfer, of data may be wired, wireless, or by any other means.
It will also be appreciated that one or more of the elements depicted in the drawings/figures can also be implemented in a more separated or integrated manner, or even removed or rendered as inoperable in certain cases, as is useful in accordance with a particular application. It is also within the spirit and scope to implement a program or code that can be stored in a machine-readable medium to permit a computer to perform any of the methods described above.
As used in the description herein and throughout the claims that follow, “a”, “an”, and “the” includes plural references unless the context clearly dictates otherwise. Also, as used in the description herein and throughout the claims that follow, the meaning of “in” includes “in” and “on” unless the context clearly dictates otherwise.
Thus, while particular embodiments have been described herein, a latitude of modification, various changes and substitutions are intended in the foregoing disclosures, and it will be appreciated that in some instances some features of particular embodiments will be employed without a corresponding use of other features without departing from the scope and spirit as set forth. Therefore, many modifications may be made to adapt a particular situation or material to the essential scope and spirit.
This application is a continuation of U.S. patent application Ser. No. 13/274,276, filed Oct. 14, 2011, entitled “MULTI-MODE MULTI-CORNER CLOCKTREE SYNTHESIS”, which is a continuation-in-part of U.S. patent application Ser. No. 12/036,191, filed Feb. 22, 2008, entitled “MULTI-MODE MULTI-CORNER CLOCKTREE SYNTHESIS,” and which is also a continuation-in-part of U.S. patent application Ser. No. 12/026,755, filed Feb. 6, 2008, entitled “CLOCK TREE SYNTHESIS GRAPHICAL USER INTERFACE,” all of which are hereby incorporated by reference.
Number | Name | Date | Kind |
---|---|---|---|
5617426 | Koenemann et al. | Apr 1997 | A |
6204713 | Adams et al. | Mar 2001 | B1 |
6298468 | Zhen | Oct 2001 | B1 |
6407756 | Sontag et al. | Jun 2002 | B1 |
6460166 | Reddy et al. | Oct 2002 | B1 |
6530065 | McDonald et al. | Mar 2003 | B1 |
6782519 | Chang et al. | Aug 2004 | B2 |
6836877 | Dupenloup | Dec 2004 | B1 |
6904572 | Igarashi | Jun 2005 | B2 |
6909311 | Foley et al. | Jun 2005 | B2 |
6944840 | Sasaki et al. | Sep 2005 | B2 |
7020854 | Killian et al. | Mar 2006 | B2 |
7039891 | Tetelbaum | May 2006 | B2 |
7042269 | Kao | May 2006 | B2 |
7051310 | Tsao | May 2006 | B2 |
7191417 | Luo et al. | Mar 2007 | B1 |
7216322 | Lai et al. | May 2007 | B2 |
7225421 | Migatz et al. | May 2007 | B2 |
7275235 | Molinari et al. | Sep 2007 | B2 |
7299433 | Clement et al. | Nov 2007 | B2 |
7334209 | Roberts et al. | Feb 2008 | B1 |
7406672 | Fukuda | Jul 2008 | B2 |
7418689 | Habitz et al. | Aug 2008 | B2 |
7479825 | Komoda | Jan 2009 | B2 |
7486130 | Overs | Feb 2009 | B2 |
7519923 | Tsuchiya | Mar 2009 | B2 |
7519927 | Hryckowian et al. | Apr 2009 | B1 |
7523430 | Patel | Apr 2009 | B1 |
7526666 | Soni | Apr 2009 | B1 |
7555740 | Buck et al. | Jun 2009 | B2 |
7584443 | Govig et al. | Sep 2009 | B1 |
7624364 | Albrecht et al. | Nov 2009 | B2 |
7689957 | Shenoy | Mar 2010 | B2 |
7810061 | Minonne et al. | Oct 2010 | B2 |
7930652 | Wood | Apr 2011 | B2 |
7996804 | Nikitin et al. | Aug 2011 | B2 |
20020045995 | Shimazaki et al. | Apr 2002 | A1 |
20030048122 | Kazi | Mar 2003 | A1 |
20030058280 | Molinari et al. | Mar 2003 | A1 |
20030135836 | Chang et al. | Jul 2003 | A1 |
20030167451 | Igarashi | Sep 2003 | A1 |
20040225984 | Tsao | Nov 2004 | A1 |
20050050497 | Tetelbaum | Mar 2005 | A1 |
20060053395 | Lai et al. | Mar 2006 | A1 |
20060064658 | Minonne et al. | Mar 2006 | A1 |
20060132186 | Bourgin | Jun 2006 | A1 |
20060190899 | Migatz et al. | Aug 2006 | A1 |
20060248488 | Habitz et al. | Nov 2006 | A1 |
20060288320 | Murgai | Dec 2006 | A1 |
20070094627 | Komoda | Apr 2007 | A1 |
20070106970 | Fukuda | May 2007 | A1 |
20070136708 | Overs et al. | Jun 2007 | A1 |
20070171733 | Wood | Jul 2007 | A1 |
20070220465 | Tsuchiya | Sep 2007 | A1 |
20070288875 | Eakins et al. | Dec 2007 | A1 |
20090064067 | Liu et al. | Mar 2009 | A1 |
20090070714 | Shenoy | Mar 2009 | A1 |
20090179680 | Reuland et al. | Jul 2009 | A1 |
20090187873 | Nikitin et al. | Jul 2009 | A1 |
20090199143 | Sclotman et al. | Aug 2009 | A1 |
20090217225 | Sunder et al. | Aug 2009 | A1 |
20090254874 | Bose | Oct 2009 | A1 |
20100049481 | Walker et al. | Feb 2010 | A1 |
20120240091 | Sunder et al. | Sep 2012 | A1 |
Entry |
---|
International Search Report and Written Opinion dated Apr. 13, 2009 from International Patent Application No. PCT/US2009/034583, 8 pages. |
International Search Report and Written Opinion dated Mar. 13, 2009 from International Patent Application No. PCT/US2009/033203, 6 pages. |
Number | Date | Country | |
---|---|---|---|
20160018979 A1 | Jan 2016 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 13274276 | Oct 2011 | US |
Child | 14873008 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 12036191 | Feb 2008 | US |
Child | 13274276 | US | |
Parent | 12026755 | Feb 2008 | US |
Child | 12036191 | US |