会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • System and Method for a Group Priority Issue Schema for a Cascaded Pipeline
    • 用于级联管道的组优先级问题模式的系统和方法
    • US20090210665A1
    • 2009-08-20
    • US12033038
    • 2008-02-19
    • Jeffrey P. BradfordDavid A. Luick
    • Jeffrey P. BradfordDavid A. Luick
    • G06F9/312
    • G06F9/3814G06F9/382G06F9/3824G06F9/3828G06F9/3838G06F9/3853G06F9/3869G06F9/3889
    • The present invention provides system and method for a group priority issue schema for a cascaded pipeline. The system includes a cascaded delayed execution pipeline unit having a plurality of execution pipelines that execute instructions in a common issue group in a delayed manner relative to each other. The system further includes circuitry configured to receiving an issue group of instructions, reordering the issue group of instructions using instruction type priority, and executing the reordered issue group of instructions in the cascaded delayed execution pipeline unit. The method, among others, can be broadly summarized by the following steps: receiving an issue group of instructions, reordering the issue group of instructions using instruction type priority, and executing the reordered issue group of instructions in the cascaded delayed execution pipeline unit.
    • 本发明提供了用于级联管道的组优先级问题模式的系统和方法。 该系统包括具有多个执行流水线的级联延迟执行流水线单元,该多个执行流水线以相对于彼此的延迟方式在公共问题组中执行指令。 该系统还包括被配置为接收问题组指令,使用指令类型优先级重新排序指令类型的指令的电路,以及在级联延迟执行流水线单元中执行重新排序的指令组。 该方法可以通过以下步骤大致概括:接收问题组指令,使用指令类型优先级重新排序指令的使用组,以及在级联延迟执行流水线单元中执行重新排序的指令组。
    • 4. 发明授权
    • Pipeline having bifurcated global branch history buffer for indexing branch history table per instruction fetch group
    • 管道具有分叉全局分支历史缓冲区,用于每个指令获取组索引分支历史表
    • US07454602B2
    • 2008-11-18
    • US11013148
    • 2004-12-15
    • Chris M. AbernathyJeffrey P. BradfordJason N. DaleTimothy H. Heil
    • Chris M. AbernathyJeffrey P. BradfordJason N. DaleTimothy H. Heil
    • G06F7/38G06F9/00G06F9/44G06F15/00
    • G06F9/3806G06F9/3848
    • A method and apparatus for updating global branch history information are disclosed. A dynamic branch predictor within a data processing system includes a global branch history (GBH) buffer and a branch history table. The GBH buffer contains GBH information of a group of the most recent branch instructions. The branch history table includes multiple entries, each entry is associated with one or more branch instructions. The GBH information from the GBH buffer can be used to index into the branch history table to obtain a branch prediction signal. In response to a fetch group of instructions, a fixed number of GBH bits is shifted into the GBH buffer. The number of GBH bits is the same regardless of the number of branch instructions within the fetch group of instructions. In addition, there is a unique bit pattern associated with the case of no taken branch in the fetch group, regardless of the number of not-taken branches of even if there are any branches in the fetch group.
    • 公开了一种用于更新全局分支历史信息的方法和装置。 数据处理系统中的动态分支预测器包括全局分支历史(GBH)缓冲区和分支历史表。 GBH缓冲区包含一组最新分支指令的GBH信息。 分支历史表包括多个条目,每个条目与一个或多个分支指令相关联。 来自GBH缓冲器的GBH信息可以用于索引到分支历史表中以获得分支预测信号。 响应于取指令组,固定数量的GBH位被移入GBH缓冲器。 无论读取指令组中的分支指令数如何,GBH位数都是相同的。 另外,即使在取出组中有任何分支,也不管抽取分支的数目如何,与获取组中没有分支的情况相关联的唯一位模式。
    • 5. 发明授权
    • System and method for a group priority issue schema for a cascaded pipeline
    • 用于级联管道的组优先级问题模式的系统和方法
    • US08108654B2
    • 2012-01-31
    • US12033038
    • 2008-02-19
    • Jeffrey P. BradfordDavid A. Luick
    • Jeffrey P. BradfordDavid A. Luick
    • G06F9/40
    • G06F9/3814G06F9/382G06F9/3824G06F9/3828G06F9/3838G06F9/3853G06F9/3869G06F9/3889
    • The present invention provides system and method for a group priority issue schema for a cascaded pipeline. The system includes a cascaded delayed execution pipeline unit having a plurality of execution pipelines that execute instructions in a common issue group in a delayed manner relative to each other. The system further includes circuitry configured to receiving an issue group of instructions, reordering the issue group of instructions using instruction type priority, and executing the reordered issue group of instructions in the cascaded delayed execution pipeline unit. The method, among others, can be broadly summarized by the following steps: receiving an issue group of instructions, reordering the issue group of instructions using instruction type priority, and executing the reordered issue group of instructions in the cascaded delayed execution pipeline unit.
    • 本发明提供了用于级联管道的组优先级问题模式的系统和方法。 该系统包括具有多个执行流水线的级联延迟执行流水线单元,该多个执行流水线以相对于彼此的延迟方式在公共问题组中执行指令。 该系统还包括被配置为接收问题组指令,使用指令类型优先级重新排序指令类型的指令的电路,以及在级联延迟执行流水线单元中执行重新排序的指令组。 该方法可以通过以下步骤大致概括:接收问题组指令,使用指令类型优先级重新排序指令的使用组,以及在级联延迟执行流水线单元中执行重新排序的指令组。
    • 8. 发明授权
    • Active flow management with hysteresis
    • 主动流量管理带滞后
    • US07453798B2
    • 2008-11-18
    • US10782617
    • 2004-02-19
    • Jeffrey P. BradfordGordon T. DavisDongming HwangClark D. JeffriesSrinivasan RamaniKartik SudeepKen V. Vu
    • Jeffrey P. BradfordGordon T. DavisDongming HwangClark D. JeffriesSrinivasan RamaniKartik SudeepKen V. Vu
    • H04L12/00
    • H04L47/10H04L47/29H04L47/323
    • The present invention provides for a computer network method and system that applies “hysteresis” to an active queue management algorithm. If a queue is at a level below a certain low threshold and a burst of packets arrives at a network node, then the probability of dropping the initial packets in the burst is recalculated, but the packets are not dropped. However, if the queue level crosses beyond a hysteresis threshold, then packets are discarded pursuant to a drop probability.Also, according to the present invention, queue level may be decreased until it becomes less than the hysteresis threshold, with packets dropped per the drop probability until the queue level decreases to at least a low threshold. In one embodiment, an adaptive algorithm is also provided to adjust the transmit probability for each flow together with hysteresis to increase the packet transmit rates to absorb bursty traffic.
    • 本发明提供一种向活动队列管理算法应用“迟滞”的计算机网络方法和系统。 如果队列处于低于某个低阈值的水平,并且一​​群数据包到达网络节点,则重新计算突发中丢弃初始数据包的概率,但不会丢弃数据包。 然而,如果队列级别超过滞后阈值,则根据丢弃概率丢弃数据包。 此外,根据本发明,可以减少队列级别,直到其变得小于滞后阈值,其中每个丢弃概率的分组丢弃,直到队列级别降低到至少低阈值。 在一个实施例中,还提供自适应算法来调整每个流的发送概率以及迟滞以增加分组传输速率以吸收突发业务。