MEMORY FAULT SUPPRESSION VIA RE-EXECUTION AND HARDWARE FSM
    31.
    发明申请
    MEMORY FAULT SUPPRESSION VIA RE-EXECUTION AND HARDWARE FSM 有权
    通过重新执行和硬件FSM的内存故障抑制

    公开(公告)号:US20160179632A1

    公开(公告)日:2016-06-23

    申请号:US14581859

    申请日:2014-12-23

    Abstract: Exemplary aspects are directed toward resolving fault suppression in hardware, which at the same time does not incur a performance hit. For example, when multiple instructions are executing simultaneously, a mask can specify which elements need not be executed. If the mask is disabled, those elements do not need to be executed. A determination is then made as to whether a fault happens in one of the elements that have been disabled. If there is a fault in one of the elements that has been disabled, a state machine re-fetches the instructions in a special mode. More specifically, the state machine determines if the fault is on a disabled element, and if the fault is on a disabled element, then the state machine specifies that the fault should be ignored. If during the first execution there was no mask, if there is an error present during execution, then the element is re-run with the mask to see if the error is a “real” fault.

    Abstract translation: 示例性方面涉及解决在硬件中的故障抑制,其同时不会导致性能下降。 例如,当多个指令同时执行时,掩码可以指定不需要执行哪些元素。 如果禁用掩码,则不需要执行这些元素。 然后确定在已经被禁用的元素之一中是否发生故障。 如果其中一个元素中存在故障,则状态机将以特殊模式重新读取指令。 更具体地说,状态机确定故障是否在禁用元件上,如果故障位于禁用元件上,则状态机指定故障应被忽略。 如果在第一次执行期间没有掩码,如果在执行期间存在错误,则使用掩码重新运行该元素,以查看错误是否为“真实”错误。

    INSTRUCTIONS FOR VECTOR MULTIPLICATION OF UNSIGNED WORDS WITH ROUNDING

    公开(公告)号:US20220318009A1

    公开(公告)日:2022-10-06

    申请号:US17573556

    申请日:2022-01-11

    Abstract: Disclosed embodiments relate to executing a vector multiplication instruction. In one example, a processor includes fetch circuitry to fetch the vector multiplication instruction having fields for an opcode, first and second source identifiers, and a destination identifier, decode circuitry to decode the fetched instruction, execution circuitry to, on each of a plurality of corresponding pairs of fixed-sized elements of the identified first and second sources, execute the decoded instruction to generate a double-sized product of each pair of fixed-sized elements, the double-sized product being represented by at least twice a number of bits of the fixed size, and generate an unsigned fixed-sized result by rounding the most significant fixed-sized portion of the double-sized product to fit into the identified destination.

Patent Agency Ranking