Task scheduling method and device, electronic equipment and storage medium

Abstract

The invention provides a task scheduling method and device, electronic equipment and a storage medium, and the method comprises the steps: processing historical data volumes of different mechanisms based on a target task to generate a first task queue, the first task queue comprises a sequence of first tasks for processing data of each mechanism, and then the sequence of the first tasks is generated; under the condition that the historical data volume corresponding to any first task in the first task queue is greater than a preset threshold value, generating a second task queue based on the historical data volume corresponding to each feature value of a mechanism corresponding to any first task under the feature dimension, the second task queue comprises a sequence of second tasks used for processing the data corresponding to each feature value, the feature dimension is determined based on the function of the target task, and then the target task is executed based on the first task queue and the second task queue. Therefore, the task processing efficiency, stability and reliability can be improved.

Description

Technical Field

[0001] The present application relates to the field of computer technology, and in particular to a task scheduling method, device, electronic device and storage medium. Background Art

[0002] With limited resources, how to effectively allocate and manage tasks has a significant impact on system operation efficiency and resource utilization.

[0003] The current task scheduling method has some shortcomings. First, the start time of the task needs to be manually set in advance based on experience, which not only consumes a lot of manual work, but also may lead to inaccurate scheduling. Second, there is no automatic connection between tasks, and the scheduling mainly relies on manual control of the order of tasks, which increases the complexity of the operation and the risk of errors.

[0004] Therefore, there is an urgent need for a task scheduling method to improve the efficiency of task execution. Summary of the invention

[0005] The present application aims to solve one of the technical problems in the related art at least to some extent.

[0006] To this end, the first objective of the present application is to propose a task scheduling method to improve the efficiency of task execution.

[0007] The second objective of this application is to provide a task scheduling device.

[0008] The third objective of the present application is to provide an electronic device.

[0009] A fourth objective of the present application is to provide a computer-readable storage medium.

[0010] A fifth object of the present application is to provide a computer program product.

[0011] To achieve the above-mentioned purpose, the first embodiment of the present application proposes a task scheduling method, including:

[0012] Generate a first task queue based on the target task processing the historical data volume of different institutions, wherein the first task queue includes a sequence of first tasks for processing the data of each institution;

[0013] In the case where the amount of historical data corresponding to any first task in the first task queue is greater than a preset threshold, a second task queue is generated based on the amount of historical data corresponding to each characteristic value of the mechanism corresponding to any first task under the characteristic dimension, wherein the second task queue includes a sequence of second tasks for processing data corresponding to each characteristic value, and the characteristic dimension is determined based on the function of the target task;

[0014] Based on the first task queue and the second task queue, the target task is executed. To achieve the above purpose, the second aspect of the present application proposes a task scheduling device, including:

[0015] A first generating module, for generating a first task queue based on the target task processing the historical data volume of different institutions, wherein the first task queue includes a sequence of first tasks for processing the data of each institution;

[0016] A second generating module is used to generate a second task queue based on the historical data amount corresponding to each characteristic value of the mechanism corresponding to any first task under the characteristic dimension when the amount of historical data corresponding to any first task in the first task queue is greater than a preset threshold, wherein the second task queue includes a sequence of second tasks for processing data corresponding to each characteristic value, and the characteristic dimension is determined based on the function of the target task;

[0017] The execution module is used to execute the target task based on the first task queue and the second task queue.

[0018] To achieve the above-mentioned purpose, the third aspect of the present application provides an electronic device, including:

[0019] at least one processor; and

[0020] a memory communicatively connected to at least one processor; wherein,

[0021] The memory stores instructions that can be executed by at least one processor. The instructions are executed by the at least one processor so that the at least one processor can execute the method of the above embodiment.

[0022] To achieve the above objectives, the fourth aspect of the present application proposes a computer-readable storage medium storing computer instructions, wherein the computer instructions are used to enable a computer to execute the method according to the above embodiment.

[0023] To achieve the above objectives, the fifth aspect of the present application proposes a computer program product, including a computer program, which implements the method of the above embodiment when executed by a processor.

