Opcode Space Minimizing Architecture Utilizing Instruction Address to Indicate Upper Address Bits
    3.
    发明申请
    Opcode Space Minimizing Architecture Utilizing Instruction Address to Indicate Upper Address Bits 有权
    操作码空间最小化使用指令地址来指示上位地址的架构

    公开(公告)号:US20120084535A1

    公开(公告)日:2012-04-05

    申请号:US12894697

    申请日:2010-09-30

    IPC分类号: G06F9/30

    摘要: Due to the ever expanding number of registers and new instructions in modern microprocessor cores, the address widths present in the instruction encoding continue to widen, and fewer instruction opcodes are available, making it more difficult to add new instructions to existing architectures without resorting to inelegant tricks that have drawbacks such as source destructive operations. The disclosed invention utilizes specialized decode and address calculation hardware that concatenates a fixed number of least significant bits of the instruction address onto the upper address bits of each register address portion contained in the instruction, yielding the full register address, instead of providing the full register address widths for every register used in the instruction. This frees up valuable opcode space for other instructions and avoids compiler complexity. This aligns nicely with how most loops are unrolled in assembly language, where independent operations are near each other in memory.

    摘要翻译: 由于现代微处理器内核中的寄存器数量和新指令的数量不断增加,指令编码中存在的地址宽度不断扩大,更少的指令操作码可用,使得更难于将现有架构的新指令添加到现有的架构中,而无需使用不正当的 具有诸如源破坏性操作等缺点的技巧。 所公开的发明利用专门的解码和地址计算硬件,其将指令地址的固定数目的最低有效位连接到包含在指令中的每个寄存器地址部分的高地址位,从而产生完整寄存器地址,而不是提供完整寄存器 指令中使用的每个寄存器的地址宽度。 这释放了其他指令的有价值的操作码空间,避免了编译器的复杂性。 这很好地与汇编语言中大多数循环展开的方式保持一致,独立操作在内存中彼此靠近。

    Opcode space minimizing architecture utilizing a least significant portion of an instruction address as upper register address bits
    7.
    发明授权
    Opcode space minimizing architecture utilizing a least significant portion of an instruction address as upper register address bits 有权
    操作码空间最小化结构,利用指令地址的最低有效部分作为高位寄存器地址位

    公开(公告)号:US09075599B2

    公开(公告)日:2015-07-07

    申请号:US12894697

    申请日:2010-09-30

    IPC分类号: G06F9/345 G06F9/30 G06F9/38

    摘要: Due to the ever expanding number of registers and new instructions in modern microprocessor cores, the address widths present in the instruction encoding continue to widen, and fewer instruction opcodes are available, making it more difficult to add new instructions to existing architectures without resorting to inelegant tricks that have drawbacks such as source destructive operations. The disclosed invention utilizes specialized decode and address calculation hardware that concatenates a fixed number of least significant bits of the instruction address onto the most significant side of each register address portion contained in the instruction, yielding the full register address, instead of providing the full register address widths for every register used in the instruction. This frees up valuable opcode space for other instructions and avoids compiler complexity. This aligns nicely with how most loops are unrolled in assembly language, where independent operations are near each other in memory.

    摘要翻译: 由于现代微处理器内核中的寄存器数量和新指令的数量不断增加,指令编码中存在的地址宽度不断扩大,更少的指令操作码可用,使得更难于将现有架构的新指令添加到现有的架构中,而无需使用不正当的 具有诸如源破坏性操作等缺点的技巧。 所公开的发明利用专门的解码和地址计算硬件,其将指令地址的固定数量的最低有效位连接到包含在指令中的每个寄存器地址部分的最高有效侧,从而产生完整寄存器地址,而不是提供完整寄存器 指令中使用的每个寄存器的地址宽度。 这释放了其他指令的有价值的操作码空间,避免了编译器的复杂性。 这很好地与汇编语言中大多数循环展开的方式保持一致,独立操作在内存中彼此靠近。

    VARIABLE LATENCY MEMORY DELAY IMPLEMENTATION
    8.
    发明申请
    VARIABLE LATENCY MEMORY DELAY IMPLEMENTATION 审中-公开
    可变延迟内存延迟执行

    公开(公告)号:US20130185477A1

    公开(公告)日:2013-07-18

    申请号:US13352619

    申请日:2012-01-18

    IPC分类号: G06F12/00

    CPC分类号: G06F11/263

    摘要: A method includes receiving, from a processor, a first read request mapped including a first read request address to a first memory location of a register array and a second read request including a second read request address to a second memory location of a register array. The method includes assigning a first simulated time delay to the first read request and assigning a second simulated time delay to the second read request. The method includes, in response to a first elapsed time being equal to the first simulated time delay, outputting a first read request response including first data. The first elapsed time commences upon receipt of the first read request. The method includes, in response to a second elapsed time being equal to the second simulated time delay, outputting a second read request response including second data. The second elapsed time commences upon receipt of the second read request.

    摘要翻译: 一种方法包括从处理器接收包括第一读取请求地址的第一读取请求到寄存器阵列的第一存储器位置以及包括第二读取请求地址的第二读取请求到寄存器阵列的第二存储器位置。 该方法包括将第一模拟时间延迟分配给第一读取请求并将第二模拟时间延迟分配给第二读取请求。 该方法包括响应于第一经过时间等于第一模拟时间延迟,输出包括第一数据的第一读请求响应。 第一次经过的时间在收到第一个读取请求后开始。 该方法包括响应于第二经过时间等于第二仿真时间延迟,输出包括第二数据的第二读请求响应。 第二个经过时间在收到第二个读取请求后开始。

    Redundant Execution of Instructions in Multistage Execution Pipeline During Unused Execution Cycles
    9.
    发明申请
    Redundant Execution of Instructions in Multistage Execution Pipeline During Unused Execution Cycles 失效
    在多个执行循环中执行多级执行管道中的指令冗余执行

    公开(公告)号:US20100042813A1

    公开(公告)日:2010-02-18

    申请号:US12191331

    申请日:2008-08-14

    IPC分类号: G06F9/38

    摘要: A pipelined execution unit uses the bubbles that occur during execution to selectively repeat operations performed in one or more stages of a multistage execution pipeline to verify the results of such operations during otherwise unused execution cycles for the execution pipeline. Whenever a bubble follows a particular instruction within an execution pipeline, the result of an operation that is performed for that instruction by a particular stage of the execution pipeline may be stored, and the operation may be repeated by the stage in a subsequent execution cycle in which no productive operation would otherwise be performed due to the presence of the bubble. The results of the operations may then be compared and used to either verify the original result or identify a potential error in the execution of the instruction.

    摘要翻译: 流水线执行单元使用在执行期间发生的气泡来选择性地重复在多级执行流水线的一个或多个阶段中执行的操作,以在执行流水线的另外未使用的执行周期期间验证这种操作的结果。 每当气泡遵循执行流水线中的特定指令时,可以存储由执行流水线的特定阶段对该指令执行的操作的结果,并且可以在后续执行周期中的阶段重复该操作, 否则由于存在气泡而不能进行生产操作。 然后可以将操作的结果进行比较并用于验证原始结果或识别指令执行中的潜在错误。

    Data Dependent Instruction Decode
    10.
    发明申请
    Data Dependent Instruction Decode 有权
    数据相关指令解码

    公开(公告)号:US20100042812A1

    公开(公告)日:2010-02-18

    申请号:US12191337

    申请日:2008-08-14

    IPC分类号: G06F9/30 G06F9/302

    CPC分类号: G06F9/30181 G06F9/3016

    摘要: A circuit arrangement and method support data dependent instruction decoding, whereby instructions are decoded, in part, using decode data that is stored in operand registers identified by such instructions. An instruction may include an opcode and at least one operand that identifies a register. During execution of the instruction, the instruction is first decoded using the opcode, and then decode data stored in the operand register is retrieved and used to further decode the instruction, e.g., to select from among a plurality of operations or instruction types associated with the same opcode.

    摘要翻译: 一种电路装置和方法支持数据相关指令解码,其中部分地使用存储在由这些指令识别的操作数寄存器中的解码数据来解码指令。 指令可以包括操作码和标识寄存器的至少一个操作数。 在执行指令期间,首先使用操作码解码指令,然后检索存储在操作数寄存器中的解码数据,并用于进一步解码指令,例如,从多个操作或与该指令相关联的指令类型中进行选择 相同的操作码