Data processing method and apparatus, computer device, and computer-readable storage medium

Patent metadata

Field	Value
Publication number	US-12277403-B2
Application number	US-202318335491-A
Country	US
Kind code	B2
Filing date	Jun 15, 2023
Priority date	Oct 25, 2021
Publication date	Apr 15, 2025
Grant date	Apr 15, 2025

Abstract

A data processing method includes: acquiring a data sorting request for a data sequence to be sorted, and invoking C data bitonic sorting components in response to the data sorting request, C being a positive integer greater than 1; initiating B data bitonic sorting tasks according to the data sequence and the C data bitonic sorting components, B being a positive integer greater than 1, the B data bitonic sorting tasks being respectively associated with different data subsequences of B data subsequences, and the B data subsequences being generated based on the to-be-sorted data sequence; operating the C data bitonic sorting components in parallel according to the B data bitonic sorting tasks to obtain B data sorting subresults; and combining the B data sorting subresults based on the C data bitonic sorting components to obtain a data sorting result for the data sequence.

First claim

What is claimed is:

1. A data processing method, performed by a computer device and comprising:
acquiring a data sorting request for a data sequence to be sorted, and invoking C data bitonic sorting components according to the data sorting request, C being a positive integer greater than 1;
initiating B data bitonic sorting tasks according to the data sequence and the C data bitonic sorting components, B being a positive integer greater than 1, and the B data bitonic sorting tasks being respectively associated with different data subsequences of B data subsequences, and the B data subsequences being generated based on the data sequence;
operating the C data bitonic sorting components in parallel according to the B data bitonic sorting tasks to obtain B data sorting subresults outputted by the C data bitonic sorting components, one data sorting subresult indicating a sorting result of one of the data subsequences associated with one of the data bitonic sorting tasks; and
combining the B data sorting subresults based on the C data bitonic sorting components to obtain a data sorting result for the data sequence.

2. The method according to claim 1 , further comprising:
transmitting the data sorting request to a task control component, the data sorting request carrying a first total quantity of data in the data sequence; and
the initiating B data bitonic sorting tasks according to the data sequence and the C data bitonic sorting components comprising:
determining, in the task control component, a quantity to be sorted associated with the first total quantity, the quantity being equal to or greater than the first total quantity;
acquiring a total data storage capacity corresponding to the C data bitonic sorting components, and comparing the quantity to be sorted with the total data storage capacity to obtain a first comparison result; and
initiating the B data bitonic sorting tasks according to the first comparison result.

3. The method according to claim 2 , wherein the initiating the B data bitonic sorting tasks according to the first comparison result comprises:
in response to that the quantity is greater than the total data storage capacity, acquiring a first quantity ratio of the quantity to the total data storage capacity, and initiating the B data bitonic sorting tasks according to the first quantity ratio, a product of C and the first quantity ratio being equal to B, a second total quantity carried in one data bitonic sorting task being equal to a total quantity of data in the data subsequence associated with one data bitonic sorting task; and
in response to that the quantity is less than or equal to the total data storage capacity, initiating the B data bitonic sorting tasks according to the C data bitonic sorting components, B being equal to C.

4. The method according to claim 1 , wherein the operating the C data bitonic sorting components in parallel according to the B data bitonic sorting tasks to obtain B data sorting subresults outputted by the C data bitonic sorting components comprises:
distributing the B data bitonic sorting tasks to the C data bitonic sorting components in response to that B is equal to C, one data bitonic sorting task being distributed to one data bitonic sorting component; and
operating the B data bitonic sorting tasks in parallel through the C data bitonic sorting components to obtain data sorting subresults respectively outputted by the C data bitonic sorting components.

