Methods and apparatus for invalidating multiple address cache entries
    1.
    发明申请
    Methods and apparatus for invalidating multiple address cache entries 有权
    使多个地址缓存条目无效的方法和装置

    公开(公告)号:US20070038797A1

    公开(公告)日:2007-02-15

    申请号:US11201971

    申请日:2005-08-11

    IPC分类号: G06F12/08 G06F12/00

    CPC分类号: G06F12/0891

    摘要: In a first aspect, a first method is provided for removing entries from an address cache. The first method includes the steps of (1) writing data to a register; and (2) removing a plurality of address cache entries from the address cache based on the data written to the register. Numerous other aspects are provided.

    摘要翻译: 在第一方面,提供了一种从地址高速缓存中移除条目的第一方法。 第一种方法包括以下步骤:(1)将数据写入寄存器; 和(2)基于写入寄存器的数据从地址高速缓存中移除多个地址高速缓存条目。 提供了许多其他方面。

    Trading propensity-based clustering of circuit elements in a circuit design
    2.
    发明申请
    Trading propensity-based clustering of circuit elements in a circuit design 有权
    电路设计中电路元件的交易倾向聚类

    公开(公告)号:US20070260949A1

    公开(公告)日:2007-11-08

    申请号:US11348907

    申请日:2006-02-07

    IPC分类号: G01R31/28

    摘要: An apparatus, program product and method utilize a clustering algorithm based upon trading propensity to generate assignments of circuit elements to clusters or groups to optimize a spatial distribution of the plurality of clusters. For example, trading propensity-based clustering may be used to assign circuit elements such as scan-enabled latches to individual scan chains to optimize the layout of the scan chains in a scan architecture for an integrated circuit design.

    摘要翻译: 装置,程序产品和方法利用基于交易倾向的聚类算法来生成电路元件到集群或组的分配,以优化多个集群的空间分布。 例如,可以使用基于交易倾向的聚类来将电路元件(诸如具有扫描功能的锁存器)分配给单独的扫描链,以优化用于集成电路设计的扫描架构中的扫描链的布局。

    Method and apparatus for allowing uninterrupted address translations while performing address translation cache invalidates and other cache operations
    3.
    发明申请
    Method and apparatus for allowing uninterrupted address translations while performing address translation cache invalidates and other cache operations 失效
    允许不间断地址转换同时执行地址转换高速缓存无效和其它高速缓存操作的方法和装置

    公开(公告)号:US20070180195A1

    公开(公告)日:2007-08-02

    申请号:US11344900

    申请日:2006-02-01

    IPC分类号: G06F13/00 G06F12/00

    CPC分类号: G06F12/1027

    摘要: A method and apparatus for allowing multiple devices access to an address translation cache while cache maintenance operations are occurring at the same time. By interleaving the commands requiring address translation with maintenance operations that may normally take many cycles, address translation requests may have faster access to the address translation cache than if maintenance operations were allowed to stall commands requiring address translations until the maintenance operation was completed.

    摘要翻译: 一种用于允许多个设备访问地址转换高速缓存并且同时进行高速缓存维护操作的方法和装置。 通过将需要地址转换的命令与可能通常需要许多周期的维护操作交错,与维护操作被允许停止需要地址转换的命令直到维护操作完成之前,地址转换请求可能具有对地址转换缓存的更快访问。

    Method for cache hit under miss collision handling
    4.
    发明申请
    Method for cache hit under miss collision handling 审中-公开
    错误碰撞处理下缓存命中的方法

    公开(公告)号:US20070180157A1

    公开(公告)日:2007-08-02

    申请号:US11344909

    申请日:2006-02-01

    IPC分类号: G06F3/00

    摘要: Embodiments of the present invention provide methods and systems for maintaining command order while processing commands in a command queue. Commands may be queued in an input command queue at the CPU. During address translation for a command, subsequent commands may be processed to increase efficiency. Processed commands may be placed in an output queue and sent to the CPU in order. If address translation entries for a command are not found, the translation entries may be retrieved from memory. Address translations for subsequent commands depending from the command getting the miss may be preserved until the address translation entry is retrieved from memory. Therefore, retranslation of addresses for subsequent commands is avoided.

    摘要翻译: 本发明的实施例提供了在处理命令队列中的命令时维持命令顺序的方法和系统。 命令可能在CPU的输入命令队列中排队。 在命令的地址转换期间,可以处理后续命令以提高效率。 处理的命令可以放置在输出队列中并按顺序发送到CPU。 如果没有找到命令的地址转换条目,则可以从存储器检索翻译条目。 从命令获取未命中取得的后续命令的地址转换可以被保留,直到从存储器检索到地址转换条目为止。 因此,避免了后续命令的地址重新转发。

    Method for completing IO commands after an IO translation miss
    5.
    发明申请
    Method for completing IO commands after an IO translation miss 审中-公开
    在IO翻译错过后完成IO命令的方法

    公开(公告)号:US20070180156A1

    公开(公告)日:2007-08-02

    申请号:US11344908

    申请日:2006-02-01

    IPC分类号: G06F3/00

    摘要: Embodiments of the present invention provide methods and systems for maintaining command order while processing commands in a command queue while handling translation cache misses. Commands may be queued in an input command queue at the CPU. During address translation for a command, subsequent commands may be processed to increase efficiency. Processed commands may be placed in an output queue and sent to the CPU in order. During address translation, if a translation cache miss occurs the relevant translation cache entries may be retrieved from memory. After the relevant entries are retrieved a notification may be sent requesting reissue of the command getting the translation cache miss.

    摘要翻译: 本发明的实施例提供了在处理转换高速缓存未命中时在命令队列中处理命令时维持命令顺序的方法和系统。 命令可能在CPU的输入命令队列中排队。 在命令的地址转换期间,可以处理后续命令以提高效率。 处理的命令可以放置在输出队列中并按顺序发送到CPU。 在地址转换期间,如果翻译高速缓存未命中,则可以从存储器检索相关的转换高速缓存条目。 在检索到相关条目之后,可以发送请求重新发出获得翻译高速缓存未命中的命令的通知。

    Dependency matrices and methods of using the same for testing or analyzing an integrated circuit
    6.
    发明申请
    Dependency matrices and methods of using the same for testing or analyzing an integrated circuit 审中-公开
    依赖矩阵及其使用方法用于测试或分析集成电路

    公开(公告)号:US20070136699A1

    公开(公告)日:2007-06-14

    申请号:US11297314

    申请日:2005-12-08

    IPC分类号: G06F17/50

    CPC分类号: G06F17/5022

    摘要: In a first aspect, a method of testing or analyzing an integrated circuit (IC) is provided. The method includes the steps of (1) generating information about a dependency between components of the IC based on a netlist describing the IC; and (2) reducing the generated information by at least one of (a) combining portions of the information about components with a common dependency; and (b) eliminating a portion of the information about at least a first component that does not depend on another component of the IC. Numerous other aspects are provided.

    摘要翻译: 在第一方面,提供了一种测试或分析集成电路(IC)的方法。 该方法包括以下步骤:(1)基于描述IC的网表生成关于IC的组件之间的依赖关系的信息; 和(2)通过以下至少之一来减少所生成的信息:(a)组合具有共同依赖性的关于组件的信息的部分; 和(b)消除关于不依赖于IC的另一个组件的至少第一组件的信息的一部分。 提供了许多其他方面。

    Heuristic clustering of circuit elements in a circuit design
    8.
    发明申请
    Heuristic clustering of circuit elements in a circuit design 失效
    电路设计中电路元件的启发式聚类

    公开(公告)号:US20070186199A1

    公开(公告)日:2007-08-09

    申请号:US11348970

    申请日:2006-02-07

    IPC分类号: G06F17/50

    CPC分类号: G06F17/5072

    摘要: An apparatus, program product and method utilize heuristic clustering to generate assignments of circuit elements to clusters or groups to optimize a desired spatial locality metric. For example, circuit elements such as scan-enabled latches may be assigned to individual scan chains using heuristic clustering to optimize the layout of the scan chains in a scan architecture for a circuit design.

    摘要翻译: 一种装置,程序产品和方法利用启发式聚类来生成电路元件对簇或组的分配,以优化所需的空间位置度量。 例如,可以使用启发式聚类将电路元件(例如启用扫描的锁存器)分配给单独的扫描链,以优化用于电路设计的扫描架构中的扫描链的布局。

    Pseudo LRU algorithm for hint-locking during software and hardware address translation cache miss handling modes
    9.
    发明申请
    Pseudo LRU algorithm for hint-locking during software and hardware address translation cache miss handling modes 有权
    用于虚拟锁定的伪LRU算法在软件和硬件地址转换缓存未命中处理模式下

    公开(公告)号:US20070186046A1

    公开(公告)日:2007-08-09

    申请号:US11348971

    申请日:2006-02-07

    IPC分类号: G06F12/00

    摘要: The present invention provides an improved way to calculate a replacement way within a processor cache that is effective with different combinations of hardware address translation cache miss handling, software address translation cache miss handling, and hint lock bits. For some embodiments, LRU bits used to select an entry for replacement are updated only if software address translation cache miss handling is disabled. Further, for some embodiments, LRU bits may be modified to change the way a binary tree structure is traversed to avoid selecting a hint locked entry for replacement

    摘要翻译: 本发明提供了一种用于计算处理器高速缓存中的替换方式的改进方法,该替换方式对于硬件地址转换高速缓存未命中处理,软件地址转换高速缓存未命中处理和提示锁定位的不同组合是有效的。 对于一些实施例,仅当禁用软件地址转换高速缓存未命中处理时,才更新用于选择用于替换的条目的LRU位。 此外,对于一些实施例,可以修改LRU比特以改变遍历二叉树结构的方式,以避免选择用于替换的提示锁定条目

    Method, apparatus and computer program product for designing logic scan chains for matching gated portions of a clock tree
    10.
    发明申请
    Method, apparatus and computer program product for designing logic scan chains for matching gated portions of a clock tree 失效
    用于设计用于匹配时钟树门控部分的逻辑扫描链的方法,装置和计算机程序产品

    公开(公告)号:US20070168797A1

    公开(公告)日:2007-07-19

    申请号:US11191417

    申请日:2005-07-28

    IPC分类号: G01R31/28

    摘要: Methods, apparatus, and computer program product are provided for designing logic scan chains for matching gated portions of a clock tree. A clock tree includes a plurality of sections, each section including a gate receiving inputs of a global clock and a chain-specific clock control signal for a particular scan chain. A plurality of scan chains is defined, each including a plurality of latches. Each scan chain latch is connected to a corresponding chain-specific clock tree section.

    摘要翻译: 提供了用于设计用于匹配时钟树的门控部分的逻辑扫描链的方法,装置和计算机程序产品。 时钟树包括多个部分,每个部分包括接收用于特定扫描链的全局时钟和链专用时钟控制信号的输入的门。 定义了多个扫描链,每个扫描链包括多个闩锁。 每个扫描链锁存器连接到相应的链专用时钟树部分。