Abstract: A data processing system includes an array of reconfigurable units and a compiler configured to generate a pipeline of n computational nodes related to a dataflow graph, interleaved between n+1 buffers on the array of reconfigurable units. Each computational node is coupled to perform calculations based on data received from an immediately preceding buffer of the n+1 buffers and store results of the calculations into an immediately following buffer of the n+1 buffers after a latency. The compiler is further configured to remove a buffer of the n+1 buffers from the pipeline based on a comparison of the latencies of the computational nodes. A corresponding method is also disclosed herein.

Abstract: Embodiments of the present application disclose a method, device and storage medium for pushing information during a call. The method for pushing information during a call includes: obtaining a recommendation information group pre-uploaded to a server by a peer user before the call is answered or hung up; determining a recommendation information category to be recommended according to a real-time state of a mobile terminal of a local user; and selecting recommendation information for recommending from the recommendation information group according to the recommendation information category. By means of the method, device and storage medium for pushing information during a call provided in the embodiments of the present application, the information recommending forms during a call are diversified.

Abstract: A system that includes a plurality of nodes configured to execute storage transactions. The nodes include a first node and a plurality of other nodes. The storage transactions are grouped into transaction sets that are to be executed in a predetermined order that ensures that dependencies between the transactions are observed. A cluster sequencer that resides on the first node is configured to increment a sequence number that identifies an active transaction set of the transaction sets and send the sequence number from the first node to the plurality of other nodes. Upon receipt of the sequence number, each one of the plurality of other nodes begins executing the transactions of the active transaction set without waiting for confirmation that all of the plurality of other nodes have the same sequence number.

Abstract: Each node in a clustered array is the owner of a set of zero logical disks (LDs). Thinly-provisioned VVs (TPVVs) are partitioned so each is mapped to a group of zero LDs from different sets of zero LDs. When there is a change in ownership, the affected zero LDs are switched one at a time so only a group of the TPVVs is affected each time.

Abstract: Each node in a clustered array is the owner of a set of zero logical disks (LDs). Thinly-provisioned VVs (TPVVs) are partitioned so each is mapped to a group of zero LDs from different sets of zero LDs. When there is a change in ownership, the affected zero LDs are switched one at a time so only a group of the TPVVs is affected each time.

Abstract: A system and method for processing data includes coupling circuitry for connecting a system to a power line and receiving data from the power line, packet detection circuitry for detecting synch mark in the data, and a processor for processing data upon detecting a synch mark.