5. The method according to claim 4 , wherein the B data bitonic sorting tasks comprise a data bitonic sorting task D e , and e is a positive integer less than or equal to B; the B data subsequences comprise a data subsequence A e corresponding to the data bitonic sorting task D e ; the C data bitonic sorting components comprise a data bitonic sorting component F e configured to execute the data bitonic sorting task D e ; and
the operating the B data bitonic sorting tasks in parallel through the C data bitonic sorting components to obtain data sorting subresults respectively outputted by the C data bitonic sorting components comprises:
acquiring, by the data bitonic sorting component F e , the data subsequence A e corresponding to the data bitonic sorting task D e , and performing bitonic sorting on the data subsequence A e to obtain a data sorting subresult corresponding to the data subsequence A e ; and
when operating the data bitonic sorting component F e , operating B-1 data bitonic sorting tasks in parallel through C-1 data bitonic sorting components, to obtain data sorting subresults respectively outputted by the C-1 data bitonic sorting components, the C-1 data bitonic sorting components referring to data bitonic sorting components in the C data bitonic sorting components except the data bitonic sorting component F e , and the B-1 data bitonic sorting tasks referring to data bitonic sorting tasks in the B data bitonic sorting tasks except the data bitonic sorting tasks D e .

6. The method according to claim 5 , wherein the data sorting request carries read addresses respectively corresponding to the data in the data sequence, and a sort order for the data sequence; and
the acquiring, in the data bitonic sorting component F e , the data subsequence A e corresponding to the data bitonic sorting task D e comprises:
acquiring, by the data bitonic sorting component F e , a target read address and a second total quantity that are carried in the data bitonic sorting task D e , the read addresses respectively corresponding to the data in the data sequence comprising the target read address, and the second total quantity indicating a total quantity of data in the data subsequence A e ;
transmitting a data acquisition request carrying the target read address to a data read/write component, and acquiring an initial data subsequence from the target read address through the data read/write component, the initial subsequence belonging to the data sequence;
determining a quantity difference between the second total quantity and a third total quantity, the third total quantity indicating a total quantity of data in the initial data subsequence;
acquiring supplementary data according to the quantity difference and the sort order, and adding the supplementary data to the initial data subsequence to obtain the data subsequence A e ; and
loading the data subsequence A e into a storage component corresponding to the data bitonic sorting component F e .

7. The method according to claim 5 , wherein the data bitonic sorting component F e comprises a sort control subcomponent, a round control subcomponent, a data acquisition subcomponent, and a bitonic sorting subcomponent; and
the performing bitonic sorting on the data subsequence A e to obtain a data sorting subresult corresponding to the data subsequence A e comprises:
initiating the round control subcomponent in response to that the sort control subcomponent acquires a data loading completion notification, the data loading completion notification indicating that the storage component corresponding to the data bitonic sorting component F e has loaded the data subsequence A e ;
determining, by the round control subcomponent, a bitonic sorting phase corresponding to the data subsequence A e and bitonic sorting logical parameters corresponding to the bitonic sorting phase according to the second total quantity; transmitting the bitonic sorting phase and the bitonic sorting logical parameters corresponding to the bitonic sorting phase to the data acquisition subcomponent, the second total quantity indicating a total quantity of data in the data subsequence A e ;
acquiring, by the data acquisition subcomponent, intermediate data according to the bitonic sorting phase and the bitonic sorting logical parameters corr

Assignees

• Tencent Tech Shenzhen Co Ltd

Inventors

• Yu Xiaoyu
• Chen Dewei
• Han Feng
• Li Jiaxin

Classifications

• G06F16/901

  Indexing; Data structures therefor; Storage structures (for retrieval from the web G06F16/951) · CPC title

• Y02D10/00

  Energy efficient computing, e.g. low power processors, power management or thermal management · CPC title

• G06F9/48

  Program initiating; Program switching, e.g. by interrupt · CPC title

• G06F9/445

  Program loading or initiating (bootstrapping G06F9/4401; security arrangements for program loading or initiating G06F21/57) · CPC title

• G06F7/08 Primary

  Sorting, i.e. grouping record carriers in numerical or other ordered sequence according to the classification of at least some of the information they carry (by merging two or more sets of carriers in ordered sequence G06F7/16) · CPC title