会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明申请
    • DATA PROCESSING SYSTEM AND METHOD OF DATA PROCESSING SUPPORTING TICKET-BASED OPERATION TRACKING
    • 数据处理系统和数据处理方法支持基于票单的操作跟踪
    • US20080222648A1
    • 2008-09-11
    • US12124524
    • 2008-05-21
    • LEO J. CLARKJames S. FieldsBenjiman L. GoodmanWilliam J. StarkeJeffrey A. Stuecheli
    • LEO J. CLARKJames S. FieldsBenjiman L. GoodmanWilliam J. StarkeJeffrey A. Stuecheli
    • G06F9/46
    • G06F12/0831G06F12/0897G06F12/1458
    • A data processing system includes a plurality of processing units coupled by a plurality of communication links for point-to-point communication such that at least some of the communication between multiple different ones of the processing units is transmitted via intermediate processing units among the plurality of processing units. The communication includes operations having a request and a combined response representing a system response to the request. At least each intermediate processing unit includes one or more masters that initiate first operations, a snooper that receives at least second operations initiated by at least one other of the plurality of processing units, a physical queue that stores master tags of first operations initiated by the one or more masters within that processing unit, and a ticketing mechanism that assigns to second operations observed at the intermediate processing unit a ticket number indicating an order of observation with respect to other second operations observed by the intermediate processing unit. The ticketing mechanism provides the ticket number assigned to an operation to the snooper for processing with a combined response of the operation.
    • 数据处理系统包括由多个通信链路耦合用于点对点通信的多个处理单元,使得多个处理单元中的多个不同处理单元之间的通信中的至少一些通过多个处理单元之间的中间处理单元发送 处理单位。 该通信包括具有请求的操作和表示对请求的系统响应的组合响应。 至少每个中间处理单元包括启动第一操作的一个或多个主机,至少接收由所述多个处理单元中的至少另一个处理单元发起的至少第二操作的侦听器;存储由所述多个处理单元发起的第一操作的主标签的物理队列 在该处理单元内的一个或多个主设备,以及票据机构,其分配在中间处理单元处观察到的第二操作,该票单号指示关于由中间处理单元观察到的其他第二操作的观察次序。 票务机制将分配给操作员的操作的票号提供给操作的组合响应进行处理。
    • 3. 发明授权
    • Ticket-based operation tracking
    • 基于门票的操作跟踪
    • US08139592B2
    • 2012-03-20
    • US12124524
    • 2008-05-21
    • Leo J. ClarkJames S. Fields, Jr.Benjiman L. GoodmanWilliam J. StarkeJeffrey A. Stuecheli
    • Leo J. ClarkJames S. Fields, Jr.Benjiman L. GoodmanWilliam J. StarkeJeffrey A. Stuecheli
    • H04L12/28H04L12/56G06F13/00G06F13/28H04H20/71
    • G06F12/0831G06F12/0897G06F12/1458
    • A data processing system includes a plurality of processing units coupled by a plurality of communication links for point-to-point communication such that at least some of the communication between multiple different ones of the processing units is transmitted via intermediate processing units among the plurality of processing units. The communication includes operations having a request and a combined response representing a system response to the request. At least each intermediate processing unit includes one or more masters that initiate first operations, a snooper that receives at least second operations initiated by at least one other of the plurality of processing units, a physical queue that stores master tags of first operations initiated by the one or more masters within that processing unit, and a ticketing mechanism that assigns to second operations observed at the intermediate processing unit a ticket number indicating an order of observation with respect to other second operations observed by the intermediate processing unit. The ticketing mechanism provides the ticket number assigned to an operation to the snooper for processing with a combined response of the operation.
    • 数据处理系统包括由多个通信链路耦合用于点对点通信的多个处理单元,使得多个处理单元中的多个不同处理单元之间的通信中的至少一些通过多个处理单元之间的中间处理单元发送 处理单位。 该通信包括具有请求的操作和表示对请求的系统响应的组合响应。 至少每个中间处理单元包括启动第一操作的一个或多个主机,至少接收由所述多个处理单元中的至少另一个处理单元发起的至少第二操作的侦听器;存储由所述多个处理单元发起的第一操作的主标签的物理队列 在该处理单元内的一个或多个主设备,以及票据机构,其分配在中间处理单元处观察到的第二操作,该票单号指示关于由中间处理单元观察到的其他第二操作的观察次序。 票务机制将分配给操作员的操作的票号提供给操作的组合响应进行处理。
    • 4. 发明授权
    • Protecting ownership transfer with non-uniform protection windows
    • 用不均匀的保护窗保护所有权转让
    • US07734876B2
    • 2010-06-08
    • US11560603
    • 2006-11-16
    • James S. Fields, Jr.Benjiman L. GoodmanGuy L. GuthrieWilliam J. StarkeJeffrey A. Stuecheli
    • James S. Fields, Jr.Benjiman L. GoodmanGuy L. GuthrieWilliam J. StarkeJeffrey A. Stuecheli
    • G06F13/00
    • G06F12/0833
    • In a data processing system, a plurality of agents communicate operations therebetween. Each operation includes a request and a combined response representing a system-wide response to the request. Within data storage in the data processing system, a data structure indicates a duration of a protection window extension for each of the plurality of agents. Each protection window extension is a period following receipt of a combined response during which an associated one of the plurality of agents protects transfer of coherency ownership of a data granule between agents. Each of the plurality of agents is configured with a duration of a protection window extension by reference to the data structure, and at least two of the agents have protection window extensions of differing durations. The plurality of agents thereafter employ the configured protection window extensions.
    • 在数据处理系统中,多个代理之间进行通信。 每个操作包括一个请求和组合的响应,代表对该请求的全系统响应。 在数据处理系统中的数据存储中,数据结构指示多个代理中的每一个的保护窗口扩展的持续时间。 每个保护窗口扩展是接收到组合响应之后的周期,在该周期期间,所述多个代理中的相关联的一个代理保护代理之间的数据粒子的一致性所有权的传送。 通过参考数据结构,多个代理中的每一个配置有保护窗口扩展的持续时间,并且至少两个代理具有不同持续时间的保护窗口扩展。 此后,多个代理程序采用配置的保护窗口扩展。
    • 6. 发明授权
    • Data processing system and method for predictively selecting a scope of a prefetch operation
    • 用于预测性地选择预取操作的范围的数据处理系统和方法
    • US07484042B2
    • 2009-01-27
    • US11465587
    • 2006-08-18
    • Benjiman L. GoodmanWilliam J. StarkeJeffrey A. Stuecheli
    • Benjiman L. GoodmanWilliam J. StarkeJeffrey A. Stuecheli
    • G06F13/00
    • G06F12/0862
    • A data processing system includes at least first and second coherency domains each containing at least one processing unit, an interconnect fabric coupling the first and second coherency domains, and a cache memory within the first coherency domain. The cache memory comprises a data array, a cache directory of contents of the data array, and a cache controller including a prefetch predictor. The prefetch predictor determines a predicted scope of broadcast on the interconnect fabric for a first prefetch operation having a first target address based upon a scope of a previous second prefetch operation having a different second target address. The cache controller issues the first prefetch operation on the interconnect fabric with the predicted scope.
    • 数据处理系统至少包括第一和第二相关域,每个域包含至少一个处理单元,耦合第一和第二相干域的互连结构以及第一相干域内的高速缓冲存储器。 高速缓冲存储器包括数据阵列,数据阵列的内容的高速缓存目录以及包括预取预测器的高速缓存控制器。 预取预测器基于具有不同的第二目标地址的先前的第二预取操作的范围来确定具有第一目标地址的第一预取操作的互连结构上的广播的预测范围。 高速缓存控制器以预测的范围在互连结构上发出第一个预取操作。
    • 7. 发明授权
    • Reducing number of rejected snoop requests by extending time to respond to snoop request
    • 通过延长响应窥探请求的时间来减少被拒绝的窥探请求数
    • US07340568B2
    • 2008-03-04
    • US11056740
    • 2005-02-11
    • Benjiman L. GoodmanGuy L. GuthrieWilliam J. StarkeJeffrey A. StuecheliDerek E. Williams
    • Benjiman L. GoodmanGuy L. GuthrieWilliam J. StarkeJeffrey A. StuecheliDerek E. Williams
    • G06F12/00
    • 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. Information, such as the address, of the snoop request is stored in a queue of the stall/reorder unit. The stall/reorder unit forwards the snoop request to a selector which also receives a request from a processor. An arbitration mechanism selects either the snoop request or the request from the processor. If the snoop request is denied by the arbitration mechanism, information, e.g., address, about the snoop request may be maintained in the stall/reorder unit. The request may be later resent to the selector. This process may be repeated up to “n” clock cycles. By providing the snoop request additional opportunities (n clock cycles) to be accepted by the arbitration mechanism, fewer snoop requests may ultimately be denied.
    • 用于减少拒绝的窥探请求数量的缓存,系统和方法。 缓存中的“停止/重新排序单元”从互连中接收窥探请求。 窥探请求的诸如地址的信息被存储在失速/重新排序单元的队列中。 停止/重新排序单元将窥探请求转发到也从处理器接收请求的选择器。 仲裁机制选择来自处理器的窥探请求或请求。 如果侦听请求被仲裁机制拒绝,关于窥探请求的信息(例如地址)可以被保留在停止/重新排序单元中。 请求可能会稍后重新发送到选择器。 该过程可以重复直到“n”个时钟周期。 通过提供窥探请求仲裁机制接受的额外机会(n个时钟周期),最终可能会拒绝更少的侦听请求。
    • 9. 发明授权
    • Reducing number of rejected snoop requests by extending time to respond to snoop request
    • 通过延长响应窥探请求的时间来减少被拒绝的窥探请求数
    • US07818511B2
    • 2010-10-19
    • US11847941
    • 2007-08-30
    • Benjiman L. GoodmanGuy L. GuthrieWilliam J. StarkeJeffrey A. StuecheliDerek E. Williams
    • Benjiman L. GoodmanGuy L. GuthrieWilliam J. StarkeJeffrey A. StuecheliDerek E. Williams
    • G06F12/00
    • 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. Information, such as the address, of the snoop request is stored in a queue of the stall/reorder unit. The stall/reorder unit forwards the snoop request to a selector which also receives a request from a processor. An arbitration mechanism selects either the snoop request or the request from the processor. If the snoop request is denied by the arbitration mechanism, information, e.g., address, about the snoop request may be maintained in the stall/reorder unit. The request may be later resent to the selector. This process may be repeated up to “n” clock cycles. By providing the snoop request additional opportunities (n clock cycles) to be accepted by the arbitration mechanism, fewer snoop requests may ultimately be denied.
    • 用于减少拒绝的窥探请求数量的缓存,系统和方法。 缓存中的“停止/重新排序单元”从互连中接收窥探请求。 窥探请求的诸如地址的信息被存储在失速/重新排序单元的队列中。 停止/重新排序单元将窥探请求转发到也从处理器接收请求的选择器。 仲裁机制选择来自处理器的窥探请求或请求。 如果侦听请求被仲裁机制拒绝,关于窥探请求的信息(例如地址)可以被保留在停止/重新排序单元中。 请求可能会稍后重新发送到选择器。 该过程可以重复直到“n”个时钟周期。 通过提供窥探请求仲裁机制接受的额外机会(n个时钟周期),最终可能会拒绝更少的侦听请求。
    • 10. 发明授权
    • Reducing number of rejected snoop requests by extending time to respond to snoop request
    • 通过延长响应窥探请求的时间来减少被拒绝的窥探请求数
    • US07484046B2
    • 2009-01-27
    • US11950717
    • 2007-12-05
    • Benjiman L. GoodmanGuy L. GuthrieWilliam J. StarkeJeffrey A. StuecheliDerek E. Williams
    • Benjiman L. GoodmanGuy L. GuthrieWilliam J. StarkeJeffrey A. StuecheliDerek E. Williams
    • G06F12/00
    • 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. Information, such as the address, of the snoop request is stored in a queue of the stall/reorder unit. The stall/reorder unit forwards the snoop request to a selector which also receives a request from a processor. An arbitration mechanism selects either the snoop request or the request from the processor. If the snoop request is denied by the arbitration mechanism, information, e.g., address, about the snoop request may be maintained in the stall/reorder unit. The request may be later resent to the selector. This process may be repeated up to “n” clock cycles. By providing the snoop request additional opportunities (n clock cycles) to be accepted by the arbitration mechanism, fewer snoop requests may ultimately be denied.
    • 用于减少拒绝的窥探请求数量的缓存,系统和方法。 缓存中的“停止/重新排序单元”从互连中接收窥探请求。 窥探请求的诸如地址的信息被存储在失速/重新排序单元的队列中。 停止/重新排序单元将窥探请求转发到也从处理器接收请求的选择器。 仲裁机制选择来自处理器的窥探请求或请求。 如果侦听请求被仲裁机制拒绝,关于窥探请求的信息(例如地址)可以被保留在停止/重新排序单元中。 请求可能会稍后重新发送到选择器。 该过程可以重复直到“n”个时钟周期。 通过提供窥探请求仲裁机制接受的额外机会(n个时钟周期),最终可能会拒绝更少的侦听请求。