专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明申请

US20070079216A1 Fault tolerant encoding of directory states for stuck bits 有权
标题翻译：卡位的目录状态的容错编码
公开(公告)号：US20070079216A1
公开(公告)日：2007-04-05
申请号：US11225570
申请日：2005-09-13
申请人： Robert Bell , Guy Guthrie , William Starke
发明人： Robert Bell , Guy Guthrie , William Starke
IPC分类号： G11C29/00
CPC分类号： G11C29/832 , G06F11/1064
摘要： A method of handling a stuck bit in a directory of a cache memory, by defining multiple binary encodings to indicate a defective cache state, detecting an error in a tag stored in a member of the directory (wherein the tag at least includes an address field, a state field and an error-correction field), determining that the error is associated with a stuck bit of the directory member, and writing new state information to the directory member which is selected from one of the binary encodings based on a field location of the stuck bit within the directory member. The multiple binary encodings may include a first binary encoding when the stuck bit is in the address field, a second binary encoding when the stuck bit is in the state field, and a third binary encoding when the stuck bit is in the error-correction field. The new state information may also further be selected based on the value of the stuck bit, e.g., a state bit corresponding to the stuck bit is assigned a bit value from the new state information which matches the value of the stuck bit.
摘要翻译：一种通过定义多个二进制编码来指示缺陷高速缓存状态来处理高速缓冲存储器的目录中的卡住位的方法，检测存储在目录成员中的标签中的错误（其中标签至少包括地址字段，状态字段和纠错字段），确定错误与目录成员的卡住位相关联，并且基于字段位置将新状态信息写入从二进制编码之一中选择的目录成员的目录成员中的卡住位。多个二进制编码可以包括当卡住位在地址字段中时的第一二进制编码，当卡位位于状态字段时的第二二进制编码，以及当卡位位于错误校正字段中时的第三二进制编码。还可以基于卡住位的值进一步选择新的状态信息，例如，对应于该卡住位的状态位从与该卡位的值匹配的新状态信息中分配一位值。

2. 发明申请

US20060179234A1 Cache member protection with partial make MRU allocation 失效
标题翻译：缓存成员保护部分使MRU分配
公开(公告)号：US20060179234A1
公开(公告)日：2006-08-10
申请号：US11054390
申请日：2005-02-09
申请人： Robert Bell , Guy Guthrie , William Starke , Jeffrey Stuecheli
发明人： Robert Bell , Guy Guthrie , William Starke , Jeffrey Stuecheli
IPC分类号： G06F12/00
CPC分类号： G06F12/126 , G06F12/0897 , G06F12/123 , G06F12/128
摘要： A method and apparatus for enabling protection of a particular member of a cache during LRU victim selection. LRU state array includes additional “protection” bits in addition to the state bits. The protection bits serve as a pointer to identify the location of the member of the congruence class that is to be protected. A protected member is not removed from the cache during standard LRU victim selection, unless that member is invalid. The protection bits are pipelined to MRU update logic, where they are used to generate an MRU vector. The particular member identified by the MRU vector (and pointer) is protected from selection as the next LRU victim, unless the member is Invalid. The make MRU operation affects only the lower level LRU state bits arranged a tree-based structure and thus only negates the selection of the protected member, without affecting LRU victim selection of the other members.
摘要翻译：一种用于在LRU受害者选择期间能够保护缓存的特定成员的方法和装置。 LRU状态阵列除了状态位之外还包括额外的“保护”位。保护位用作用于标识要保护的同余类的成员的位置的指针。在标准LRU受害者选择期间，保护成员不会从缓存中删除，除非该成员无效。保护位被流水线到MRU更新逻辑，它们用于生成MRU向量。由MRU向量（和指针）标识的特定成员不被选择作为下一个LRU受害者，除非成员无效。使MRU操作仅影响布置了基于树的结构的较低级LRU状态位，并且因此仅在不影响其他成员的LRU受害者选择的情况下否定对被保护成员的选择。

3. 发明申请

US20060179232A1 Pipelining D states for MRU steerage during MRU/LRU member allocation 失效
标题翻译：在MRU / LRU成员分配过程中，管理MRU操纵的D状态
公开(公告)号：US20060179232A1
公开(公告)日：2006-08-10
申请号：US11054067
申请日：2005-02-09
申请人： Robert Bell , Guy Guthrie , William Starke , Jeffrey Stuecheli
发明人： Robert Bell , Guy Guthrie , William Starke , Jeffrey Stuecheli
IPC分类号： G06F12/00
CPC分类号： G06F12/0888 , G06F12/123 , G06F12/126 , G06F2212/1032
摘要： A method and apparatus for preventing selection of Deleted (D) members as an LRU victim during LRU victim selection. During each cache access targeting the particular congruence class, the deleted cache line is identified from information in the cache directory. A location of a deleted cache line is pipelined through the cache architecture during LRU victim selection. The information is latched and then passed to MRU vector generation logic. An MRU vector is generated and passed to the MRU update logic, which is selects/tags the deleted member as a MRU member. The make MRU operation affects only the lower level LRU state bits arranged in a tree-based structure state bits so that the make MRU operation only negates selection of the specific member in the D state, without affecting LRU victim selection of the other members.
摘要翻译：用于在LRU受害者选择期间防止选择被删除（D）成员作为LRU受害者的方法和装置。在针对特定同余类的每个缓存访问期间，从高速缓存目录中的信息识别已删除的高速缓存行。删除的高速缓存行的位置在LRU受害者选择期间通过高速缓存架构流水线化。信息被锁存，然后传递给MRU向量生成逻辑。生成MRU向量并将其传递给MRU更新逻辑，MRU更新逻辑是将删除的成员作为MRU成员进行选择/标记。使MRU操作仅影响以基于树的结构状态位布置的较低级LRU状态位，使得MRU操作仅在D状态下否定特定成员的选择，而不影响其他成员的LRU受害者选择。

