Abstract:
Using a computer and storage, a circuit design process is executed to preserve overall design quality while obtaining quality placements for a full class of pipeline structure signatures. These signatures include classic latch to latch pipelines, as well as a variety of latch to latch and mixed logic pipelines. The process employs a method for optimizing pipeline structure placement in a circuit design, by initiating an analysis of pipeline logic structures for correcting poor quality of result (QOR) placements by identifying poor placements caused by placement algorithmic response to degenerate cases and in the process of analysis preserving high quality placements of global placement and timing to preserve preponderant non-degenerate cases in said circuit design. Then employing a plurality of global placement steps, wherein each subsequent placement&#39;s quality of result (QOR) is dependent upon the prior placement&#39;s quality of result (QOR), circuits are identified as being involved in a class of degenerate cases, and circuits having poor placements are removed by unplacing them from the global placement solution and also other non-degenerate poor quality placements are corrected.

Description:
TRADEMARKS 
       [0001]    IBM® is a registered trademark of International Business Machines Corporation, Armonk, N.Y., U.S.A. Other names used herein may be registered trademarks, trademarks or product names of International Business Machines Corporation or other companies. 
       BACKGROUND OF THE INVENTION 
       [0002]    1. Field of the Invention 
         [0003]    This invention relates to the performance optimization of integrated circuit (IC) designs, and particularly to a faster, more efficient approach to timing closure for integrated circuit designs containing pipeline logic structures, especially where the logic compositions of said pipelines structures are unrestricted in their definition 
         [0004]    2. Description of Background 
         [0005]    Within IBM automated design of integrated circuits generally employs a suite (mix) of IBM design tools and algorithms to simultaneously address the problems of performance optimization and full design wireability, such as those netweight solutions described in US Patent of Publication Numbers US20060015836 A1 dated Jan. 19, 2006 and US20060010410 A1 dated Jan. 12, 2006 illustrating improvements which are now included within a tool set called IBM PISCES and used internally by IBM. Such mixtures have proven effective in achieving these goals for a majority of integrated circuit designs and logic configurations. However, certain specific logic connectivity scenarios and physical configurations have not responded well to this methodology approach. This class of special connectivity scenarios forms a set of degenerate cases when standard linear and quadratic algorithms are employed in design optimization. One case in point has been logic pipeline structures. The placement of logic pipelines in response to standard design optimization tools and algorithms has been poor—resulting in timing violations and missed performance objectives. 
         [0006]    Before our invention, designers used simple scripts to re-place the failing pipeline logic. Creation of the scripts carried with it an overhead in manpower and design time. More problematic was the fact that this approach was not very effective for complex pipeline structures. These structures, unlike classic latch to latch pipelines, contained functional logic between the latches for at least some portion of the pipeline. In such cases the ineffectiveness of simple scripts forced designers to resort to more manually directed operations. 
         [0007]    These operations carried a considerable burden in manpower, and had a considerable impact on design closure schedules. 
       SUMMARY OF THE INVENTION 
       [0008]    The shortcomings of the prior art are overcome and additional advantages are provided through the provision of a design methodology and process which is an effective approach to preserving overall design quality while obtaining quality placements for a full class of pipeline structure signatures. These signatures include classic latch to latch pipelines, as well as a variety of latch to latch and mixed logic pipelines. The process accomplishes its objectives in an automated flow whose impact to design schedules and human resources is much smaller than existing methods. 
         [0009]    Our method can be used as a service for performing optimization of circuits, and provides tools not present before in systems used internally within IBM. Media can contain instructions for performing the process provided, and this media can be stored on a tangible device, such as a C-D ROM. 
         [0010]    Additional features and advantages are realized through the techniques of the present invention. Other embodiments and aspects of the invention are described in detail herein and are considered a part of the claimed invention. For a better understanding of the invention with advantages and features, refer to the description and to the drawings. 
       TECHNICAL EFFECTS 
       [0011]    As a result of the summarized invention, technically we have achieved a solution which corrects pipeline structure timing violations for an entire class of pipeline profiles—both simple latch to latch, and mixed logic pipeline configurations. The solution preserves the quality of the overall design&#39;s placement and timing while improving the quality of pipeline placement and timing in an automated process. This approach realizes a significant savings in both the manpower and elapsed time required to solve the problem. 
     
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
         [0012]    The subject matter which is regarded as the invention is particularly pointed out and distinctly claimed in the claims at the conclusion of the specification. The foregoing and other objects, features, and advantages of the invention are apparent from the following detailed description taken in conjunction with the accompanying drawings in which: 
           [0013]      FIG. 1  illustrates one example of a timing violation on a latch to latch path caused by the excessive distance between the placed source latch and destination latch. 
           [0014]      FIG. 2  illustrates one example of the desired placement for the latches of a pipeline structure, in order to equi-partition the time delay between the source and destination latches of the pipeline. 
           [0015]      FIG. 3  illustrates one example of the actual placement of pipeline latches caused by the standard application of quadratic and linear algorithms and their cost functions 
           [0016]      FIG. 4  illustrates one example of the variety of pipeline structure profiles/compositions/signatures that have been implemented in integrated circuit designs. 
           [0017]      FIG. 5  illustrates one example of the efficacy of the pipeline process described as it applies to Initial Placement. It shows an order of magnitude reduction in timing fails for pipeline structures compared to current automated optimization methods. 
           [0018]      FIG. 6  illustrates one example of the efficacy of the pipeline process described as it applies to Timing Driven (TDP) Placement. It shows approximately an order of magnitude reduction in timing fails for pipeline structures compared to current automated optimization methods. 
           [0019]      FIG. 7  illustrates one example for the remaining failing pipelines, of the amount of timing improvement achieved compared to the original timing state resulting from current automated optimization methods 
           [0020]      FIG. 8  illustrates one example of the degeneracy class exposure exhibited by linear total net length algorithms for special connectivity cases. 
           [0021]      FIG. 9  illustrates one example of the quadratic minimization equilibrium point solutions (placements) achieved for variety of pipeline signatures, based purely on their net list connectivity and nodal characteristics. 
           [0022]      FIG. 10  illustrates one example of the underlying logic composition of various pipelines, which is irrelevant to placement equilibrium point solutions for quadratic algorithms. 
           [0023]      FIG. 11  illustrates one example of how logic-unaware quadratic placement solutions can result in correct pipeline distance partitioning and time delay budgeting within classic latch to latch pipelines. 
           [0024]      FIG. 12  illustrates one example of how logic-unaware and timing-unaware placement solutions result in undesired distance partitioning and delay budgeting when mixed logic paths are part of the pipeline. This indicates the need for timing-derived net weights to drive the placement solution. 
           [0025]      FIG. 13  illustrates one example of how logic-unaware placement solutions result in greater deviation from distance equi-partitioning and desired delay budgeting as the amount of logic in one of the pipeline&#39;s paths deviates from the amount of logic in the other paths of the pipeline. 
           [0026]      FIG. 14  illustrates one example of a design optimization methodology flow indicating the sequential dependency of timing, net weight mapping, and placement on each other within an iterative process. 
           [0027]      FIG. 15  illustrates one example of the propagation of poor placement results into poor timing results through the sequential dependencies of the iterative flow. It illustrates why degeneracy behavior must be corrected at major stages of the flow in order to preserve final quality timing for pipelines at the end of the process. 
           [0028]      FIG. 16  illustrates one example of where the new pipeline methodology algorithm and process would be executed within the design methodology flow. 
           [0029]      FIG. 17  illustrates one example of implementation of the new automated pipeline process. Detailed steps and sequence structure is described. 
       
    
    
       [0030]    The detailed description explains the preferred embodiments of the invention, together with advantages and features, by way of example with reference to the drawings. 
       DETAILED DESCRIPTION OF THE INVENTION 
       [0031]    As chip cycle times have decreased, chip sizes and integration levels have increased. These factors have conspired to produce an ever increasing population of excessive path source-to-sink distances ( FIG. 1 ). The ability to close timing on these paths ranges from problematic to impossible. Often these long path distances are non-negotiable due to Floor planning and logic global connectivity constraints. When possible, designers seek to traverse the distance in multiple cycles by means of a sequence (pipeline) of timing paths which meet their individual single cycle time requirements. As a result, pipeline usage is becoming more prevalent 
         [0032]    The designer&#39;s desire and expectation is that the individual single cycle paths will be placed in such a way that the multi-cycle distance will be partitioned into equal subdivisions—each subdivision path distance being short enough to support its single cycle timing requirement ( FIG. 2 ). 
         [0033]    Increased usage of pipeline structures has given rise to an increased incidence of timing failures associated with pipelines unique connectivity characteristics and the placement behavioral response to those characteristics. Current chip and macro design methodologies invoke placement tools which incorporate within their algorithms a variety of metrics and objective functions. For those placement tools with linear objective functions there is a placement quality exposure. Certain logic connectivity scenarios (e.g. pipeline structures) can create degenerate cases for placement tools using these algorithms and objective functions. Consequently, the placements for these logic structures can produce extreme net length differences and severely unbalanced path delays within the pipelines ( FIG. 3 ). The resulting timing violations for the pipeline paths can be so large in magnitude that they cannot be rectified by the normal post-placement optimization tool suites. Forms of manual intervention are required. 
         [0034]    An additional factor complicates the picture. Not all pipelines are the same! Some pipelines are classic types—composed entirely of latches. Other pipelines are mixed logic pipelines, having both latch to latch paths as well as latch to logic to latch paths within the same pipeline ( FIG. 4 ). Some pipelines are pure latch to latch (L-L) while others contain paths with AND, OR, XOR, MUX, NAND logic (A,O,X,M etc). 
         [0035]    For these mixed logic pipeline designs there is no current viable solution. Deterministic post placement repositioning of pipeline latches by manual methods requires an unacceptable increase in design turn around time when the number of pipelines approaches triple digits. Simple scripted methods can process hundreds of pipelines quickly but will not be effective when mixed logic pipelines are present. Designs currently exist with over ten thousand pipelines having a multitude of classic and mixed logic pipeline types. 
         [0036]    The process we describe preserves the general quality of the global placement established by the existing suite of placement algorithms; while repairing poor quality placements associated with the logic connectivity degenerate cases (e.g. pipelines). To do this the proposed methodology establishes an initial placement using the normal placement algorithm set. The pipelines with timing violations are then stripped from the placement solution and replaced using a method which circumvents all placement algorithms which contribute to the placement quality problem. This method obtains equilibrium point solution coordinates derived from quadratic length minimization equations modified by timing-derived net weight factors. These equilibrium point solution coordinates are implemented as the placement locations applied to the ‘unplace/replace’ pipeline cells. After the step of unplacing poor placements, a result is then legalized. This process is repeated each time for a new dynamic Global placement is generated. 
         [0037]    This methodology can be scripted and executed on many thousands of pipelines as an incremental placement following a general dynamic Global placement with minimal impact to design turn around time. Because of the timings derived net weights, the methodology is effective for both classic and mixed logic pipeline types. It has been executed in prototype form on an existing test case and reduced the number of pipeline timing violations by an order of magnitude ( FIGS. 5 &amp; 6 ). It also improved the timing status on many of the remaining pipeline timing violations by an average of 450 ps ( FIG. 7 ). All of the results shown below in  FIGS. 5 ,  6 , &amp;  7  are timing results achieved by placement alone and do not include the optimization capabilities of post placement logic transforms optimization execution. 
         [0038]    Current placement tools employ a number of different placement sub-steps and accompanying algorithms in their execution. Within this collection of algorithms, multiple metrics and objective/cost functions are exercised. Some of these functions are length-based quadratic and linear functions. 
         [0039]    While this suite of placement optimization algorithms works well for the vast majority of logic placement and connectivity scenarios; there may exist a class of logic connectivity special situations which form a set of degenerate cases for placement. 
         [0040]    Specifically, single input/single output logic nodes may be susceptible to degenerate placement behavior and poor placement quality. Although classic latch to latch pipeline structures represent the most obvious example of this special logic node connectivity configuration, there are other examples. Single net, single fanout repowering tree structures which are hidden by designers from repower tree stripping prior to placement is one example. Another example is multiple input logic circuit nodes (AND, NAND, NOR etc) where all but one input net and output net are ignored for placement due to their logic function or fanout status. Cases like these are rare, but can occur in small numbers on many designs. 
         [0041]    when these single input/single output logic connectivity nodes are processed by linear length-based placement algorithms, the degeneracy of this scenario manifests itself as an infinite number of equally viable optimization solutions ( FIG. 8 ). In the example shown below, a quadratic (Length squared) metric yields a single minimized solution; where the moveable object between A and B is placed so that the net lengths are equal, and the Total Net Length Squared value is 32. A linear algorithm of Total Net Length (TNL) yields the same minimal solution of ‘8’ for all possible placement locations of the moveable object. 
         [0042]    Thus for the TNL linear function, there is no capability to discriminate an optimal result among the myriad of potential solutions. As a result the effects of ancillary objective functions, factors, and algorithms are amplified and become prominent. Even data processing methods—which in normal circumstances are transparent to the final placement result—may directly determine the placement outcome. Actual placement results indicate that placement aberrations can achieve the most extreme degenerate behavior possible. Such placement behavior is often not remediable by the post placement optimization techniques currently employed. 
         [0043]    Designers are forced to resort to either manual repositioning of the poorly placed objects or—when symmetry allows—creation of scripted procedures to do the repositioning using location data and algebraic formulas. Manual repositioning is only feasible when small numbers of pipelines or other logic structures are affected. Simple scripted repositioning will not be effective when complicated mixed logic pipelines are present. 
         [0044]    The behavioral problem appears in all major phases of Global placement, including the primary placement algorithm—the recursive partitioning process that develops the fundamental characteristics of the Global placement. As a result any post placement incremental replacement of failing pipeline logic which uses these algorithms will be tainted by the same degeneracy that was incurred in the original Global placement. 
         [0045]    To overcome this problem a new pipeline methodology is required. The challenges to that methodology are:
       preserve the quality of the general design placement established by the placement tool&#39;s suite of algorithms   remove timing violations in pipelines through creation of a high quality placement for Pipeline structures   achieve that high quality placement while circumventing the entire suite of placement algorithms which gave rise to the Pipeline placement problem   produce a quality placement result for all pipeline types—both classic latch to latch pipelines and mixed logic pipelines.       
 
         [0050]    preserve that quality throughout the placement optimization process—both initial placement and timing driven placement stages. 
         [0051]    This methodology addresses each of those challenges. 
         [0052]    The first step in this methodology is to establish a Global placement for the entire design using the placement algorithms which cause poor pipeline quality. Pipelines which contain timing violations due to failing paths will have their pipeline latch and logic circuits stripped from the Global Placement. The remainder of the Global placement will be preserved by essentially Fixing the global placement through the use of a ‘place unplaced only’ capability applied to the pipeline circuits. After pipeline circuits have been re-placed against the Fixed Global placement background, legalization of the pipeline circuit placements is executed. The minimal placement perturbation to the general design caused by this legalization ensures that the placement and timing quality of the general design will be maintained. 
         [0053]    In order to achieve high quality placements for pipelines and other single fanin/fanout structures, all placement algorithms which introduce the degenerate placement behavior must be circumvented. In the current placement tool, all of the phases (steps) within the placement tool sequence seem to exhibit this behavior. This includes the main global recursive partitioning algorithm which establishes the main characteristics of the placement. 
         [0054]    As was mentioned above, the designer&#39;s desire is a placement of pipeline circuits that will partition the pipeline distance into equal single cycle path subdivisions and implied balanced single cycle path delays ( FIG. 2 ). The discussion on Quadratic vs Linear metrics above, ( FIG. 8 ) indicates a potential solution. The Total length squared minimization goal is satisfied by only one placement location, and that location partitions the A to B distance into two equal subdivisions (nets). Although a simple two net case is shown above, The principle of equi-partitioning extends to the general case of N nets and N−1 circuits between two points. For quadratic solutions involving equal netweights, equilibrium is achieved when all nets are equal to each other in length. Another simple example is shown below ( FIG. 9 ). 
         [0055]    Three independent groups of logic, connected to separate fixed point pairs, achieve their quadratic minimization equilibrium point solution when their constituent nets are equal to one another. This example is introduced for two reasons. First to show simplistically the balanced subdivisions (equal net lengths) among nets in each logic string. Secondly, this template will be used to show why timing-derived net weights must drive the balancing of pipeline paths when mixed logic pipelines are encountered (see below). 
         [0056]    Placement algorithms are ignorant of logic functional composition. These algorithms see all logic circuits as equivalent objects (nodes) and treat them accordingly. Timing however, is very much dependent upon the logic identity of each ‘equivalent’ object. If the logic composition of the placement solution in  FIG. 9  is revealed ( FIG. 10 ), the timing implications of unweighted pipeline placement are seen to be significant. 
         [0057]    For classic Latch to Latch pipelines like Pipeline # 1 , the equilibrium solution for unweighted placement produces a balanced solution for the single cycle paths in the pipeline that satisfies the designer&#39;s objectives and expectations ( FIG. 11 ) 
         [0058]    For mixed logic pipelines like Pipeline # 2  the unweighted equilibrium point solution produces a natural imbalance in the constituent single cycle paths of the pipeline ( FIG. 12 ). The greater the amount of logic mismatch between single cycle paths such as in Pipeline # 3  ( FIG. 13 ); the greater the path to path timing imbalance within the pipeline. 
         [0059]    To correct for this natural path to path imbalance, timing-derived net weights should be used to customize the equilibrium point solution so that it compresses the net lengths for those paths with extra logic between the latches. In addition it should be remembered that the examples shown here are simplifications which allow pipeline logic to line up along a single axis. In real scenarios the mixed logic pipelines contain AND and OR gates with multiple input net connections. This results in a vector solution for the equilibrium point placement locations and not a simple straight line subdivision of the pipeline distance. As a result simple scripts—based on algebraic straight line assumptions for the pipeline—will not be effective mechanisms for optimizing the designs overall timing. These timing derived net weights will also work correctly for classic latch to latch paths. Since each Latch to Latch path is timed identically, the net weights derived for each path will be equal and will result in the correct placement behavior. 
         [0060]    There is an intimate relationship between the interim stages of initial and timing driven placement and the final timing quality for the design. If timing-derived net weights are employed to drive placement optimization, then all timing evaluations, all net weights, all placement results, and all timing optimization activities are linked together in one continuous serially dependent process ( FIG. 14 ). Design evolution is fashioned by the progression of design states and the tool response to those states. Timing results are mapped into net weights, which translate into placement results, which are converted through timing optimization activities into timing results. These timing results are then mapped into a new set of net weights, which drive a new placement solution and give rise through timing optimization activities to a new set of timing results. 
         [0061]    Any contamination of this process by poor quality placement, timing, or mapping results has an opportunity to propagate through the process ( FIG. 15 ). Poor quality pipeline placement behavior is an example of this contamination. 
         [0062]    when a pipeline placement results in balanced path delays within the pipeline, the pipeline paths have balanced time delays and slack values. As a result, the mapping of path slacks into net weights (to drive the next placement) produces equal net weights. These equal net weights imply a control for placement which intends to preserve the path delay balance within the pipeline. 
         [0063]    When a pipeline placement results in extremely unbalanced path delays within a pipeline, the mapping of path timing into net weights produces a varied set of net weights. Paths with large time delays and poor slack status will be given highly elevated net weights. Paths with small delays will be assigned small net weights. This net weight assignment will drive placement to compress the large time delay paths and elongate the paths which have small delays. Normally this is good because it attenuates the time delay imbalance among pipeline paths. However, with the huge time delay imbalances among pipeline paths caused by the current behavior problem and subsequent net weight mapping; the placement compression/elongation response can easily overshoot—causing the small and large time delay paths to change places. This produces a path to path imbalance in top placement which is akin to the imbalance in initial placement. The only difference is that the passing/failing paths within the pipeline have exchanged positive/negative slack status. 
         [0064]    To avoid the possibility of propagating the effects of poor quality pipeline placement from placement to placement, the corrective actions suggested in the Pipeline methodology must be executed after each Global placement. 
         [0065]      FIGS. 16 and 17  illustrate the Pipeline Methodology Process flow as it was implemented in the prototype form described earlier. In  FIG. 16 , the two dashed line blocks, labeled “Algorithm”, indicate the points where the pipeline methodology described in this invention have been inserted into the existing process flow.  FIG. 17  details the individual steps performed within the block marked “Algorithm” ( FIG. 16 ). They are as follows: 
         [0066]    The first action performed in the pipeline algorithm is the generation of the pipeline definition file ( 17 . 1 ). This file simply identifies the set of nets belonging to each particular pipeline in the design. In our implementation we chose to reference a predefined file to identify all pipeline net groups in the design. Alternatively, an algorithm could be developed to provide the pipeline net group list information automatically. Also, note that since the list and pipeline net groupings in the model remain unchanged throughout the entire process, the pipeline definition file is generated only during the initial invocation of the algorithm and is referenced during the subsequent TDP invocation. 
         [0067]    After the pipelines have been identified, post timing optimization reports are generated and a list of all nets with negative slack is obtained ( 17 . 2 , 17 . 3 ). Each net in the negative slack list is then compared to the nets in the pipeline definition list ( 17 . 4 ,  17 . 5 ,  17 . 8 ,  17 . 9 ). If there is a match, all other nets assigned to the same pipeline are selected and their connected cells are added to the list of failing pipeline cells ( 17 . 6 ,  17 . 7 ). 
         [0068]    After all negative slack nets have been visited, all cells identified in the failing pipeline cell list are unplaced from their existing location ( 17 . 10 ). Next, an incremental placement of these unplaced cells is initiated using the same timing-derived net weight factors that were used to drive the existing model wide placement solution ( 17 . 11 ). Once the equilibrium point solution coordinates have been derived from the quadratic length minimization equations, they are extracted and the incremental placement task is terminated ( 17 . 12 ). 
         [0069]    Finally, the unplaced pipeline cells are placed at their derived equilibrium point coordinate ( 17 . 13 ) and legalization is performed to repair all incurred cell overlaps ( 17 . 14 ). 
         [0070]    The capabilities of the present invention can be implemented in software, firmware, hardware or some combination thereof. 
         [0071]    As one example, one or more aspects of the present invention can be included in a tool set provided as an article of manufacture (e.g., one or more computer program products) having, for instance, computer usable media. The media has embodied therein, for instance, computer readable program code means for providing and facilitating the capabilities of the present invention. The article of manufacture can be included as a part of a computer system or sold separately or offered as a service to a customer by providing the process we describe to them as a tool which may be used by a service technician or by the customer themselves. 
         [0072]    Additionally, at least one program storage device readable by a machine, tangibly embodying at least one program of instructions executable by the machine to perform the capabilities of the present invention can be provided. 
         [0073]    The flow diagrams depicted herein are just examples. There may be many variations to these diagrams or the steps (or operations) described therein without departing from the spirit of the invention. For instance, the steps may be performed in a differing order, or steps may be added, deleted or modified. All of these variations are considered a part of the claimed invention. 
         [0074]    While the preferred embodiment to the invention has been described, it will be understood that those skilled in the art, both now and in the future, may make various improvements and enhancements which fall within the scope of the claims which follow. These claims should be construed to maintain the proper protection for the invention first described.