[0024] The task scheduling method, device, electronic device and storage medium provided by the present application generate a first task queue based on the historical data volume of different institutions for processing target tasks, wherein the first task queue includes the sequence of the first tasks for processing the data of each institution, and then, when the historical data volume corresponding to any first task in the first task queue is greater than the preset threshold, the historical data volume corresponding to each characteristic value of the institution corresponding to any first task under the characteristic dimension generates a second task queue, wherein the second task queue includes the sequence of the second tasks for processing the data corresponding to each characteristic value, and the characteristic dimension is determined based on the function of the target task, and then, based on the first task queue and the second task queue, the target task is executed. Thus, by further subdividing the task with a large amount of data into a plurality of small tasks, it is possible to ensure that the data volume of each task is relatively balanced, and avoid uneven system load due to excessive data volume of some tasks. In addition, by reasonably arranging the execution order of the first task queue and the second task queue, the execution process of the task can be optimized, and waiting time and resource waste can be reduced. Thereby, it is conducive to improving the efficiency, stability and reliability of task processing.

[0025] Additional aspects and advantages of the present application will be given in part in the description below, and in part will become apparent from the description below, or will be learned through the practice of the present application. BRIEF DESCRIPTION OF THE DRAWINGS

[0026] The above and / or additional aspects and advantages of the present application will become apparent and easily understood from the following description of the embodiments in conjunction with the accompanying drawings, in which:

[0027] Figure 1 A flowchart of a task scheduling method provided in an embodiment of the present application;

[0028] Figure 2 A schematic diagram of the structure of a task scheduling device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0029] The embodiments of the present application are described in detail below, and examples of the embodiments are shown in the accompanying drawings, wherein the same or similar reference numerals throughout represent the same or similar elements or elements having the same or similar functions. The embodiments described below with reference to the accompanying drawings are exemplary and are intended to be used to explain the present application, and should not be construed as limiting the present application.

[0030] The task scheduling method and device of the embodiments of the present application are described below with reference to the accompanying drawings.

[0031] The task scheduling method of the embodiment of the present application is executed by the task scheduling device provided by the embodiment of the present application. The device can be configured in a computer device or a terminal device to improve the efficiency of task execution.

[0032] Figure 1 A flowchart of a task scheduling method provided in an embodiment of the present application.

[0033] like Figure 1 As shown, the task scheduling method includes the following steps:

[0034] Step 101 , generating a first task queue based on a target task for processing historical data volumes of different institutions, wherein the first task queue includes a sequence of first tasks for processing data of each institution.

[0035] The target task may be a statistical calculation task such as a data task for a measurement interface of a reinsurance ceding contract, and this application does not impose any restrictions on this. The historical data volume may be the data volume of the business data generated by the target task in processing the operation of the institution within a historical preset time period, or the operation time of the target task in processing the business data generated by the operation of the institution within a historical preset time period, etc.

[0036] The target task processes a large amount of data, usually including data generated by multiple branches. For example, in the insurance industry, each administrative region has established its own branch, and the target task needs to process the data generated by each branch. Among them, each branch is an institution. In this application, the amount of historical data of each institution can be statistically determined. Afterwards, the order of data processing of each institution can be sorted according to the amount of historical data corresponding to each institution, and a first task queue is generated. For example, the larger the amount of historical data corresponding to an institution, the later the data processing order corresponding to the institution is in the first task queue.

[0037] Step 102, when the amount of historical data corresponding to any first task in the first task queue is greater than a preset threshold, a second task queue is generated based on the amount of historical data corresponding to each characteristic value of the mechanism corresponding to any first task under the characteristic dimension, wherein the second task queue contains the sequence of second tasks for processing the data corresponding to each characteristic value, and the characteristic dimension is determined based on the function of the target task.

[0038] Different organizations generate different amounts of data. Some organizations generate less data, while others generate more data. Correspondingly, the more data an organization generates, the longer it takes for the target task to process the organization's data. Therefore, we can further assign tasks to organizations with larger amounts of data to balance the amount of data processed by tasks, making task processing more efficient.

[0039] In addition, the importance of data under different feature dimensions varies in different tasks. When the target task is to calculate the actual collection of rights and liabilities, the feature dimension includes the actuarial reinsurance type, so as to calculate the actual collection of rights and liabilities of different actuarial reinsurance types based on different calculation methods. Among them, the actuarial reinsurance types include proportional contracts, non-proportional contracts, and temporary ceding. When the target task is to determine the ceding flow, the feature dimension includes the final recipient of reinsurance.

[0040] In this application, when the amount of historical data corresponding to a first task in a task queue is greater than a preset threshold, a second task queue is generated based on the amount of historical data corresponding to each characteristic value of the mechanism corresponding to the first task under the characteristic dimension, so as to ensure the balance of data processed by each task, thereby improving the efficiency and reliability of task processing.

