System for Improving a Logic Circuit and Associated Methods
    2.
    发明申请
    System for Improving a Logic Circuit and Associated Methods 有权
    改进逻辑电路和相关方法的系统

    公开(公告)号:US20090106709A1

    公开(公告)日:2009-04-23

    申请号:US11873919

    申请日:2007-10-17

    IPC分类号: G06F17/50

    CPC分类号: G06F17/5031 G06F17/505

    摘要: A system for improving a logic circuit may include a processor, and a logic circuit analyzer in communication with the processor to model a plurality of nets. The system may also include an interface in communication with the logic circuit analyzer to select a target slack-value for each one of the plurality of nets. The logic circuit analyzer may determine a slack-value for each net. In addition, the logic circuit analyzer may selectively reduce resistive-capacitive delay for each net respectively if the determined slack-value is less than the target slack-value for each respective net.

    摘要翻译: 用于改进逻辑电路的系统可以包括处理器和与处理器通信以对多个网络建模的逻辑电路分析器。 该系统还可以包括与逻辑电路分析器通信的接口,以针对多个网络中的每一个网络选择目标松弛值。 逻辑电路分析器可以确定每个网络的松弛值。 此外,如果确定的松弛值小于每个相应网的目标松弛值,则逻辑电路分析器可以分别选择性地减小每个网络的电阻 - 电容延迟。

    Method to identify geometrically non-overlapping optimization partitions for parallel timing closure
    3.
    发明申请
    Method to identify geometrically non-overlapping optimization partitions for parallel timing closure 有权
    识别用于并行计时闭合的几何非重叠优化分区的方法

    公开(公告)号:US20050108665A1

    公开(公告)日:2005-05-19

    申请号:US10716772

    申请日:2003-11-19

    IPC分类号: G06F9/45 G06F17/50

    CPC分类号: G06F17/505

    摘要: A method is provided to speed up timing optimization after placement by parallelizing the optimization step. The method includes performing multiple partitions in the set of timing critical paths such that each partition can be optimized independently in a separate processor. To eliminate the need for inter-processor communication, conditions of timing independence and physical independence are imposed on each partition, thereby defining sub-sets of endpoints and paths associated therewith. The optimizing is performed in parallel by the processors, each of the processors optimizing timing of the paths associated with the endpoints in respective sub-sets. In a preferred embodiment, an endpoint graph is constructed from the list of critical paths, where the endpoint graph has at least one vertex representing critical paths associated with a given endpoint. The partitioning step then includes the step of partitioning the endpoint graph to define sub-sets of vertices.

    摘要翻译: 提供了一种通过并行优化步骤来加速放置后的定时优化的方法。 该方法包括在所述一组定时关键路径中执行多个分区,使得可以在单独的处理器中独立地优化每个分区。 为了消除对处理器间通信的需要,对每个分区施加时序独立性和物理独立性的条件,从而定义与其相关联的端点和路径的子集。 优化由处理器并行执行,每个处理器优化与相应子集中的端点相关联的路径的定时。 在优选实施例中,从关键路径列表构建端点图,其中端点图具有表示与给定端点相关联的关键路径的至少一个顶点。 然后,分割步骤包括分割端点图以定义顶点的子集的步骤。