会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 21. 发明授权
    • Methods and apparatus to insure correct predecode
    • 确保正确预解码的方法和装置
    • US07376815B2
    • 2008-05-20
    • US11066957
    • 2005-02-25
    • Rodney Wayne SmithJames Norris DieffenderferJeffrey Todd BridgesThomas Andrew Sartorius
    • Rodney Wayne SmithJames Norris DieffenderferJeffrey Todd BridgesThomas Andrew Sartorius
    • G06F9/30
    • G06F9/30149G06F8/447G06F9/382
    • Techniques for ensuring a synchronized predecoding of an instruction string are disclosed. The instruction string contains instructions from a variable length instruction set and embedded data. One technique includes defining a granule to be equal to the smallest length instruction in the instruction set and defining the number of granules that compose the longest length instruction in the instruction set to be MAX. The technique further includes determining the end of an embedded data segment, when a program is compiled or assembled into the instruction string and inserting a padding of length, MAX−1, into the instruction string to the end of the embedded data. Upon predecoding of the padded instruction string, a predecoder maintains synchronization with the instructions in the padded instruction string even if embedded data is coincidentally encoded to resemble an existing instruction in the variable length instruction set.
    • 公开了用于确保指令串的同步预解码的技术。 指令串包含来自可变长度指令集和嵌入数据的指令。 一种技术包括定义一个等于指令集中最小长度指令的粒子,并将构成指令集中最长指令的粒子数定义为MAX。 该技术还包括当程序被编译或组装成指令串并将长度为MAX-1的填充插入到嵌入数据的结尾的指令串中时,确定嵌入数据段的结束。 在预编译填充指令串时,即使嵌入数据被巧合地编码成类似于可变长度指令集中的现有指令,预解码器也保持与填充指令串中的指令的同步。
    • 22. 发明授权
    • Link stack repair of erroneous speculative update
    • 链接堆栈修复错误的推测更新
    • US08438371B2
    • 2013-05-07
    • US13108227
    • 2011-05-16
    • James Norris DieffenderferBrian Michael StempelRodney Wayne Smith
    • James Norris DieffenderferBrian Michael StempelRodney Wayne Smith
    • G06F9/30
    • G06F9/3842G06F9/3806G06F9/3861
    • Whenever a link address is written to the link stack, the prior value of the link stack entry is saved, and is restored to the link stack after a link stack push operation is speculatively executed following a mispredicted branch. This condition is detected by maintaining a count of the total number of uncommitted link stack write instructions in the pipeline, and a count of the number of uncommitted link stack write instructions ahead of each branch instruction. When a branch is evaluated and determined to have been mispredicted, the count associated with it is compared to the total count. A discrepancy indicates a link stack write instruction was speculatively issued into the pipeline after the mispredicted branch instruction, and pushed a link address onto the link stack. The prior link address is restored to the link stack from the link stack restore buffer.
    • 每当链接地址被写入链接堆栈时,链接堆栈条目的先前值被保存,并且在错误预测的分支之后推测地执行链路堆叠推送操作之后被还原到链路栈。 通过维持流水线中未提交的链路堆栈写入指令的总数的计数以及每个分支指令之前的未提交的链路栈写入指令的数量的计数来检测该条件。 当分支被评估并确定为被误判时,将与之相关联的计数与总计数进行比较。 一个差异表示在错误预测的分支指令之后推测发布了一个链接堆栈写入指令,并将链路地址推送到链路堆栈上。 链路堆栈恢复缓冲区中的链路栈恢复到先前的链路地址。
    • 27. 发明申请
    • Sliding-Window, Block-Based Branch Target Address Cache
    • 滑动窗口,基于块的分支目标地址缓存
    • US20070283134A1
    • 2007-12-06
    • US11422186
    • 2006-06-05
    • Rodney Wayne SmithJames Norris DieffenderferThomas Andrew SartoriusBrian Michael Stempel
    • Rodney Wayne SmithJames Norris DieffenderferThomas Andrew SartoriusBrian Michael Stempel
    • G06F9/00
    • G06F9/3806G06F9/3836G06F9/3844
    • A sliding-window, block-based Branch Target Address Cache (BTAC) comprises a plurality of entries, each entry associated with a block of instructions containing at least one branch instruction having been evaluated taken, and having a tag associated with the address of the first instruction in the block. The blocks each correspond to a group of instructions fetched from memory, such as an I-cache. Where a branch instruction is included in two or more fetch groups, it is also included in two or more instruction blocks associated with BTAC entries. The sliding-window, block-based BTAC allows for storing the Branch Target Address (BTA) of two or more taken branch instructions that fall in the same instruction block, without providing for multiple BTA storage space in each BTAC entry, by storing BTAC entries associated with different instruction blocks, each containing at least one of the taken branch instructions.
    • 滑动窗口,基于块的分支目标地址高速缓存(BTAC)包括多个条目,每个条目与包含已被评估的至少一个分支指令的指令块相关联,并且具有与该地址相关联的标签 第一个指令在块中。 这些块各自对应于从存储器获取的一组指令,例如I缓存。 在两个或更多个取出组中包含分支指令的情况下,还包括在与BTAC条目相关联的两个或多个指令块中。 滑动窗口,基于块的BTAC允许存储落在同一指令块中的两个或更多个采取的分支指令的分支目标地址(BTA),而不需要在每个BTAC条目中提供多个BTA存储空间,通过存储BTAC条目 与不同的指令块相关联,每个指令块包含至少一个采取的分支指令。