[0041] Furthermore, when the amount of historical data corresponding to a certain characteristic value of an institution corresponding to a first task under a characteristic dimension is greater than a preset threshold, multiple second tasks for the characteristic value are generated, each for processing part of the data corresponding to the characteristic value, to further ensure the balance of data processed by each task.

[0042] Step 103, executing the target task based on the first task queue and the second task queue.

[0043] In the present application, each first task can be preferentially executed in the order of each first task in the first task queue. After the first task is executed, each second task is executed in the order of each second task in the second task queue, thereby completing the execution of the target task. Hierarchical task scheduling can make better use of system resources and avoid idle or over-occupied resources.

[0044] Optionally, when executing the first task and the second task, they can be executed in parallel to improve the efficiency of task execution.

[0045] Optionally, multiple threads can also be created, and multiple first tasks can be obtained from the first task queue in sequence, and multiple threads can be used to process the multiple first tasks in parallel until all the first tasks are executed. When there are idle threads in the multiple threads executed concurrently and there are no first tasks to be processed in the first task queue, the remaining resources of the system are evaluated. After that, the second tasks to be processed are obtained from the second task queue in sequence, and when the remaining resources meet the resource requirements of the second task operation and the number of second tasks in operation in the second task queue is less than a preset threshold, the second task is executed using the idle thread until the second task is executed. Thus, by constraining the number of second tasks executed concurrently and evaluating the resources used when the second task is running, insufficient resources can be avoided and the reliability of task execution can be guaranteed.

[0046] It should be noted that before the thread executes the second task, it is necessary to evaluate the remaining resources of the system, and start executing the second task only when the remaining resources meet the resource requirements of the second task and the number of second tasks running in the second task queue is less than the preset threshold.

[0047] When there is an idle thread among the multiple threads executed concurrently and there is no first task to be processed in the first task queue, the remaining resources of the system are evaluated. When the remaining resources do not meet the resource requirements for the second task to run, or the number of second tasks in the running state in the second task queue is greater than the preset threshold, the idle thread temporarily does not start to execute the second task. When other threads are finished running, the remaining resources meet the resource requirements for the second task to run, and the number of second tasks in the running state is less than or equal to the preset threshold, the idle thread starts to execute the second task again.

[0048] Optionally, during the execution of the target task, the execution process of the target task can be monitored, and when an exception occurs in the first task or the second task, the execution of the target task can be adjusted based on the fault tolerance mechanism. For example, when an exception occurs in a first task or a second task, the first task or the second task is re-executed after waiting for a preset time. Alternatively, the number of times the abnormal first task or the second task is re-executed can be limited. If the number of times a first task or the second task is re-executed is greater than a preset number, the execution of the first task or the second task is stopped. This improves the success rate of task execution and shortens the task running time.

[0049] In the present application, the first task queue is generated based on the historical data volume of different institutions for processing the target task, wherein the first task queue includes the sequence of the first task for processing the data of each institution, and then, when the historical data volume corresponding to any first task in the first task queue is greater than the preset threshold, the second task queue is generated based on the historical data volume corresponding to each characteristic value of the institution corresponding to any first task under the characteristic dimension, wherein the second task queue includes the sequence of the second task for processing the data corresponding to each characteristic value, and the characteristic dimension is determined based on the function of the target task, and then, based on the first task queue and the second task queue, the target task is executed. Thus, by further subdividing the task with a large amount of data into a plurality of small tasks, it is possible to ensure that the data volume of each task is relatively balanced, and avoid uneven system load due to excessive data volume of some tasks. In addition, by reasonably arranging the execution order of the first task queue and the second task queue, the execution process of the task can be optimized, and waiting time and resource waste can be reduced. Thereby it is conducive to improving the efficiency, stability and reliability of task processing.

[0050] In order to implement the above embodiment, the present application also proposes a task scheduling device.

[0051] Figure 2 A schematic diagram of the structure of a task scheduling device provided in an embodiment of the present application.

[0052] like Figure 2 As shown, the task scheduling device includes a first generating module 210 , a second generating module 220 , and an executing module 230 .

[0053] A first generating module 210, for generating a first task queue based on the target task processing the historical data volume of different institutions, wherein the first task queue includes the sequence of the first task for processing the data of each institution;