4. 发明申请

US20070079210A1 Method and system for handling stuck bits in cache directories 有权
标题翻译：用于处理缓存目录中的卡位的方法和系统
公开(公告)号：US20070079210A1
公开(公告)日：2007-04-05
申请号：US11225640
申请日：2005-09-13
申请人： Robert Bell , Guy Guthrie , William Starke
发明人： Robert Bell , Guy Guthrie , William Starke
IPC分类号： H03M13/00
CPC分类号： G06F11/1064
摘要： A method of handling a stuck bit in a directory of a cache memory which detects an error in a stored tag having an address field, a state field and an error-correction field, determines that the error is associated with a stuck bit of the directory member, marks the directory member as defective, and casts out corrected address information. The error is detected during processing of a cache directory access request, and is determined to be associated with a stuck bit of the directory member by attempting to correct a first error and then detecting a second error after the first correction attempt. The address information is cast out by routing a surrogate tag contained in a surrogate member of the cache directory through error-correction pipeline circuitry while transmitting the address information from the surrogate member to a cast-out machine.
摘要翻译：一种处理高速缓冲存储器的目录中的卡住位的方法，该高速缓冲存储器的目录中检测到具有地址字段，状态字段和纠错字段的存储标签中的错误，确定该错误与该目录的卡住位相关联会员，将目录成员标记为有缺陷，并丢弃修正的地址信息。在处理高速缓存目录访问请求期间检测到错误，并且通过尝试校正第一错误然后在第一次校正尝试之后检测第二错误来确定与目录成员的卡住位相关联。通过错误校正流水线电路路由包含在高速缓存目录的代理成员中的替代标签，同时将地址信息从代理成员发送到投放机器，来丢弃地址信息。

5. 发明申请

US20060179235A1 Cache mechanism and method for avoiding cast out on bad victim select and recycling victim select operation 有权
标题翻译：缓存机制和方法，用于避免对不良受害者选择和回收受害者选择操作
公开(公告)号：US20060179235A1
公开(公告)日：2006-08-10
申请号：US11054394
申请日：2005-02-09
申请人： Robert Bell , Guy Guthrie , William Starke
发明人： Robert Bell , Guy Guthrie , William Starke
IPC分类号： G06F12/00
CPC分类号： G06F12/126 , G06F12/123 , G06F2212/1032
摘要： A method, apparatus, and computer for identifying selection of a bad victim during victim selection at a cache and recovering from such bad victim selection without causing the system to crash or suspend forward progress of the victim selection process. Among the bad victim selection addressed are recovery from selection of a deleted member and recovery from use of LRU state bits that do not map to a member within the congruence class. When LRU victim selection logic generates an output vector identifying a victim, the output vector is checked to ensure that it is a valid vector (non-null) and that it is not pointing to a deleted member. When the output vector is not valid or points to a deleted member, the LRU victim selection logic is triggered to re-start the victim selection process.
摘要翻译：一种方法，装置和计算机，用于在高速缓存的受害者选择期间识别对不良受害者的选择，并从这种不良受害者选择中恢复，而不会导致系统崩溃或中止向前进行受害者选择过程。所解决的不良受害者选择之一是从选择已删除成员的恢复以及使用不映射到同余类中的成员的LRU状态位进行恢复。当LRU受害者选择逻辑生成识别受害者的输出向量时，检查输出向量以确保它是有效向量（非空值），并且不指向已删除的成员。当输出向量无效或指向被删除成员时，LRU受害者选择逻辑被触发以重新启动受害者选择过程。

6. 发明申请

US20080028155A1 DATA PROCESSING SYSTEM AND METHOD FOR EFFICIENT COHERENCY COMMUNICATION UTILIZING COHERENCY DOMAIN INDICATORS 有权
标题翻译：数据处理系统和方法，用于有效的通信使用相关域指标
公开(公告)号：US20080028155A1
公开(公告)日：2008-01-31
申请号：US11835259
申请日：2007-08-07
申请人： JAMES FIELDS , Guy Guthrie , William Starke , Jeffrey Stuecheli
发明人： JAMES FIELDS , Guy Guthrie , William Starke , Jeffrey Stuecheli
IPC分类号： G06F12/00
CPC分类号： G06F12/0831 , G06F12/0813 , G06F12/0826
摘要： In a cache coherent data processing system including at least first and second coherency domains, a memory block is stored in a system memory in association with a domain indicator indicating whether or not the memory block is cached, if at all, only within the first coherency domain. A master in the first coherency domain determines whether or not a scope of broadcast transmission of an operation should extend beyond the first coherency domain by reference to the domain indicator stored in the cache and then performs a broadcast of the operation within the cache coherent data processing system in accordance with the determination.
摘要翻译：在包括至少第一和第二相干域的缓存相干数据处理系统中，存储器块与指示是否缓存存储器块的域指示符相关联地存储在系统存储器中，如果有的话，只有在第一一致性内域。第一相干域中的主设备通过参考存储在高速缓存中的域指示符来确定操作的广播传输的范围是否应超出第一相关域，然后在高速缓存相干数据处理中执行操作的广播系统按照确定。

