Reducing number of rejected snoop requests by extending time to respond to snoop request
    1.
    发明申请
    Reducing number of rejected snoop requests by extending time to respond to snoop request 失效
    通过延长响应窥探请求的时间来减少被拒绝的窥探请求数

    公开(公告)号:US20060184746A1

    公开(公告)日:2006-08-17

    申请号:US11056679

    申请日:2005-02-11

    IPC分类号: G06F13/28

    CPC分类号: G06F13/1605 G06F12/0831

    摘要: A cache, system and method for reducing the number of rejected snoop requests. A “stall/reorder unit” in a cache receives a snoop request from an interconnect. The snoop request is entered in the first available latch of the stall/reorder unit unless the stall/reorder unit is full in which case the new snoop request is transmitted to a second unit configured to transmit a request to retry resending the new snoop request. Snoop requests have a higher priority than requests from processors and snoop requests are selected by the arbitration mechanism over processor requests unless the arbitration mechanism requests otherwise (“stall request”) to the stall/reorder unit. By snoop requests having a higher priority than processor requests, the number of snoop requests rejected is reduced. By having the arbitration mechanism issue a stall request, the processor will not be starved.

    摘要翻译: 用于减少拒绝的窥探请求数量的缓存,系统和方法。 缓存中的“停止/重新排序单元”从互连中接收窥探请求。 监听请求被输入到停止/重新排序单元的第一可用锁存器中,除非停止/重新排序单元已满,在这种情况下,新的窥探请求被发送到被配置为发送重新发送新的窥探请求的请求的第二单元。 侦听请求具有比来自处理器的请求更高的优先级,并且仲裁机制通过处理器请求选择侦听请求,除非仲裁机制另请求(“停止请求”)到停止/重新排序单元。 通过具有比处理器请求更高优先级的侦听请求,减少了被拒绝的侦听请求的数量。 通过使仲裁机制发出停顿请求,处理器不会饿死。

    Reducing number of rejected snoop requests by extending time to respond to snoop request

    公开(公告)号:US20060184749A1

    公开(公告)日:2006-08-17

    申请号:US11056764

    申请日:2005-02-11

    IPC分类号: G06F13/28

    CPC分类号: G06F12/0831

    摘要: A cache, system and method for reducing the number of rejected snoop requests. An incoming snoop request is entered in the first available latch in a pipeline of latches in a stall/reorder unit if the stall/reorder unit is not full. The entered snoop request is dispatched to a selector upon entering a bottom latch in the pipeline. The stall/reorder unit is not informed as to whether the dispatched snoop request is accepted by an arbitration mechanism for several clock cycles after the dispatch occurred. A copy of the dispatched snoop request is stored in a top latch in an overrun pipeline of latches in the first unit upon dispatching the snoop request. By maintaining information about the snoop request, the snoop request may be dispatched again to the selector in case the dispatched snoop request was rejected thereby increasing the chance that the snoop request will ultimately be accepted.

    System and method of re-ordering store operations within a processor
    4.
    发明申请
    System and method of re-ordering store operations within a processor 失效
    在处理器内重新排序存储操作的系统和方法

    公开(公告)号:US20060179226A1

    公开(公告)日:2006-08-10

    申请号:US11054450

    申请日:2005-02-09

    IPC分类号: G06F12/00

    摘要: A system and method for re-ordering store operations from a processor core to a store queue. When a store queue receives a new processor-issued store operation from the processor core, a store queue controller allocates a new entry in the store queue. In response to allocating the new entry in the store queue, the store queue controller determines whether or not the new entry is dependent on at least one other valid entry in the store queue. In response to determining the new entry is dependent on at least one other valid entry in the store queue, the store queue controller inhibits requesting of the new entry to the RC dispatch logic until each valid entry on which the new entry is dependent has been successfully dispatched to an RC machine by the RC dispatch logic.

    摘要翻译: 一种用于重新排序从处理器核到存储队列的存储操作的系统和方法。 当存储队列从处理器核心接收到新的处理器发出的存储操作时,存储队列控制器在存储队列中分配新的条目。 响应于在商店队列中分配新条目,商店队列控制器确定新条目是否依赖于商店队列中的至少一个其他有效条目。 响应于确定新条目取决于存储队列中的至少一个其他有效条目,存储队列控制器禁止向RC调度逻辑请求新条目,直到新条目依赖于其上的每个有效条目已经成功 通过RC调度逻辑调度到RC机器。

    Method for completing full cacheline stores with address-only bus operations
    5.
    发明申请
    Method for completing full cacheline stores with address-only bus operations 有权
    完成具有仅地址总线操作的完整缓存线存储的方法

    公开(公告)号:US20050251623A1

    公开(公告)日:2005-11-10

    申请号:US10825189

    申请日:2004-04-15

    IPC分类号: G06F12/00 G06F12/08

    CPC分类号: G06F12/0897 G06F12/0804

    摘要: A method and processor system that substantially eliminates data bus operations when completing updates of an entire cache line with a full store queue entry. The store queue within a processor chip is designed with a series of AND gates connecting individual bits of the byte enable bits of a corresponding entry. The AND output is fed to the STQ controller and signals when the entry is full. When full entries are selected for dispatch to the RC machines, the RC machine is signaled that the entry updates the entire cache line. The RC machine obtains write permission to the line, and then the RC machine overwrites the entire cache line. Because the entire cache line is overwritten, the data of the cache line is not retrieved when the request for the cache line misses at the cache or when data goes state before write permission is obtained by the RC machine.

    摘要翻译: 一种方法和处理器系统,其在完成具有完整存储队列条目的整个高速缓存行的更新时基本上消除数据总线操作。 处理器芯片内的存储队列设计有连接相应条目的字节使能位的各个位的一系列与门。 AND输出被馈送到STQ控制器,并在条目已满时发出信号。 当选择完整条目以发送到RC机器时,RC机器发出信号,表示该条目更新整个高速缓存行。 RC机器获得线路的写入权限,然后RC机器覆盖整个高速缓存行。 由于整个高速缓存线被覆盖,当缓存线的请求在高速缓存中丢失时或在RC机器获得写入许可之前数据进入状态时,不会检索高速缓存行的数据。

    DATA PROCESSING SYSTEM, PROCESSOR AND METHOD OF DATA PROCESSING THAT REDUCE STORE QUEUE ENTRY UTILIZATION FOR SYNCHRONIZING OPERATIONS
    6.
    发明申请
    DATA PROCESSING SYSTEM, PROCESSOR AND METHOD OF DATA PROCESSING THAT REDUCE STORE QUEUE ENTRY UTILIZATION FOR SYNCHRONIZING OPERATIONS 失效
    数据处理系统,处理器和数据处理方法减少存储队列进入同步操作的使用

    公开(公告)号:US20070250669A1

    公开(公告)日:2007-10-25

    申请号:US11380020

    申请日:2006-04-25

    IPC分类号: G06F13/00

    摘要: A data processing system includes a processor core and a memory subsystem. The memory subsystem includes a store queue having a plurality of entries, where each entry includes an address field for holding the target address of store operation, a data field for holding data for the store operation, and a virtual sync field indicating a presence or absence of a synchronizing operation associated with the entry. The memory subsystem further includes a store queue controller that, responsive to receipt at the memory subsystem of a sequence of operations including a synchronizing operation and a particular store operation, places a target address and data of the particular store operation within the address field and data field, respectively, of an entry in the store queue and sets the virtual sync field of the entry to represent the synchronizing operation, such that a number of store queue entries utilized is reduced.

    摘要翻译: 数据处理系统包括处理器核心和存储器子系统。 存储器子系统包括具有多个条目的存储队列,其中每个条目包括用于保存存储操作的目标地址的地址字段,用于保存用于存储操作的数据的数据字段和指示存在或不存在的虚拟同步字段 与该条目相关联的同步操作。 存储器子系统还包括存储队列控制器,其响应于在存储器子系统处的接收包括同步操作和特定存储操作的一系列操作,将特定存储操作的目标地址和数据放置在地址字段和数据中 字段,并且设置条目的虚拟同步字段以表示同步操作,使得减少使用的存储队列条目的数量。

    Method and system for specualtively sending processor-issued store operations to a store queue with full signal asserted
    7.
    发明申请
    Method and system for specualtively sending processor-issued store operations to a store queue with full signal asserted 失效
    方法和系统,用于将处理器发出的存储操作特定发送到存储队列,并发出全信号

    公开(公告)号:US20050251660A1

    公开(公告)日:2005-11-10

    申请号:US10840560

    申请日:2004-05-06

    IPC分类号: G06F9/30

    摘要: A method and processor chip design for enabling a processor core to continue sending store operations speculatively to the store queue after the core receives indication that the store queue is full. The processor core is configured with speculative store logic that enables the processor core to continue issuing store operations while the store queue full signal is asserted. A copy of the speculatively issued store operation is placed within a speculative store buffer. The core waits for a signal from the store queue indicating the store operation was accepted into the store queue. When the speculatively-issued store operation is accepted within the store queue, the copy is discarded from the buffer. However, when the store operation is rejected, the speculative store logic re-issues the store operation ahead of normal store operations.

    摘要翻译: 一种方法和处理器芯片设计,用于使得处理器核心能够在核心接收到存储队列已满的指示之后继续向商店队列发送存储操作。 处理器核心配置有推测存储逻辑,使得处理器核心能够在存储队列满信号被断言的同时继续发出存储操作。 投机发行的存储操作的副本放置在推测性存储缓冲区内。 核心等待来自存储队列的信号,指示存储操作被接受到存储队列中。 当存储队列中接受推测发出的存储操作时,该副本将从缓冲区中丢弃。 然而,当存储操作被拒绝时,推测存储逻辑在正常存储操作之前重新发布存储操作。

    Efficient system bootstrap loading
    8.
    发明申请
    Efficient system bootstrap loading 有权
    高效的系统启动加载

    公开(公告)号:US20060294309A1

    公开(公告)日:2006-12-28

    申请号:US11168715

    申请日:2005-06-28

    IPC分类号: G06F12/00

    CPC分类号: G06F12/0802 G06F12/0897

    摘要: An efficient system for bootstrap loading scans cache lines into a cache store queue during a scan phase, and then transmits the cache lines from the cache store queue to a cache memory array during a functional phase. Scan circuitry stores a given cache line in a set of latches associated with one of a plurality of cache entries in the cache store queue, and passes the cache line from the latch set to the associated cache entry. The cache lines may be scanned from test software that is external to the computer system. Read/claim dispatch logic dispatches store instructions for the cache entries to read/claim machines which write the cache lines to the cache memory array without obtaining write permission, after the read/claim machines evaluate a mode bit which indicates that cache entries in the cache store queue are scanned cache lines. In the illustrative embodiment the cache memory is an L2 cache.

    摘要翻译: 引导加载的有效系统在扫描阶段将高速缓存行扫描到高速缓存存储队列中,然后在功能阶段将高速缓存行从高速缓存存储队列发送到高速缓冲存储器阵列。 扫描电路将给定的高速缓存行存储在与高速缓存存储队列中的多个高速缓存条目之一相关联的一组锁存器中,并将高速缓存线从锁存器组传递到相关联的高速缓存条目。 高速缓存行可以从计算机系统外部的测试软件扫描。 阅读/权利要求调度逻辑调度高速缓存条目的存储指令以在读取/权利要求机器评估指示高速缓存中的高速缓存条目的模式位之后读取/声明将缓存行写入高速缓冲存储器阵列而不获得写入许可的机器 存储队列被扫描缓存行。 在说明性实施例中,高速缓存存储器是L2高速缓存。

    DATA PROCESSING SYSTEM, PROCESSOR AND METHOD OF DATA PROCESSING THAT SUPPORT MEMORY ACCESS ACCORDING TO DIVERSE MEMORY MODELS
    9.
    发明申请
    DATA PROCESSING SYSTEM, PROCESSOR AND METHOD OF DATA PROCESSING THAT SUPPORT MEMORY ACCESS ACCORDING TO DIVERSE MEMORY MODELS 失效
    数据处理系统,处理器和数据处理方法,支持根据多个存储器模型的存储器访问

    公开(公告)号:US20070250668A1

    公开(公告)日:2007-10-25

    申请号:US11380018

    申请日:2006-04-25

    IPC分类号: G06F13/00

    摘要: A data processing system includes a memory subsystem and an execution unit, coupled to the memory subsystem, which executes store instructions to determine target memory addresses of store operations to be performed by the memory subsystem. The data processing system further includes a mode field having a first setting indicating strong ordering between store operations and a second setting indicating weak ordering between store operations. Store operations accessing the memory subsystem are associated with either the first setting or the second setting. The data processing system also includes logic that, based upon settings of the mode field, inserts a synchronizing operation between a store operation associated with the first setting and a store operation associated with the second setting, such that all store operations preceding the synchronizing operation complete before store operations subsequent to the synchronizing operation.

    摘要翻译: 数据处理系统包括存储器子系统和执行单元,其耦合到存储器子系统,其执行存储指令以确定要由存储器子系统执行的存储操作的目标存储器地址。 数据处理系统还包括具有指示存储操作之间的强顺序的第一设置的模式字段和指示存储操作之间的弱顺序的第二设置。 访问内存子系统的存储操作与第一个设置或第二个设置相关联。 数据处理系统还包括基于模式字段的设置的逻辑,在与第一设置相关联的存储操作与与第二设置相关联的存储操作之间插入同步操作,使得同步操作之前的所有存储操作完成 在同步操作之后的存储操作之前。

    PROCESSOR, METHOD, AND DATA PROCESSING SYSTEM EMPLOYING A VARIABLE STORE GATHER WINDOW
    10.
    发明申请
    PROCESSOR, METHOD, AND DATA PROCESSING SYSTEM EMPLOYING A VARIABLE STORE GATHER WINDOW 有权
    处理器,方法和数据处理系统使用可变存储GATHER窗口

    公开(公告)号:US20070277026A1

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

    申请号:US11836872

    申请日:2007-08-10

    IPC分类号: G06F9/00

    摘要: A processor includes at least one instruction execution unit that executes store instructions to obtain store operations and a store queue coupled to the instruction execution unit. The store queue includes a queue entry in which the store queue gathers multiple store operations during a store gathering window to obtain a data portion of a write transaction directed to lower level memory. In addition, the store queue includes dispatch logic that varies a size of the store gathering window to optimize store performance for different store behaviors and workloads.

    摘要翻译: 处理器包括执行存储指令以获得存储操作的至少一个指令执行单元和耦合到指令执行单元的存储队列。 存储队列包括队列条目,其中存储队列在存储收集窗口期间收集多个存储操作,以获得指向低级存储器的写入事务的数据部分。 此外,商店队列包括调度逻辑,其改变商店收集窗口的大小以优化针对不同商店行为和工作负载的存储性能。