[0054] A second generating module 220 is used to generate a second task queue based on the historical data amount corresponding to each characteristic value of the mechanism corresponding to any first task under the characteristic dimension when the amount of historical data corresponding to any first task in the first task queue is greater than a preset threshold, wherein the second task queue includes a sequence of second tasks for processing data corresponding to each characteristic value, and the characteristic dimension is determined based on the function of the target task;

[0055] The execution module 230 is used to execute the target task based on the first task queue and the second task queue.

[0056] Furthermore, in a possible implementation of an embodiment of the present application, when the target task is used to calculate the actual collection of rights and liabilities, the characteristic dimension includes the actuarial reinsurance type; when the target task is used to determine the ceded direction, the characteristic dimension includes the final recipient of the reinsurance.

[0057] Furthermore, in a possible implementation of the embodiment of the present application, the execution module 230 is configured to:

[0058] Creating multiple threads, and obtaining multiple first tasks from the first task queue in sequence with priority, and using the multiple threads to process the multiple first tasks in parallel respectively;

[0059] In response to there being an idle thread among the multiple threads and there being no first tasks to be processed in the first task queue, evaluating remaining resources of the system;

[0060] The second tasks to be processed are obtained in sequence from the second task queue, and when the remaining resources meet the resource requirements of the second task running and the number of the second tasks in the second task queue in running state is less than a preset threshold, the second task is executed using an idle thread.

[0061] Furthermore, in a possible implementation of the embodiment of the present application, the second generating module is used to:

[0062] When the amount of historical data corresponding to any characteristic value of the organization corresponding to any first task under the characteristic dimension is greater than a preset threshold, multiple second tasks for any characteristic value are generated, each for processing part of the data corresponding to any characteristic value.

[0063] Furthermore, in a possible implementation of the embodiment of the present application, it also includes:

[0064] The monitoring module is used to monitor the execution process of the target task and adjust the execution of the target task based on the fault tolerance mechanism when an exception occurs in the first task or the second task.

[0065] It should be noted that the above explanation of the task scheduling method embodiment is also applicable to the task scheduling device of this embodiment, and will not be repeated here.

[0066] In the present application, the first task queue is generated based on the historical data volume of different institutions for processing the target task, wherein the first task queue includes the sequence of the first task for processing the data of each institution, and then, when the historical data volume corresponding to any first task in the first task queue is greater than the preset threshold, the second task queue is generated based on the historical data volume corresponding to each characteristic value of the institution corresponding to any first task under the characteristic dimension, wherein the second task queue includes the sequence of the second task for processing the data corresponding to each characteristic value, and the characteristic dimension is determined based on the function of the target task, and then, based on the first task queue and the second task queue, the target task is executed. Thus, by further subdividing the task with a large amount of data into a plurality of small tasks, it is possible to ensure that the data volume of each task is relatively balanced, and avoid uneven system load due to excessive data volume of some tasks. In addition, by reasonably arranging the execution order of the first task queue and the second task queue, the execution process of the task can be optimized, and waiting time and resource waste can be reduced. Thereby it is conducive to improving the efficiency, stability and reliability of task processing.

[0067] In order to implement the above embodiments, the present application also proposes an electronic device, comprising: a processor, and a memory communicatively connected to the processor; the memory stores computer-executable instructions; the processor executes the computer-executable instructions stored in the memory to implement the method provided by the above embodiments.

[0068] In order to implement the above embodiments, the present application also proposes a computer-readable storage medium, in which computer-executable instructions are stored. When the computer-executable instructions are executed by a processor, they are used to implement the methods provided by the above embodiments.

[0069] In order to implement the above embodiments, the present application also proposes a computer program product, including a computer program, which implements the methods provided by the above embodiments when executed by a processor.

[0070] The collection, storage, use, processing, transmission, provision and disclosure of user personal information involved in this application are in compliance with relevant laws and regulations and do not violate public order and good morals.

[0071] It should be noted that personal information from users should be collected for legitimate and reasonable purposes and should not be shared or sold outside of these legitimate uses. In addition, such collection / sharing should be carried out after receiving the user's informed consent, including but not limited to notifying the user to read the user agreement / user notice and sign the agreement / authorization including authorization of relevant user information before the user uses the function. In addition, any necessary steps should be taken to protect and safeguard access to such personal information data and ensure that others who have access to personal information data comply with its privacy policy and procedures.

[0072] This application is expected to provide an implementation scheme for users to selectively block the use or access of personal information data. That is, this application is expected to provide hardware and / or software to prevent or block access to such personal information data. Once the personal information data is no longer needed, risks can be minimized by limiting data collection and deleting data. In addition, when applicable, personal identifiers are removed from such personal information to protect the privacy of users.

