利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

5 条记录 (耗时 0.017 秒)

    Method and apparatus for filtering snoop requests using a scoreboard
    1.
    发明申请
    Method and apparatus for filtering snoop requests using a scoreboard 失效
    使用记分板过滤窥探请求的方法和装置

    公开(公告)号：US20060224840A1

    公开(公告)日：2006-10-05

    申请号：US11093160

    申请日：2005-03-29

    申请人： Matthias Blumrich ,  Alan Gara ,  Thomas Puzak ,  Valentina Salapura

    发明人： Matthias Blumrich ,  Alan Gara ,  Thomas Puzak ,  Valentina Salapura

    IPC分类号： G06F13/28

    CPC分类号： G06F12/0822 ,  G06F12/0831 ,  G06F2212/507 ,  Y02D10/13

    摘要： An apparatus for implementing snooping cache coherence that locally reduces the number of snoop requests presented to each cache in a multiprocessor system. A snoop filter device associated with a single processor includes one or more “scoreboard” data structures that make snoop determinations, i.e., for each snoop request from another processor, to determine if a request is to be forwarded to the processor or, discarded. At least one scoreboard is active, and at least one scoreboard is determined to be historic at any point in time. A snoop determination of the queue indicates that an entry may be in the cache, but does not indicate its actual residence status. In addition, the snoop filter block implementing scoreboard data structures is operatively coupled with a cache wrap detection logic means whereby, upon detection of a cache wrap condition, the content of the active scoreboard is copied into a historic scoreboard and the content of at least one active scoreboard is reset.

    摘要翻译： 用于实现窥探高速缓存一致性的装置，其本地地减少呈现给多处理器系统中的每个缓存的窥探请求的数量。 与单个处理器相关联的窥探过滤器装置包括一个或多个“记分板”数据结构，其进行窥探确定，即，来自另一个处理器的每个窥探请求，以确定请求是否被转发到处理器或被丢弃。 至少一个记分牌是活跃的，并且至少一个记分牌被确定为在任何时间点的历史。 队列的窥探确定表示一个条目可能在缓存中，但不表示其实际居住状态。 此外，实现记分板数据结构的窥探过滤器块与高速缓存包检测逻辑装置可操作地耦合，由此在检测到缓存包装条件时，将活动记分板的内容复制到历史记分板中，并且至少一个 活动记分板重置。

    Effective delayed, minimized switching, BTB write via recent entry queue that has the ability to delay decode
    2.
    发明申请
    Effective delayed, minimized switching, BTB write via recent entry queue that has the ability to delay decode 有权
    有效延迟，最小化切换，BTB通过最近能够延迟解码的入口队列写入

    公开(公告)号：US20050204120A1

    公开(公告)日：2005-09-15

    申请号：US10796426

    申请日：2004-03-09

    申请人： Brian Prasky ,  Thomas Puzak ,  Allan Hartstein

    发明人： Brian Prasky ,  Thomas Puzak ,  Allan Hartstein

    IPC分类号： G06F9/00 ,  G06F9/32 ,  G06F9/38

    CPC分类号： G06F9/3806 ,  G06F9/325 ,  G06F9/381

    摘要： Disclosed is a method and apparatus providing the capability to supplement a branch target buffer (BTB) with a recent entry queue. A recent entry queue prevents unnecessary removal of valuable BTB data of multiple entries for another entry. Additional, the recent entry queue detects when the latency of the BTB's startup latency is preventing it from asynchronous aiding the microprocessor pipeline as designed for and thereby can delay the pipeline in the required situations such that the BTB latency on startup can be overcome. Finally, the recent entry queue provides a quick access to BTB entries that are accessed in a tight loop pattern where the throughput of the standalone BTB is unable to track the throughput of the microprocessor execution pipeline. Through the usage of the recent entry queue, the modified BTB is capable of processing information at the rate of the execution pipeline thereby accelerating the execution pipeline.

    摘要翻译： 公开了一种提供补充具有最近进入队列的分支目标缓冲器（BTB）的能力的方法和装置。 最近的入口队列可以防止不必要地删除另外一个条目的多个条目的有价值的BTB数据。 另外，最近的进入队列检测到BTB的启动延迟的延迟何时阻止它异步协助微处理器管道设计，从而可以在所需情况下延迟流水线，从而可以克服启动时的BTB延迟。 最后，最近的入口队列可以快速访问以严格环路模式访问的BTB条目，其中独立BTB的吞吐量无法跟踪微处理器执行管道的吞吐量。 通过使用最近的进入队列，修改后的BTB能够以执行流水线的速度处理信息，从而加速执行流水线。

    Context look ahead storage structures
    4.
    发明申请
    Context look ahead storage structures 失效
    前瞻性存储结构

    公开(公告)号：US20050120193A1

    公开(公告)日：2005-06-02

    申请号：US10724815

    申请日：2003-12-01

    申请人： Philip Emma ,  Allan Hartstein ,  Brian Prasky ,  Thomas Puzak ,  Moinuddin Ahmed Qureshi ,  Vijayalakshmi Srinivasan

    发明人： Philip Emma ,  Allan Hartstein ,  Brian Prasky ,  Thomas Puzak ,  Moinuddin Ahmed Qureshi ,  Vijayalakshmi Srinivasan

    IPC分类号： G06F9/00 ,  G06F9/38

    CPC分类号： G06F9/3806

    摘要： A memory storage structure includes a memory storage device, and a first meta-structure having a first size and operating at a first speed. The first speed is faster than a second speed for storing meta-information based on information stored in a memory. A second meta-structure is hierarchically associated with the first meta-structure. The second meta-structure has a second size larger than the first size and operates at the second speed such that faster and more accurate prefetching is provided by coaction of the first and second meta-structures. A method is provided to assemble the meta-information in the first meta-structure and copy this information to the second meta-structure, and prefetching the stored information from the second meta-structure to the first meta-structure ahead of its use.

    摘要翻译： 存储器存储结构包括存储器存储设备和具有第一大小并以第一速度操作的第一元结构。 基于存储在存储器中的信息，第一速度比用于存储元信息的第二速度快。 第二个元结构与第一个元结构分层关联。 第二元结构具有大于第一尺寸的第二尺寸并且以第二速度操作，使得通过第一和第二元结构的共同作用来提供更快更准确的预取。 提供了一种用于在第一元结构中组装元信息并将该信息复制到第二元结构的方法，并且将其从第二元结构预取存储到其使用之前的第一元结构。

    CONTEXT LOOK AHEAD STORAGE STRUCTURES
    5.
    发明申请
    CONTEXT LOOK AHEAD STORAGE STRUCTURES 失效
    上下文前景存储结构

    公开(公告)号：US20080046703A1

    公开(公告)日：2008-02-21

    申请号：US11923902

    申请日：2007-10-25

    申请人： Philip Emma ,  Allan Hartstein ,  Brian Prasky ,  Thomas Puzak ,  Moinuddin Ahmed Qureshi ,  Vijayalakshmi Srinivasan

    发明人： Philip Emma ,  Allan Hartstein ,  Brian Prasky ,  Thomas Puzak ,  Moinuddin Ahmed Qureshi ,  Vijayalakshmi Srinivasan

    IPC分类号： G06F9/00

    CPC分类号： G06F9/3806

    摘要： A memory storage structure includes a memory storage device, and a first meta-structure having a first size and operating at a first speed. The first speed is faster than a second speed for storing meta-information based on information stored in a memory. A second meta-structure is hierarchically associated with the first meta-structure. The second meta-structure has a second size larger than the first size and operates at the second speed such that faster and more accurate prefetching is provided by coaction of the first and second meta-structures. A method is provided to assemble the meta-information in the first meta-structure and copy this information to the second meta-structure, and prefetching the stored information from the second meta-structure to the first meta-structure ahead of its use.

    摘要翻译： 存储器存储结构包括存储器存储设备和具有第一大小并以第一速度操作的第一元结构。 基于存储在存储器中的信息，第一速度比用于存储元信息的第二速度快。 第二个元结构与第一个元结构分层关联。 第二元结构具有大于第一尺寸的第二尺寸并且以第二速度操作，使得通过第一和第二元结构的共同作用来提供更快更准确的预取。 提供了一种用于在第一元结构中组装元信息并将该信息复制到第二元结构的方法，并且将其从第二元结构预取存储到其使用之前的第一元结构。