会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • Representing loop branches in a branch history register with multiple bits
    • 在多个位的分支历史寄存器中表示循环分支
    • US20070220239A1
    • 2007-09-20
    • US11378712
    • 2006-03-17
    • James DieffenderferBohuslav Rychlik
    • James DieffenderferBohuslav Rychlik
    • G06F15/00
    • G06F9/3848
    • In response to a property of a conditional branch instruction associated with a loop, such as a property indicating that the branch is a loop-ending branch, a count of the number of iterations of the loop is maintained, and a multi-bit value indicative of the loop iteration count is stored in a Branch History Register (BHR). In one embodiment, the multi-bit value may comprise the actual loop count, in which case the number of bits is variable. In another embodiment, the number of bits is fixed (e.g., two) and loop iteration counts are mapped to one of a fixed number of multi-bit values (e.g., four) by comparison to thresholds. Separate iteration counts may be maintained for nested loops, and a multi-bit value stored in the BHR may indicate a loop iteration count of only an inner loop, only the outer loop, or both.
    • 响应于与循环相关联的条件转移指令的属性,例如指示分支是循环结束分支的属性,维持循环的迭代次数的计数,并且指示多位值 循环迭代计数存储在分支历史记录寄存器(BHR)中。 在一个实施例中,多比特值可以包括实际循环计数,在这种情况下,比特数是可变的。 在另一个实施例中,比特数是固定的(例如,两个),并且与阈值相比较,循环迭代计数被映射到固定数量的多比特值(例如,四)中的一个。 对于嵌套循环可以保持单独的迭代计数,并且存储在BHR中的多位值可能仅表示内部循环,仅外部循环或两者的循环迭代计数。
    • 2. 发明申请
    • Translation lookaside buffer manipulation
    • 翻译后备缓冲操作
    • US20070174584A1
    • 2007-07-26
    • US11336264
    • 2006-01-20
    • Brian KopecVictor AugsburgJames DieffenderferJeffrey BridgesThomas Sartorius
    • Brian KopecVictor AugsburgJames DieffenderferJeffrey BridgesThomas Sartorius
    • G06F12/00
    • G06F9/3861G06F12/1027
    • A processor having a multistage pipeline includes a TLB and a TLB controller. In response to a TLB miss signal, the TLB controller initiates a TLB reload, requesting address translation information from either a memory or a higher-level TLB, and placing that information into the TLB. The processor flushes the instruction having the missing virtual address, and refetches the instruction, resulting in re-insertion of the instruction at an initial stage of the pipeline above the TLB access point. The initiation of the TLB reload, and the flush/refetch of the instruction, are performed substantially in parallel, and without immediately stalling the pipeline. The refetched instruction is held at a point in the pipeline above the TLB access point until the TLB reload is complete, so that the refetched instruction generates a “hit” in the TLB upon its next access.
    • 具有多级流水线的处理器包括TLB和TLB控制器。 响应于TLB未命中信号,TLB控制器启动TLB重新加载,从存储器或更高级TLB请求地址转换信息,并将该信息放入TLB。 处理器刷新具有缺失的虚拟地址的指令,并且重新指示该指令,从而导致在TLB接入点上方的管线的初始阶段重新插入该指令。 TLB重新启动的启动以及指令的刷新/刷新基本上并行执行,并且不会立即停止管道。 重写指令在TLB接入点上方的管道中保持一段时间,直到TLB重新加载完成,这样,重写指令在下一次访问时就会在TLB中产生一个“命中”。
    • 4. 发明申请
    • Method and apparatus for managing a link return stack
    • 用于管理链路返回栈的方法和装置
    • US20060294346A1
    • 2006-12-28
    • US11165268
    • 2005-06-22
    • Brian StempelJames DieffenderferThomas SartoriusRodney Smith
    • Brian StempelJames DieffenderferThomas SartoriusRodney Smith
    • G06F15/00
    • G06F9/3842G06F9/30054G06F9/3806G06F9/3861
    • In one or more embodiments, a processor includes a link return stack circuit used for storing branch return addresses, wherein a link return stack controller is configured to determine that one or more entries in the link return stack are invalid as being dependent on a mispredicted branch, and to reset the link return stack to a valid remaining entry, if any. In this manner, branch mispredictions cause dependent entries in the link return stack to be flushed from the link return stack, or otherwise invalidated, while preserving the remaining valid entries, if any, in the link return stack. In at least one embodiment, a branch information queue used for tracking predicted branches is configured to store a marker indicating whether a predicted branch has an associated entry in the link return stack, and it may store an index value identifying the specific, corresponding entry in the link return stack.
    • 在一个或多个实施例中,处理器包括用于存储分支返回地址的链路返回堆栈电路,其中,链路返回栈控制器被配置为确定链路返回栈中的一个或多个条目是无效的,这取决于错误预测的分支 ,并将链接返回堆栈重置为有效的剩余条目(如果有)。 以这种方式,分支错误预测会导致链接返回堆栈中的相关条目从链接返回堆栈刷新,否则无效,同时保留链接返回堆栈中的剩余有效条目(如果有的话)。 在至少一个实施例中,用于跟踪预测分支的分支信息队列被配置为存储指示预测分支是否具有链接返回栈中的相关联条目的标记,并且其可以存储标识特定相应条目的索引值 链接返回堆栈。
    • 6. 发明申请
    • Method and apparatus for predicting branch instructions
    • 用于预测分支指令的方法和装置
    • US20060277397A1
    • 2006-12-07
    • US11144206
    • 2005-06-02
    • Thomas SartoriusBrian StempelJeffrey BridgesJames DieffenderferRodney Smith
    • Thomas SartoriusBrian StempelJeffrey BridgesJames DieffenderferRodney Smith
    • G06F9/44
    • G06F9/3844
    • A microprocessor includes two branch history tables, and is configured to use a first one of the branch history tables for predicting branch instructions that are hits in a branch target cache, and to use a second one of the branch history tables for predicting branch instructions that are misses in the branch target cache. As such, the first branch history table is configured to have an access speed matched to that of the branch target cache, so that its prediction information is timely available relative to branch target cache hit detection, which may happen early in the microprocessor's instruction pipeline. The second branch history table thus need only be as fast as is required for providing timely prediction information in association with recognizing branch target cache misses as branch instructions, such as at the instruction decode stage(s) of the instruction pipeline.
    • 微处理器包括两个分支历史表,并且被配置为使用第一个分支历史表来预测分支目标高速缓存中的命中的分支指令,并且使用第二个分支历史表来预测分支指令, 在分支目标缓存中丢失。 因此,第一分支历史表被配置为具有与分支目标高速缓存的访问速度匹配的访问速度,使得其预测信息相对于可能在微处理器的指令流水线的早期发生的分支目标高速缓存命中检测而及时可用。 因此,第二分支历史表仅需要与将识别分支目标高速缓存未命中作为分支指令(例如在指令流水线的指令解码阶段)相关联地提供及时的预测信息所需的速度。
    • 7. 发明申请
    • Retry cancellation mechanism to enhance system performance
    • 重试取消机制,提升系统性能
    • US20060253662A1
    • 2006-11-09
    • US11121121
    • 2005-05-03
    • Brian BassJames DieffenderferThuong Truong
    • Brian BassJames DieffenderferThuong Truong
    • G06F13/00G06F12/00
    • G06F12/0831G06F12/0813
    • A method, an apparatus, and a computer program are provided for a retry cancellation mechanism to enhance system performance when a cache is missed or during direct memory access in a multi-processor system. In a multi-processor system with a number of independent nodes, the nodes must be able to request data that resides in memory locations on other nodes. The nodes search their memory caches for the requested data and provide a reply. The dedicated node arbitrates these replies and informs the nodes how to proceed. This invention enhances system performance by enabling the transfer of the requested data if an intervention reply is received by the dedicated node, while ignoring any retry replies. An intervention reply signifies that the modified data is within the node's memory cache and therefore, any retries by other nodes can be ignored.
    • 提供了一种用于重试取消机制的方法,装置和计算机程序,以便在多处理器系统中,在高速缓存错过时或在直接存储器访问期间增强系统性能。 在具有多个独立节点的多处理器系统中,节点必须能够请求位于其他节点上的存储器位置的数据。 节点搜索其内存缓存以获取所请求的数据,并提供答复。 专用节点仲裁这些应答,并通知节点如何继续。 本发明通过在忽略任何重试应答的同时,如果专用节点接收到干预应答,则能够传送所请求的数据来增强系统性能。 干预回复表示修改后的数据位于节点的内存缓存内,因此可以忽略其他节点的任何重试。