[0073] In the description of the aforementioned embodiments, the description with reference to the terms "one embodiment", "some embodiments", "example", "specific example", or "some examples" etc. means that the specific features, structures, materials or characteristics described in conjunction with the embodiment or example are included in at least one embodiment or example of the present application. In this specification, the schematic representations of the above terms do not necessarily refer to the same embodiment or example. Moreover, the specific features, structures, materials or characteristics described may be combined in any one or more embodiments or examples in a suitable manner. In addition, those skilled in the art may combine and combine the different embodiments or examples described in this specification and the features of the different embodiments or examples, without contradiction.

[0074] In addition, the terms "first" and "second" are used for descriptive purposes only and should not be understood as indicating or implying relative importance or implicitly indicating the number of the indicated technical features. Therefore, the features defined as "first" and "second" may explicitly or implicitly include at least one of the features. In the description of this application, the meaning of "plurality" is at least two, such as two, three, etc., unless otherwise clearly and specifically defined.

[0075] Any process or method description in a flowchart or otherwise described herein may be understood to represent a module, fragment or portion of code comprising one or more executable instructions for implementing the steps of a custom logical function or process, and the scope of the preferred embodiments of the present application includes alternative implementations in which functions may not be performed in the order shown or discussed, including performing functions in a substantially simultaneous manner or in the reverse order depending on the functions involved, which should be understood by technicians in the technical field to which the embodiments of the present application belong.

[0076] The logic and / or steps represented in the flowchart or otherwise described herein, for example, can be considered as an ordered list of executable instructions for implementing logical functions, and can be embodied in any computer-readable medium for use by an instruction execution system, device or apparatus (such as a computer-based system, a system including a processor, or other system that can fetch instructions from an instruction execution system, device or apparatus and execute the instructions), or in combination with these instruction execution systems, devices or apparatuses. For the purpose of this specification, "computer-readable medium" can be any device that can contain, store, communicate, propagate or transmit a program for use by an instruction execution system, device or apparatus, or in combination with these instruction execution systems, devices or apparatuses. More specific examples of computer-readable media (a non-exhaustive list) include the following: an electrical connection with one or more wires (electronic device), a portable computer disk box (magnetic device), a random access memory (RAM), a read-only memory (ROM), an erasable and programmable read-only memory (EPROM or flash memory), a fiber optic device, and a portable compact disk read-only memory (CDROM). In addition, the computer-readable medium may even be paper or other suitable medium on which the program is printed, since the program may be obtained electronically, for example, by optically scanning the paper or other medium and then editing, interpreting or processing in other suitable ways if necessary, and then stored in a computer memory.

[0077] It should be understood that the various parts of the present application can be implemented by hardware, software, firmware or a combination thereof. In the above-mentioned embodiments, multiple steps or methods can be implemented by software or firmware stored in a memory and executed by a suitable instruction execution system. For example, if implemented by hardware, as in another embodiment, it can be implemented by any one of the following technologies known in the art or their combination: a discrete logic circuit having a logic gate circuit for implementing a logic function for a data signal, a dedicated integrated circuit having a suitable combination of logic gate circuits, a programmable gate array (PGA), a field programmable gate array (FPGA), etc.

[0078] A person skilled in the art may understand that all or part of the steps in the method for implementing the above-mentioned embodiment may be completed by instructing related hardware through a program, and the program may be stored in a computer-readable storage medium, which, when executed, includes one or a combination of the steps of the method embodiment.

[0079] In addition, each functional unit in each embodiment of the present application may be integrated into a processing module, or each unit may exist physically separately, or two or more units may be integrated into one module. The above-mentioned integrated module may be implemented in the form of hardware or in the form of a software functional module. If the integrated module is implemented in the form of a software functional module and sold or used as an independent product, it may also be stored in a computer-readable storage medium.

[0080] The storage medium mentioned above may be a read-only memory, a magnetic disk or an optical disk, etc. Although the embodiments of the present application have been shown and described above, it can be understood that the above embodiments are exemplary and cannot be understood as limiting the present application. A person of ordinary skill in the art may change, modify, replace and modify the above embodiments within the scope of the present application.

Claims

