公开(公告)号：US07356793B2

公开(公告)日：2008-04-08

申请号：US11129784

申请日：2005-05-16

申请人： James J. Curtin ,  Michael J. Cadigan, Jr. ,  Edward J. Hughes ,  Kevin M. McIlvain ,  Jose L. Neves ,  Ray Raphy ,  Douglas S. Search

发明人： James J. Curtin ,  Michael J. Cadigan, Jr. ,  Edward J. Hughes ,  Kevin M. McIlvain ,  Jose L. Neves ,  Ray Raphy ,  Douglas S. Search

IPC分类号： G06F17/50

CPC分类号： G06F17/5031

摘要： Genie is a described computer chip design tool which can analyze the data contained within an entire endpoint report, compute relationships between paths based on shared segments, and display this information graphically to the designer. Specifically, Genie groups failing paths into Timing Islands. A timing island is a group of paths which contain at least one shared segment. The most frequently shared segment is sifted to the top of the priority list for each island, and is labeled as the Hub. Thinking of timing islands as a tree, the hub of the island would be the trunk. If you chop the tree down by the trunk, all of the branches, limbs and twigs will fall down too. This is analogous to fixing the timing failures in the hub, and the fix trickling out to each of the segments that dangle off the hub.

摘要翻译： Genie是一种描述的计算机芯片设计工具，可以分析整个端点报告中包含的数据，计算基于共享段的路径之间的关系，并将图形显示给设计者。 具体来说，Genie团体失败了进入时代岛的路径。 定时岛是包含至少一个共享段的一组路径。 最常见的共享段被筛选到每个岛的优先级列表的顶部，并被标记为Hub。 将定时岛作为一棵树，岛上的中心将是树干。 如果树干被树干砍下来，所有的树枝，四肢和树枝也会掉下来。 这类似于在集线器中修复定时故障，并且修复程序会逐渐转移到每个从集线器上散落的段。

公开(公告)号：US07305644B2

公开(公告)日：2007-12-04

申请号：US11129785

申请日：2005-05-16

申请人： James J. Curtin ,  Kevin M. McIlvain ,  Ray Raphy ,  Douglas S. Search ,  Stephen Szulewski

发明人： James J. Curtin ,  Kevin M. McIlvain ,  Ray Raphy ,  Douglas S. Search ,  Stephen Szulewski

IPC分类号： G06F17/50 ,  G06F9/45

CPC分类号： G06F17/5031 ,  G06F17/5072 ,  G06F2217/84

摘要： More “timing closure efficient” Timing Driven Placements by implementing our new net weight for negative slack paths to enhance timing closure behavior is provided by a NSRF (Negative Slack Recover Factor). This new weight would not be based on the absolute amount of negative slack in a path, but rather it would be based on the proportion or percentage of the path's total net delay adder that must be recovered in order to achieve timing closure (zero slack). After an initial or previous placement has been created, then a list of paths with timing violations with a Negative Slack Recover Factor (NSRF) is created for each net in each of the timing paths on the list of paths, and then calculating a NSRF net weight factor for use in subsequent placements and also assigning nets in the list of paths with no timing violations a NSRF default value of one. The NSRF value is calculated as equaling (ZWLM slack value+negative slack value)/ZWLM slack value=(1+(negative slack value/ZWLM slack value)), where ZWLM is a Zero Wire Load Model (ZWLM) value of timing wherein all wire parasitics are removed from consideration in the timing.

摘要翻译： NSRF（Negative Slack Recover Factor）提供了更多的“定时关闭效率”定时驱动的位置，通过实施新的净负载松弛路径来增强时序收敛行为。 这个新的权重不会基于路径中负的松弛的绝对量，而是基于必须恢复的路径的总净延迟加法器的比例或百分比，以实现定时关闭（零松弛） 。 在创建初始或先前的位置之后，然后为路径列表中的每个定时路径中的每个网络创建具有负松弛恢复因子（NSRF）的具有定时违规的路径列表，然后计算NSRF网 用于后续布局的权重因子，并且在没有定时违规的NSRF默认值为1的路径列表中分配网络。 计算NSRF值为ZWLM松弛值+负松弛值/ ZWLM松弛值=（1+（负松弛值/ ZWLM松弛值）），其中ZWLM是零线负载模型（ZWLM）定时值，其中 所有的电线寄生效应在时间上被忽略。

公开(公告)号：US07290233B2

公开(公告)日：2007-10-30

申请号：US11129786

申请日：2005-05-16

申请人： James J. Curtin ,  Kevin M. McIlvain ,  Ray Raphy ,  Douglas S. Search ,  Stephen Szulewski

发明人： James J. Curtin ,  Kevin M. McIlvain ,  Ray Raphy ,  Douglas S. Search ,  Stephen Szulewski

IPC分类号： G06F17/50

CPC分类号： G06F17/5031

摘要： A circuit design method utilizes existing late mode worst case slack calculation functions inherent in timing path trace algorithms which only need to record the worst arrival and worst required arrival times at each netlist node as traced paths. Because of this, most individual path tracing is curtailed due to the likelihood that a more critical arrival or required arrival time has already been recorded at a given netlist node. Worst case slacks are then determined by subtracting the worst case arrival time from the worst case required arrival time. In this manner, worst case slack values are calculated for the entire netlist within a reasonable amount of time. The method uses these existing functions by querying the worst case slack at each netlist node under varied timing model scenarios. These varied timing model scenarios include altering the cell and net delays and arrival times in the model. Then, with the worst case slacks from the varied timing model scenarios in hand, the required priority factors, recoverability and path composition factors are computed by comparing the differences in the worst case slack at each netlist node.

摘要翻译： 电路设计方法利用定时路径跟踪算法中固有的现有的后期模式最差情况松弛计算功能，其仅需要记录每个网表节点处的最差到达和最差的到达时间作为跟踪路径。 因此，由于在给定的网表节点已经记录了更为关键的到达时间或必需的到达时间的可能性，大多数单独的路径跟踪被限制。 然后通过从最坏情况所需的到达时间减去最坏情况的到达时间来确定最差的情况。 以这种方式，在合理的时间内，对整个网表计算最坏情况的松弛值。 该方法通过在不同的时序模式情景下查询每个网表节点处最坏情况的松弛来使用这些现有的功能。 这些不同的时间模型情景包括改变模型中的细胞和净延迟和到达时间。 然后，随着手段中不同时间模式情况的最坏情况的松动，通过比较每个网表节点最差情况下的差异，计算所需的优先级因素，可恢复性和路径组成因子。