会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 51. 发明申请
    • System and method of re-ordering store operations within a processor
    • 在处理器内重新排序存储操作的系统和方法
    • US20060179226A1
    • 2006-08-10
    • US11054450
    • 2005-02-09
    • Guy GuthrieHugh ShenWilliam StarkeDerek Williams
    • Guy GuthrieHugh ShenWilliam StarkeDerek Williams
    • G06F12/00
    • G06F9/3834G06F9/30043G06F9/3824G06F12/0817
    • 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机器。
    • 53. 发明申请
    • Method for completing full cacheline stores with address-only bus operations
    • 完成具有仅地址总线操作的完整缓存线存储的方法
    • US20050251623A1
    • 2005-11-10
    • US10825189
    • 2004-04-15
    • Ravi ArimilliGuy GuthrieHugh ShenDerek Williams
    • Ravi ArimilliGuy GuthrieHugh ShenDerek Williams
    • G06F12/00G06F12/08
    • G06F12/0897G06F12/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机器获得写入许可之前数据进入状态时,不会检索高速缓存行的数据。
    • 55. 发明申请
    • Fault tolerant encoding of directory states for stuck bits
    • 卡位的目录状态的容错编码
    • US20070079216A1
    • 2007-04-05
    • US11225570
    • 2005-09-13
    • Robert BellGuy GuthrieWilliam Starke
    • Robert BellGuy GuthrieWilliam Starke
    • G11C29/00
    • G11C29/832G06F11/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.
    • 一种通过定义多个二进制编码来指示缺陷高速缓存状态来处理高速缓冲存储器的目录中的卡住位的方法,检测存储在目录成员中的标签中的错误(其中标签至少包括地址字段 ,状态字段和纠错字段),确定错误与目录成员的卡住位相关联,并且基于字段位置将新状态信息写入从二进制编码之一中选择的目录成员 的目录成员中的卡住位。 多个二进制编码可以包括当卡住位在地址字段中时的第一二进制编码,当卡位位于状态字段时的第二二进制编码,以及当卡位位于错误校正字段中时的第三二进制编码 。 还可以基于卡住位的值进一步选择新的状态信息,例如,对应于该卡住位的状态位从与该卡位的值匹配的新状态信息中分配一位值。
    • 56. 发明申请
    • Reducing number of rejected snoop requests by extending time to respond to snoop request
    • 通过延长响应窥探请求的时间来减少被拒绝的窥探请求数
    • US20060184746A1
    • 2006-08-17
    • US11056679
    • 2005-02-11
    • Guy GuthrieHugh ShenWilliam StarkeDerek Williams
    • Guy GuthrieHugh ShenWilliam StarkeDerek Williams
    • G06F13/28
    • G06F13/1605G06F12/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.
    • 用于减少拒绝的窥探请求数量的缓存,系统和方法。 缓存中的“停止/重新排序单元”从互连中接收窥探请求。 监听请求被输入到停止/重新排序单元的第一可用锁存器中,除非停止/重新排序单元已满,在这种情况下,新的窥探请求被发送到被配置为发送重新发送新的窥探请求的请求的第二单元。 侦听请求具有比来自处理器的请求更高的优先级,并且仲裁机制通过处理器请求选择侦听请求,除非仲裁机制另请求(“停止请求”)到停止/重新排序单元。 通过具有比处理器请求更高优先级的侦听请求,减少了被拒绝的侦听请求的数量。 通过使仲裁机制发出停顿请求,处理器不会饿死。
    • 59. 发明申请
    • System bus read data transfers with data ordering control bits
    • 系统总线使用数据排序控制位读取数据传输
    • US20050193174A1
    • 2005-09-01
    • US11041711
    • 2005-01-22
    • Ravi ArimilliVicente ChungGuy GuthrieJody Joyner
    • Ravi ArimilliVicente ChungGuy GuthrieJody Joyner
    • G06F12/08G06F12/00
    • G06F12/0831
    • A method for informing a processor of a selected order of transmission of data to the processor. The method comprises the steps of coupling system components via a data bus to the processor to effectuate data transfer, determining at the system component logic the order in which to transmit data to the processor, and issuing to the data bus a selected order bit concurrent with the data, wherein the selected order bit alerts the processor of the order and the data is transmitted in that order. In a preferred embodiment, the system component is the cache and the method may involve receiving at the cache a preference of ordering for a read address/request from the processor. The preference order logic of the cache controller or a preference order logic component evaluates the preference of ordering desired by comparing the processor preference with other preferences, including cache order preference. One preference order is selected and the data is then retrieved from a cache line of the cache in the order selected.
    • 一种用于向处理器通知所选择的数据传输顺序的处理器的方法。 该方法包括以下步骤:将系统组件经由数据总线耦合到处理器以实现数据传输,在系统组件逻辑处确定将数据发送到处理器的顺序,以及向数据总线发出与 数据,其中所选择的订单位向处理器提醒订单,并且以该顺序传送数据。 在优选实施例中,系统组件是高速缓存,并且该方法可以涉及在高速缓存处接收对来自处理器的读取地址/请求的排序的偏好。 高速缓存控制器或偏好顺序逻辑组件的偏好顺序逻辑通过将处理器偏好与其他偏好(包括高速缓存顺序偏好)进行比较来评估期望的顺序的偏好。 选择一个偏好顺序,然后以所选顺序从高速缓存的高速缓存行检索数据。