1. A task scheduling method, characterized in that: The method comprises: Generate a first task queue based on the target task processing the historical data volume of different institutions, wherein the first task queue contains the sequence of the first tasks for processing the data of each of the institutions; In the case where the amount of historical data corresponding to any first task in the first task queue is greater than a preset threshold, a second task queue is generated based on the amount of historical data corresponding to each characteristic value of the mechanism corresponding to any first task under the characteristic dimension, wherein the second task queue includes a sequence of second tasks for processing the data corresponding to each characteristic value, and the characteristic dimension is determined based on the function of the target task; Based on the first task queue and the second task queue, a target task is executed.

2. The method according to claim 1, characterized in that When the target task is used to calculate the actual collection of rights and responsibilities, the characteristic dimension includes the actuarial reinsurance type; when the target task is used to determine the ceded direction, the characteristic dimension includes the final recipient of reinsurance.

3. The method according to claim 1, characterized in that The executing the target task based on the first task queue and the second task queue includes: Creating a plurality of threads, and preferentially obtaining a plurality of first tasks from the first task queue in sequence, and using the plurality of the threads to process the plurality of the first tasks in parallel respectively; In response to there being an idle thread among the plurality of threads and there being no first tasks to be processed in the first task queue, evaluating remaining resources of the system; The second tasks to be processed are obtained in sequence from the second task queue, and when the remaining resources meet the resource requirements for the running of the second tasks and the number of second tasks in running state in the second task queue is less than a preset threshold, the second tasks are executed using the idle thread.

4. The method according to claim 1, characterized in that The generating a second task queue based on the amount of historical data corresponding to each characteristic value of the mechanism corresponding to any one of the first tasks under the characteristic dimension comprises: When the amount of historical data corresponding to any characteristic value of the organization corresponding to any first task under the characteristic dimension is greater than a preset threshold, multiple second tasks are generated for any characteristic value, each of which is used to process part of the data corresponding to any characteristic value.

5. The method according to claim 1, characterized in that Also includes: The execution process of the target task is monitored, and when an exception occurs in the first task or the second task, the execution of the target task is adjusted based on a fault tolerance mechanism.

6. A task scheduling device, characterized in that: The device comprises: A first generating module, for generating a first task queue based on the target task processing the historical data volume of different institutions, wherein the first task queue contains the sequence of the first tasks for processing the data of each institution; A second generating module is used to generate a second task queue based on the historical data amount corresponding to each characteristic value of the mechanism corresponding to any first task under the characteristic dimension when the amount of historical data corresponding to any first task in the first task queue is greater than a preset threshold, wherein the second task queue includes a sequence of second tasks for processing the data corresponding to each characteristic value, and the characteristic dimension is determined based on the function of the target task; An execution module is used to execute a target task based on the first task queue and the second task queue.

7. The device according to claim 6, characterized in that When the target task is used to calculate the actual collection of rights and responsibilities, the characteristic dimension includes the actuarial reinsurance type; when the target task is used to determine the ceded direction, the characteristic dimension includes the final recipient of reinsurance.

8. The device according to claim 6, characterized in that The execution module is used to: Creating a plurality of threads, and preferentially obtaining a plurality of first tasks from the first task queue in sequence, and using the plurality of the threads to process the plurality of the first tasks in parallel respectively; In response to there being an idle thread among the plurality of threads and there being no first tasks to be processed in the first task queue, evaluating remaining resources of the system; The second tasks to be processed are obtained in sequence from the second task queue, and when the remaining resources meet the resource requirements for the running of the second tasks and the number of second tasks in running state in the second task queue is less than a preset threshold, the second tasks are executed using the idle thread.

9. The device according to claim 6, characterized in that The second generating module is used for: When the amount of historical data corresponding to any characteristic value of the organization corresponding to any first task under the characteristic dimension is greater than a preset threshold, multiple second tasks are generated for any characteristic value, each of which is used to process part of the data corresponding to any characteristic value.

10. The device according to claim 6, characterized in that Also includes: The monitoring module is used to monitor the execution process of the target task and adjust the execution of the target task based on a fault tolerance mechanism when an exception occurs in the first task or the second task.

11. An electronic device, characterized in that: include: A processor, and a memory communicatively connected to the processor; The memory stores computer-executable instructions; The processor executes the computer-executable instructions stored in the memory to implement the method according to any one of claims 1 to 5.

12. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores computer-executable instructions, which are used to implement the method according to any one of claims 1 to 5 when executed by a processor.

13. A computer program product, characterized in that The invention comprises a computer program, which implements the method according to any one of claims 1 to 5 when being executed by a processor.

Images