会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 61. 发明授权
    • Method of optimizing and analyzing selected portions of a digital integrated circuit
    • 优化和分析数字集成电路的选定部分的方法
    • US07010763B2
    • 2006-03-07
    • US10436213
    • 2003-05-12
    • David J. HathawayLawrence Kenneth LangeChandramouli VisweswariahPatrick M. Williams
    • David J. HathawayLawrence Kenneth LangeChandramouli VisweswariahPatrick M. Williams
    • G06F17/50
    • G06F17/505
    • Disclosed is a method for achieving timing closure in the design of a digital integrated circuit or system by selecting portions of the circuit or system to be optimized and portions of the circuit or system in which the effects of such optimization are to be analyzed during the optimization process. Optimized portions will include gates whose design parameters are to be changed, a first analyzed portion includes gates whose delays and edge slews are to be recomputed, and a second analyzed portion includes gates whose ATs and RATs are to be recomputed during optimization. Constraints are imposed at selected boundaries between these portions to prevent unwanted propagation of timing information and to ensure the validity of timing values used during optimization. Through this selection, the size of the problem posed to the underlying optimization method will be reduced, allowing larger circuits or systems to be optimized and allowing optimization to be performed more quickly.
    • 公开了一种在数字集成电路或系统的设计中实现定时闭合的方法,通过选择要优化的电路或系统的部分以及在优化期间分析这种优化的影响的电路或系统的部分 处理。 优化部分将包括其设计参数将被改变的门,第一分析部分包括要重新计算其延迟和边缘电压的门,并且第二分析部分包括在优化期间重新计算其AT和RAT的门。 在这些部分之间的选定边界施加约束,以防止定时信息的不期望的传播,并确保优化期间使用的定时值的有效性。 通过这种选择,将降低对基础优化方法造成的问题的大小,从而允许更大的电路或系统被优化,并允许更快地执行优化。
    • 63. 发明授权
    • System and method for correlated process pessimism removal for static timing analysis
    • 静态时序分析相关过程悲观消除的系统和方法
    • US07117466B2
    • 2006-10-03
    • US10665273
    • 2003-09-18
    • Kerim KalafalaPeihua QiDavid J. HathawayAlexander J. SuessChandramouli Visweswariah
    • Kerim KalafalaPeihua QiDavid J. HathawayAlexander J. SuessChandramouli Visweswariah
    • G06F17/50
    • G06F17/5031
    • A method of removing pessimism in static timing analysis is described. Delays are expressed as a function of discrete parameter settings allowing for both local and global variation to be taken in to account. Based on a specified target slack, each failing timing test is examined to determine a consistent set of parameter settings which produces the worst possible slack. The analysis is performed on a path basis. By considering only parameters which are in common to a particular data/clock path-pair, the number of process combinations that need to be explored is reduced when compared to analyzing all combinations of the global parameter settings. Further, if parameters are separable and linear, worst-case variable assignments for a particular clock/data path pair can be computed in linear time by independently assigning each parameter value. In addition, if available, the incremental delay change with respect to each physically realizable process variable may be used to project the worst-case variable assignment on a per-path basis without the need for performing explicit corner enumeration.
    • 描述了静态时序分析中消除悲观情绪的方法。 延迟表示为离散参数设置的函数,允许将本地和全局变量都用于账户。 根据指定的目标松弛,检查每个失败的定时测试,以确定一组一致的参数设置,从而产生最差的松弛。 分析以路径为基础进行。 通过仅考虑与特定数据/时钟路径对共同的参数,与分析全局参数设置的所有组合相比,需要探索的进程组合的数量减少。 此外,如果参数是可分离的和线性的,则通过独立地分配每个参数值,可以在线性时间内计算特定时钟/数据路径对的最差情况变量分配。 另外,如果可用,可以使用相对于每个物理上可实现的过程变量的增量延迟变化来在每个路径基础上投射最坏情况的变量赋值,而不需要执行明确的角点枚举。
    • 66. 发明授权
    • Decentralized dynamically scheduled parallel static timing analysis
    • 分散式动态调度并行静态时序分析
    • US08775988B2
    • 2014-07-08
    • US13150445
    • 2011-06-01
    • Mark A. LavinDavid J. HathawayKerim KalafalaJeffrey S. PiagetChandramouli Visweswariah
    • Mark A. LavinDavid J. HathawayKerim KalafalaJeffrey S. PiagetChandramouli Visweswariah
    • G06F17/50G06F9/455
    • G06F17/504G06F2217/84
    • A method for performing a parallel static timing analysis in which multiple processes independently update a timing graph without requiring communication through a central coordinator module. Local processing queues are used to reduce locking overhead without causing excessive load imbalance. A parallel analysis is conducted on a circuit design represented by a timing graph formed by a plurality of interconnected nodes, the method including: using a computer for creating a shared work queue of ready to process independent nodes; assigning the independent nodes from the work queue to at least two parallel computation processes, simultaneously performing node analysis computations thereof; and modifying the circuit design by updating values of the processed independent nodes obtained from the node analysis, the at least two parallel computation processes independently updating the shared work queue to process a new plurality of independent nodes.
    • 一种用于执行并行静态时序分析的方法,其中多个进程独立地更新时序图,而不需要通过中央协调器模块进行通信。 本地处理队列用于减少锁定开销,而不会导致过大的负载不平衡。 对由多个互连节点形成的时序图表示的电路设计进行并行分析,该方法包括:使用计算机创建准备处理独立节点的共享工作队列; 将独立节点从工作队列分配到至少两个并行计算过程,同时执行其节点分析计算; 以及通过更新从所述节点分析获得的经处理的独立节点的值来修改所述电路设计,所述至少两个并行计算处理独立地更新所述共享工作队列以处理新的多个独立节点。
    • 67. 发明申请
    • Decentralized Dynamically Scheduled Parallel Static Timing Analysis
    • 分散式动态调度并行静态时序分析
    • US20120311514A1
    • 2012-12-06
    • US13150445
    • 2011-06-01
    • Mark A. LavinDavid J. HathawayKerim KalafalaJeffrey S. PiagetChandramouli Visweswariah
    • Mark A. LavinDavid J. HathawayKerim KalafalaJeffrey S. PiagetChandramouli Visweswariah
    • G06F17/50
    • G06F17/504G06F2217/84
    • A method for performing a parallel static timing analysis in which multiple processes independently update a timing graph without requiring communication through a central coordinator module. Local processing queues are used to reduce locking overhead without causing excessive load imbalance. A parallel analysis is conducted on a circuit design represented by a timing graph formed by a plurality of interconnected nodes, the method including: using a computer for creating a shared work queue of ready to process independent nodes; assigning the independent nodes from the work queue to at least two parallel computation processes, simultaneously performing node analysis computations thereof; and modifying the circuit design by updating values of the processed independent nodes obtained from the node analysis, the at least two parallel computation processes independently updating the shared work queue to process a new plurality of independent nodes.
    • 一种用于执行并行静态时序分析的方法,其中多个进程独立地更新时序图,而不需要通过中央协调器模块进行通信。 本地处理队列用于减少锁定开销,而不会导致过大的负载不平衡。 对由多个互连节点形成的时序图表示的电路设计进行并行分析,该方法包括:使用计算机创建准备处理独立节点的共享工作队列; 将独立节点从工作队列分配到至少两个并行计算过程,同时执行其节点分析计算; 以及通过更新从所述节点分析获得的经处理的独立节点的值来修改所述电路设计,所述至少两个并行计算处理独立地更新所述共享工作队列以处理新的多个独立节点。
    • 68. 发明申请
    • SYSTEM AND METHOD FOR EFFICIENT ANALYSIS OF POINT-TO-POINT DELAY CONSTRAINTS IN STATIC TIMING
    • 点对点延迟约束在静态时序中有效分析的系统与方法
    • US20080134117A1
    • 2008-06-05
    • US11565803
    • 2006-12-01
    • Kerim KalafalaRevanta BanerjiDavid J. HathawayJessica SheridanChandramouli Visweswariah
    • Kerim KalafalaRevanta BanerjiDavid J. HathawayJessica SheridanChandramouli Visweswariah
    • G06F17/50
    • G06F17/5031
    • A method and a system for conducting a static timing analysis on a circuit having a plurality of point-to-point delay constraints between two points of the circuit, in which two conservative and two optimistic user defined tests are derived for all types of the point-to-point delay constraints. The method shows that when a conservative test is performed without introducing any special tags, then it is found that the point-to-point constraint is satisfied. On the other hand, when the optimistic test fails without any special tags, it is determined that the point-to-point constraint is bound to fail if special tags are introduced, in which case, they are to be introduced only when an exact slack is desired. Finally, for anything in between, a real analysis with special tags or path tracing is required. Based on the topology of the graph, arrival time based tests may be tighter in some situations, while the required arrival time based tests, may be tighter in others.
    • 一种用于在电路的两个点之间具有多个点到点延迟约束的电路上执行静态时序分析的方法和系统,其中针对所有类型的点导出两个保守和两个乐观用户定义的测试 到点延迟约束。 该方法表明,当进行保守测试而不引入任何特殊标签时,发现点对点约束得到满足。 另一方面,当乐观测试失败而没有任何特殊标签时,如果引入特殊标签,则确定点对点约束必然会失败,在这种情况下,仅当确切的松弛时才引入它们 是希望的。 最后,对于两者之间的任何东西,需要使用特殊标签或路径跟踪进行真正的分析。 基于图形的拓扑结构,在某些情况下,基于到达时间的测试可能更紧密,而所需到达时间的测试可能在其他情况下更严格。