Abstract:
Embodiments of the present disclosure provide a method for sending a message, a method for reading and notifying a message, a method for receiving a message, and an apparatus. Reading status of a message to be read is fed back, so that a user at a sending end can know in time whether the short message has already been read, which improves communication efficiency and enhances user awareness of the reading status of the message to be read.
Abstract:
A group messaging method and a device, which relate to the field of communications is described. The group messaging method is applied to a group-send management device and includes: acquiring an information parameter of an information scheduling device, generating a group-send policy according to the information parameter, and sending the group-send policy to a terminal device served by the information scheduling device. The terminal device performs group messaging according to the group-send policy. The group messaging method and the device provided in the embodiments of the present invention are used for group messaging.
Abstract:
Embodiments of the present invention relate to the field of communications technologies, and disclose a call termination method, an application processor, and a modem. In this solution, the application processor receives a hang-up instruction and sends a first message to the modem according to the hang-up instruction, where the first message is used to trigger the modem to directly terminate a call. The modem may terminate the call in a timely manner according to the first message. Therefore, a time consumed in call termination is reduced and efficiency is improved.
Abstract:
A data storage method is used to improve storage consistency of a distributed storage system. The method includes: a primary storage node performs EC coding on a to-be-stored data segment to obtain a target EC stripe; determines in a storage node group to which the primary storage node belongs, m+k target storage nodes used to store m+k target EC blocks of the target EC stripe; sends a preparation message to the target storage nodes; receives a response message sent by a target storage node; and sends an execution message to the target storage nodes to instruct the target storage nodes to write target EC blocks that are in preparation logs.
Abstract:
A data recovery method to improve storage consistency of a distributed storage system includes: receiving a recovery message from a storage node after a fault recovery of the faulty storage node; obtaining N lost erasure coding (EC) blocks of the faulty storage node through computation according to EC blocks stored by non-faulty storage nodes; sequentially sending N lost EC blocks to the faulty storage node for storage. In the process of sequentially sending the N lost EC blocks to the faulty storage node, when it is determined that for a first EC block that is to be stored by the faulty storage node, a second EC block having a same key value as the first EC block exists in the lost EC blocks, after the faulty storage node stores the second EC block, the first EC block is sent to the faulty storage node to store.
Abstract:
A data storage method is used to improve storage consistency of a distributed storage system. The method includes: a primary storage node performs EC coding on a to-be-stored data segment to obtain a target EC stripe; determines in a storage node group to which the primary storage node belongs, m+k target storage nodes used to store m+k target EC blocks of the target EC stripe; sends a preparation message to the target storage nodes; receives a response message sent by a target storage node; and sends an execution message to the target storage nodes to instruct the target storage nodes to write target EC blocks that are in preparation logs.
Abstract:
A method for sending a message, a method for reading and notifying a message, a method for receiving a message, and an apparatus are provided. Reading status of a message to be read is fed back, so that a user at a sending end can know in time whether the short message has already been read, which improves communication efficiency and enhances user awareness of the reading status of the message to be read.
Abstract:
In a data recovery method, there are a server and a plurality of storage devices each storing a copy of a data block. The server divides each copy of the data block into N segments corresponding to a sequence of N partitions. And then, the server constructs a plurality of different trial data blocks each including N segments corresponding to the sequence of N partitions. After that, the server calculates a check code for each trial data block, and continues to identify a trial data block having a check code identical to a pre-stored standard check code of the data block. At last, the server replaces at least one of the copies of the data block with the identified trial data block having the check code identical to the pre-stored standard check code.
Abstract:
A data recovery method to improve storage consistency of a distributed storage system includes: receiving a recovery message from a storage node after a fault recovery of the faulty storage node; obtaining N lost erasure coding (EC) blocks of the faulty storage node through computation according to EC blocks stored by non-faulty storage nodes; sequentially sending N lost EC blocks to the faulty storage node for storage. In the process of sequentially sending the N lost EC blocks to the faulty storage node, when it is determined that for a first EC block that is to be stored by the faulty storage node, a second EC block having a same key value as the first EC block exists in the lost EC blocks, after the faulty storage node stores the second EC block, the first EC block is sent to the faulty storage node to store.
Abstract:
A data distribution method for improving performance of a distributed storage system includes: receiving, by a data distribution apparatus, a storage instruction of a user, dividing to-be-stored data that the storage instruction instructs to store, into P data segments, determining a storage node group corresponding to each data segment, and finally distributing the data segment to a primary node in the corresponding storage node group.