Abstract: A method describes that a lost first block in a first stripe is directly reconstructed based on a first result obtained from a target quantity of storage devices, so that there is no need to read an unlost block in the first stripe. The first block may be reconstructed provided that the target quantity of first results are obtained. An amount of data of the first result is less than that of the unlost block in the first stripe. Therefore, a data transmission process occupies less network bandwidth, and this improves block reconstruction performance.

Abstract: A method and apparatus for determining stripe consistency, including an operation node that obtains n groups of CRC data blocks corresponding to a target stripe, where the target stripe includes n first data blocks, the n first data blocks include k original data blocks and m EC data blocks of the k original data blocks, the n groups of CRC data blocks are respective CRC data blocks of n groups of second data blocks, one group of second data blocks includes m transformation results obtained by performing m times of EC transformation on one first data block, both k and m are positive integers, and n=m+k.

Abstract: A data prefetching method includes a computing node obtaining information about accessing a storage node by a first application in a preset time period. The computing node determines information about prefetch data based on the access information. The computing node determines, based on the information about the prefetch data, a cache node prefetching the prefetch data, and generates a prefetch request for prefetching the prefetch data. The computing node sends the prefetch request to the cache node. The cache node performs a prefetching operation on the prefetch data in response to the prefetch request.

Abstract: A data processing method is provided. The method includes: obtaining a parameter related to performance of a memory of a storage node, adjusting an aggregation policy based on the parameter, aggregating a first input output IO request in the memory into a second IO request based on an adjusted aggregation policy, and performing persistent storage on data corresponding to the second IO request.

Abstract: The present invention relates to an isoquinolone compound and a use thereof. Specifically, the present invention provides a 4-H pyrimido[6,1-a]isoquinolin-4-one compound represented by formula I or a pharmaceutically acceptable salt thereof, or a stereoisomer, rotamer, or tautomer thereof, wherein R1, R2, E1, E2, ring Cy, m, and n are defined as the present text.

Abstract: A horizontal federated Gradient Boosting Decision Tree optimization method based on a random greedy algorithm includes the following steps: the coordinator setting relevant parameters of a Gradient Boosting Decision Tree model, and sending them to each participant p_i; each participant segmenting the data set of a current node according to a segmentation feature f and a segmentation value v, and distributing the new segmentation data to child nodes. The supported horizontal federated learning includes participants and coordinators, wherein the participants have local data, the coordinators do not have any data, and the center for information aggregation of participants; participants calculate histograms separately and send them to the coordinators; after summarizing all histogram information, the coordinators find the optimal segmentation points according to the greedy algorithm, and then share them with respective participants to facilitate work with internal algorithms.

Abstract: A method and apparatus for determining stripe consistency, including an operation node that obtains n groups of CRC data blocks corresponding to a target stripe, where the target stripe includes n first data blocks, the n first data blocks include k original data blocks and m EC data blocks of the k original data blocks, the n groups of CRC data blocks are respective CRC data blocks of n groups of second data blocks, one group of second data blocks includes m transformation results obtained by performing m times of EC transformation on one first data block, both k and m are positive integers, and n=m+k.

Abstract: A method for obtaining a storage system capacity is provided. An available capacity that is of a storage system and that is associated with each stripe length is obtained based on an obtained stripe length that can be effectively configured. Therefore, an available capacity of a system is optimally selected.

Abstract: The present disclosure discloses a data reconstruction method and apparatus, a computer device, and a storage medium and system, and pertains to the field of data storage technologies. According to the method, a lost first block in a first stripe is directly reconstructed based on a first result obtained from a target quantity of storage devices, so that there is no need to read an unlost block in the first stripe. The first block may be reconstructed provided that the target quantity of first results are obtained. An amount of data of the first result is less than that of the unlost block in the first stripe. Therefore, a data transmission process occupies less network bandwidth, and this improves block reconstruction performance.

Abstract: An erasure code (EC)-based data processing method implemented by a storage controller includes obtaining K data chunks, dividing each of the K data chunks into two data slices, encoding the 2*K data slices based on a parity matrix including 2*M rows and 2*(K+M) columns of elements, to obtain 2*M parity slices, and separately storing the K data chunks and the M parity chunks in different storage devices.

Abstract: An erasure code (EC)-based data processing method implemented by a storage controller includes obtaining K data chunks, dividing each of the K data chunks into two data slices, encoding the 2*K data slices based on a parity matrix including 2*M rows and 2*(K+M) columns of elements, to obtain 2*M parity slices, and separately storing the K data chunks and the M parity chunks in different storage devices.

Abstract: A method for obtaining a storage system capacity is provided. An available capacity that is of a storage system and that is associated with each stripe length is obtained based on an obtained stripe length that can be effectively configured. Therefore, an available capacity of a system is optimally selected.

Abstract: This application discloses a storage controller. When running, the storage controller encodes, according to a check matrix, K to-be-coded data chunks obtained from a client, to generate two check chunks. In this way, if any chunk is damaged subsequently, the damaged chunk may be recovered by using the check matrix and an undamaged chunk.

Abstract: This application discloses a storage controller. When running, the storage controller encodes, according to a check matrix, K to-be-coded data chunks obtained from a client, to generate two check chunks. In this way, if any chunk is damaged subsequently, the damaged chunk may be recovered by using the check matrix and an undamaged chunk.