PAIRED VALUE COMPARISON FOR REDUNDANT MULTI-THREADING OPERATIONS

    公开(公告)号:US20180039531A1

    公开(公告)日:2018-02-08

    申请号:US15231251

    申请日:2016-08-08

    Abstract: Techniques for performing redundant multi-threading (“RMT”) include the use of an RMT compare instruction by two program instances (“work-items”). The RMT compare instruction specifies a value from each work-item to be compared. Upon executing the RMT compare instructions, the work-items transmit the values to a hardware comparator unit. The hardware comparator unit compares the received values and performs an error action if the values do not match. The error action may include sending an error code in a return value back to the work-items that requested the comparison or emitting a trap signal. Optionally, the work-items also send addresses for comparison to the comparator unit. If the addresses and values match, then the comparator stores the value at the specified address. If either or both of the values or the addresses do not match, then the comparator performs an error action.

    COMMAND ARBITRATION FOR HIGH SPEED MEMORY INTERFACES

    公开(公告)号:US20180018291A1

    公开(公告)日:2018-01-18

    申请号:US15211815

    申请日:2016-07-15

    Abstract: In one form, a memory controller includes a command queue and an arbiter. The command queue receives and stores memory access requests. The arbiter includes a plurality of sub-arbiters for providing a corresponding plurality of sub-arbitration winners from among the memory access requests during a controller cycle, and for selecting among the plurality of sub-arbitration winners to provide a plurality of memory commands in a corresponding controller cycle. In another form, a data processing system includes a memory accessing agent for providing memory accesses requests, a memory system, and the memory controller coupled to the memory accessing agent and the memory system.

    METHOD AND APPARATUS FOR PROVIDING DISTRIBUTED CHECKPOINTING

    公开(公告)号:US20180018242A1

    公开(公告)日:2018-01-18

    申请号:US15207943

    申请日:2016-07-12

    CPC classification number: G06F11/1471 G06F2201/805 G06F2201/84

    Abstract: Methods and apparatus presented herein provide distributed checkpointing in a multi-node system, such as a network of servers in a data center. When checkpointing of application state data is needed in a node, the methods and apparatus determine whether checkpoint memory space is available in the node for checkpointing the application state data. If not enough checkpoint memory space is available in the node, the methods and apparatus request and find additional checkpoint memory space from other nodes in the system. In this manner, the methods and apparatus can checkpoint the application state data into available checkpoint memory spaces distributed among a plurality of nodes. This allows for high bandwidth and low latency checkpointing operations in the multi-node system.

    ACHIEVING BALANCED EXECUTION THROUGH RUNTIME DETECTION OF PERFORMANCE VARIATION

    公开(公告)号:US20170373955A1

    公开(公告)日:2017-12-28

    申请号:US15192764

    申请日:2016-06-24

    CPC classification number: G06F11/30 G06F9/4893 G06F2209/5019 Y02D10/24

    Abstract: Systems, apparatuses, and methods for achieving balanced execution in a multi-node cluster through runtime detection of performance variation are described. During a training phase, performance counters and an amount of time spent waiting for synchronization is monitored for a plurality of tasks for each node of the multi-node cluster. These values are utilized to generate a model which correlates the values of the performance counters to the amount of time spent waiting for synchronization. Once the model is built, the values of the performance counters are monitored for a period of time at the start of each task, and these values are input into the model. The model generates a prediction of whether a given node is on the critical path. If the given node is predicted to be on the critical path, the power allocation of the given node is increased.

    SYSTEM AND METHOD FOR PROCESSING DATA IN A COMPUTING SYSTEM

    公开(公告)号:US20170371665A1

    公开(公告)日:2017-12-28

    申请号:US15191257

    申请日:2016-06-23

    Abstract: Systems, apparatuses, and methods for adjusting group sizes to match a processor lane width are described. In early iterations of an algorithm, a processor partitions a dataset into groups of data points which are integer multiples of the processing lane width of the processor. For example, when performing a K-means clustering algorithm, the processor determines that a first plurality of data points belong to a first group during a given iteration. If the first plurality of data points is not an integer multiple of the number of processing lanes, then the processor reassigns a first number of data points from the first plurality of data points to one or more other groups. The processor then performs the next iteration with these first number of data points assigned to other groups even though the first number of data points actually meets the algorithmic criteria for belonging to the first group.

Patent Agency Ranking