Efficient implementation of branch intensive algorithms in VLIW and superscalar processors
    1.
    发明授权
    Efficient implementation of branch intensive algorithms in VLIW and superscalar processors 有权
    在VLIW和超标量处理器中有效实施分支密集型算法

    公开(公告)号:US08019979B2

    公开(公告)日:2011-09-13

    申请号:US11854003

    申请日:2007-09-12

    IPC分类号: G06F9/34 G06F9/40

    摘要: An apparatus for implementing branch intensive algorithms is disclosed. The apparatus includes a processor containing a plurality of ALUs and a plurality of result registers. Each result register has a guard input which allows the ALU to write a result to the register upon receipt of a selection signal at the guard input. A lookup table is dynamically programmed with logic to implement an upcoming branching portion of program code. Upon evaluation of the branch conditions of the branching portion of code, the lookup table outputs a selection signal for writing the correct results of the branching portion of code based on the evaluation of the branch condition statements and the truth table programmed into the lookup table to the result register.

    摘要翻译: 公开了一种实现分支密集算法的装置。 该装置包括包含多个ALU和多个结果寄存器的处理器。 每个结果寄存器具有保护输入,允许ALU在接收到保护输入端的选择信号时将结果写入寄存器。 用逻辑动态编程查找表以实现即将到来的程序代码的分支部分。 在对代码的分支部分的分支条件进行评估时,查找表基于分配条件语句和编入查找表中的真值表的评估输出用于写入代码的分支部分的正确结果的选择信号 结果寄存器。

    EFFICIENT IMPLEMENTATION OF BRANCH INTENSIVE ALGORITHMS IN VLIW AND SUPERSCALAR PROCESSORS
    2.
    发明申请
    EFFICIENT IMPLEMENTATION OF BRANCH INTENSIVE ALGORITHMS IN VLIW AND SUPERSCALAR PROCESSORS 有权
    VLIW和超级处理器中分支强度算法的有效实现

    公开(公告)号:US20090070567A1

    公开(公告)日:2009-03-12

    申请号:US11854003

    申请日:2007-09-12

    IPC分类号: G06F9/38

    摘要: An apparatus for implementing branch intensive algorithms is disclosed. The apparatus includes a processor containing a plurality of ALUs and a plurality of result registers. Each result register has a guard input which allows the ALU to write a result to the register upon receipt of a selection signal at the guard input. A lookup table is dynamically programmed with logic to implement an upcoming branching portion of program code. Upon evaluation of the branch conditions of the branching portion of code, the lookup table outputs a selection signal for writing the correct results of the branching portion of code based on the evaluation of the branch condition statements and the truth table programmed into the lookup table to the result register.

    摘要翻译: 公开了一种实现分支密集算法的装置。 该装置包括包含多个ALU和多个结果寄存器的处理器。 每个结果寄存器具有保护输入,允许ALU在接收到保护输入端的选择信号时将结果写入寄存器。 用逻辑动态编程查找表以实现即将到来的程序代码的分支部分。 在对代码的分支部分的分支条件进行评估时,查找表基于分配条件语句和编入查找表中的真值表的评估输出用于写入代码的分支部分的正确结果的选择信号 结果寄存器。