7. 发明申请

US20070073919A1 Data processing system and method that permit pipelining of I/O write operations and multiple operation scopes 失效
标题翻译：允许I / O写入操作和多个操作范围的流水线的数据处理系统和方法
公开(公告)号：US20070073919A1
公开(公告)日：2007-03-29
申请号：US11226967
申请日：2005-09-15
申请人： George Daly , James Fields , Guy Guthrie , William Starke , Jeffrey Stuecheli
发明人： George Daly , James Fields , Guy Guthrie , William Starke , Jeffrey Stuecheli
IPC分类号： G06F13/28
CPC分类号： G06F12/0831 , G06F12/0811
摘要： A data processing system includes at least a first processing node having an input/output (I/O) controller and a second processing including a memory controller for a memory. The memory controller receives, in order, pipelined first and second DMA write operations from the I/O controller, where the first and second DMA write operations target first and second addresses, respectively. In response to the second DMA write operation, the memory controller establishes a state of a domain indicator associated with the second address to indicate an operation scope including the first processing node. In response to the memory controller receiving a data access request specifying the second address and having a scope excluding the first processing node, the memory controller forces the data access request to be reissued with a scope including the first processing node based upon the state of the domain indicator associated with the second address.
摘要翻译：数据处理系统至少包括具有输入/输出（I / O）控制器的第一处理节点和包括用于存储器的存储器控制器的第二处理。存储器控制器按顺序从I / O控制器接收流水线的第一和第二DMA写入操作，其中第一和第二DMA写操作分别针对第一和第二地址。响应于第二DMA写入操作，存储器控制器建立与第二地址相关联的域指示符的状态，以指示包括第一处理节点的操作范围。响应于所述存储器控制器接收到指定所述第二地址并且具有排除所述第一处理节点的范围的数据访问请求，所述存储器控制器基于所述第一处理节点的状态强迫所述数据访问请求被重新发布，所述范围包括所述第一处理节点与第二个地址关联的域指示符。

8. 发明申请

US20060271741A1 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
申请人： Leo Clark , James Fields , Guy Guthrie , William Starke , Derek Williams
发明人： Leo Clark , James Fields , Guy Guthrie , William Starke , Derek Williams
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.
摘要翻译：响应于程序代码的执行，用至少目标存储器块的目标地址初始化局部一致性域内的擦除逻辑中的控制寄存器。响应于初始化，擦除逻辑向远程一致性域中的至少一个高速缓存层级发出针对可由所述至少一个高速缓存层级缓存的目标存储器块的域指示擦除请求。响应于接收到指示目标存储器块未被缓存在远程一致性域中的一致性响应，本地一致性域中的域指示被更新以指示目标存储器块被缓存，如果完全只在局部一致性域。

9. 发明申请

US20060224833A1 Data processing system, cache system and method for issuing a request on an interconnect fabric without reference to a lower level cache based upon a tagged cache state 有权
公开(公告)号：US20060224833A1
公开(公告)日：2006-10-05
申请号：US11095734
申请日：2005-03-31
申请人： Guy Guthrie , Aaron Sawdey , William Starke , Jeffrey Stuecheli
发明人： Guy Guthrie , Aaron Sawdey , William Starke , Jeffrey Stuecheli
IPC分类号： G06F13/28
CPC分类号： G06F12/0811 , G06F12/0815 , G06F12/0831
摘要： In response to a master receiving a memory access request indicating a target address, the master accesses a first cache directory of an upper level cache of a cache hierarchy. In response to the target address being associated in the first cache directory with an entry having a valid address tag and a first invalid coherency state, the master issues a request specifying the target address on an interconnect fabric without regard to a coherency state associated with the target address in a second cache directory of a lower level cache of the cache hierarchy. In response to the target address having a second invalid coherency state with respect to the first cache directory, the master issues a request specifying the target address on an interconnect fabric after determining a coherency state associated with the target address in the second cache directory of the lower level cache of the cache hierarchy.

10. 发明申请

US20060184749A1 Reducing number of rejected snoop requests by extending time to respond to snoop request 有权
公开(公告)号：US20060184749A1
公开(公告)日：2006-08-17
申请号：US11056764
申请日：2005-02-11
申请人： Guy Guthrie , Hugh Shen , William Starke , Derek Williams
发明人： Guy Guthrie , Hugh Shen , William Starke , Derek Williams
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.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式