Processor, data processing system, and method for initializing a memory block in a data processing system having multiple coherency domains
    1.
    发明申请
    Processor, data processing system, and method for initializing a memory block in a data processing system having multiple coherency domains 有权
    处理器,数据处理系统和用于初始化具有多个相干域的数据处理系统中的存储器块的方法

    公开(公告)号:US20070226423A1

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

    申请号:US11388001

    申请日:2006-03-23

    IPC分类号: G06F13/28

    CPC分类号: G06F12/0822 G06F12/084

    摘要: A data processing system includes at least first and second coherency domains, each including at least one processor core and a memory. In response to an initialization operation by a processor core that indicates a target memory block to be initialized, a cache memory in the first coherency domain determines a coherency state of the target memory block with respect to the cache memory. In response to the determination, the cache memory selects a scope of broadcast of an initialization request identifying the target memory block. A narrower scope including the first coherency domain and excluding the second coherency domain is selected in response to a determination of a first coherency state, and a broader scope including the first coherency domain and the second coherency domain is selected in response to a determination of a second coherency state. The cache memory then broadcasts an initialization request with the selected scope. In response to the initialization request, the target memory block is initialized within a memory of the data processing system to an initialization value.

    摘要翻译: 数据处理系统至少包括第一和第二相干域,每个域包括至少一个处理器核和存储器。 响应于指示要初始化的目标存储器块的处理器核心的初始化操作,第一相干域中的高速缓存存储器确定目标存储器块相对于高速缓冲存储器的一致性状态。 响应于该确定,高速缓存存储器选择识别目标存储器块的初始化请求的广播范围。 响应于第一相关性状态的确定而选择包括第一相关域并且排除第二相关性域的较窄范围,并且响应于确定第一相关性域的第一相关性域和第二相关域 第二一致性状态。 然后,高速缓冲存储器播放具有所选范围的初始化请求。 响应于初始化请求,将目标存储器块在数据处理系统的存储器内初始化为初始化值。

    Method for completing full cacheline stores with address-only bus operations
    2.
    发明申请
    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机器获得写入许可之前数据进入状态时,不会检索高速缓存行的数据。

    Reducing number of rejected snoop requests by extending time to respond to snoop request
    5.
    发明申请
    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.

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

    Cache memory direct intervention
    6.
    发明申请
    Cache memory direct intervention 失效
    缓存内存直接干预

    公开(公告)号:US20060184743A1

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

    申请号:US11056673

    申请日:2005-02-12

    IPC分类号: G06F12/00

    摘要: A method, system, and device for enabling intervention across same-level cache memories. In a preferred embodiment, responsive to a cache miss in a first cache memory a direct intervention request is sent from the first cache memory to a second cache memory requesting a direct intervention that satisfies the cache miss.

    摘要翻译: 一种用于实现跨层级高速缓冲存储器的干预的方法,系统和设备。 在优选实施例中,响应于第一高速缓冲存储器中的高速缓存未命中,直接干预请求从第一高速缓存存储器发送到第二高速缓存存储器,请求满足高速缓存未命中的直接干预。

    Data processing system, cache system and method for scrubbing a domain indication in response to execution of program code
    7.
    发明申请
    Data processing system, cache system and method for scrubbing a domain indication in response to execution of program code 有权
    数据处理系统,缓存系统和用于响应于程序代码的执行来擦除域指示的方法

    公开(公告)号:US20060271741A1

    公开(公告)日:2006-11-30

    申请号:US11136642

    申请日:2005-05-24

    IPC分类号: G06F13/28

    CPC分类号: G06F12/0831 G06F12/0813

    摘要: In response to execution of program code, a control register within scrubbing logic in a local coherency domain is initialized with at least a target address of a target memory block. In response to the initialization, the scrubbing logic issues to at least one cache hierarchy in a remote coherency domain a domain indication scrubbing request targeting a target memory block that may be cached by the at least one cache hierarchy. In response to receipt of a coherency response indicating that the target memory block is not cached in the remote coherency domain, a domain indication in the local coherency domain is updated to indicate that the target memory block is cached, if at all, only within the local coherency domain.

    摘要翻译: 响应于程序代码的执行,用至少目标存储器块的目标地址初始化局部一致性域内的擦除逻辑中的控制寄存器。 响应于初始化,擦除逻辑向远程一致性域中的至少一个高速缓存层级发出针对可由所述至少一个高速缓存层级缓存的目标存储器块的域指示擦除请求。 响应于接收到指示目标存储器块未被缓存在远程一致性域中的一致性响应,本地一致性域中的域指示被更新以指示目标存储器块被缓存,如果完全只在 局部一致性域。

    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.

    Processor, data processing system and method for synchronzing access to data in shared memory
    9.
    发明申请
    Processor, data processing system and method for synchronzing access to data in shared memory 有权
    处理器,数据处理系统和方法,用于同步共享存储器中数据的访问

    公开(公告)号:US20060085603A1

    公开(公告)日:2006-04-20

    申请号:US10965113

    申请日:2004-10-14

    IPC分类号: G06F12/00

    摘要: A processing unit for a multiprocessor data processing system includes a store-through upper level cache, an instruction sequencing unit that fetches instructions for execution, at least one instruction execution unit that executes a store-conditional instruction to determine a store target address, a store queue that, following execution of the store-conditional instruction, buffers a corresponding store operation, sequencer logic associated with the store queue. The sequencer logic, responsive to receipt of a latency indication indicating that resolution of the store-conditional operation as passing or failing is subject to significant latency, invalidates, prior to resolution of the store-conditional operation, a cache line in the store-through upper level cache to which a load-reserve operation previously bound.

    摘要翻译: 一种用于多处理器数据处理系统的处理单元,包括存储器上级缓存器,取指令执行指令排序单元,执行存储条件指令以确定存储目标地址的至少一个指令执行单元,存储器 在存储条件指令的执行之后,缓存与存储队列相关联的对应存储操作,定序器逻辑的队列。 定序器逻辑响应于指示存储条件操作的解析作为传递或失败的等待时间指示受到重大等待时间的影响,在存储条件操作的解析之前无效,存储器中的高速缓存行 加载预备操作先前绑定到的高级缓存。

    Data Processing System and Method for Efficient L3 Cache Directory Management
    10.
    发明申请
    Data Processing System and Method for Efficient L3 Cache Directory Management 有权
    数据处理系统和高效L3缓存目录管理方法

    公开(公告)号:US20080098177A1

    公开(公告)日:2008-04-24

    申请号:US11956112

    申请日:2007-12-13

    IPC分类号: G06F12/00

    摘要: A system and method for cache management in a data processing system having a memory hierarchy of upper memory and lower memory cache. A lower memory cache controller accesses a coherency state table to determine replacement policies of coherency states for cache lines present in the lower memory cache when receiving a cast-in request from one of the upper memory caches. The coherency state table implements a replacement policy that retains the more valuable cache coherency state information between the upper and lower memory caches for a particular cache line contained in both levels of memory at the time of cast-out from the upper memory cache.

    摘要翻译: 一种用于在具有上部存储器和下部存储器高速缓存的存储器层级的数据处理系统中的高速缓存管理的系统和方法。 较低的存储器高速缓存控制器访问一致性状态表以确定当从上部存储器高速缓存中的一个接收到转入请求时存在于下部存储器高速缓存中的高速缓存行的一致性状态的替换策略。 一致性状态表实现替换策略,其在从上部存储器高速缓存中拔出时,在包含在两个级别的存储器中的特定高速缓存行的上下存储器高速缓存之间保留更有价值的高速缓存一致性状态信息。