Task processing method and device, computer equipment and storage medium

Abstract

The invention belongs to the field of data processing and the field of financial science and technology, and relates to a task processing method and device, computer equipment and a storage medium. Obtaining a dependency relationship and a constraint condition of each sub-task, and adjusting the sub-tasks based on the constraint condition to obtain a target sub-task; constructing a task dependency graph corresponding to the target sub-task based on the dependency relationship; performing topological sorting on the first sub-tasks in the task dependency graph to obtain a first task sequence; screening out a second subtask from the first task sequence; obtaining a priority value of the second sub-task, and carrying out sorting adjustment processing on the first task sequence based on the priority value to obtain a second task sequence; and based on a resource management algorithm, allocating the second task sequence to a corresponding target resource for execution. In addition, the second task sequence can be stored in the block chain. According to the invention, the resource utilization rate and the task execution efficiency of the system are effectively improved.

Description

Technical Field

[0001] The present application relates to the fields of data processing technology and financial technology, and in particular to task processing methods, devices, computer equipment and storage media. Background Art

[0002] With the rapid development of the financial industry, financial business systems are becoming increasingly complex, placing higher demands on data processing capabilities, response speed, and system stability. Against this backdrop, financial business system service orchestration and parallel execution task scheduling technology have emerged as a key technical means to improve system performance, optimize resource utilization, and meet diversified business needs. This technology aims to execute multiple tasks in parallel in a distributed computing environment through efficient resource allocation and task scheduling strategies, thereby significantly shortening task completion time, improving user experience, and maximizing resource utilization.

[0003] However, although there are many solutions and technical products for parallel execution task scheduling on the market, existing parallel task scheduling systems often have difficulty accurately predicting task loads in complex and changing business environments, resulting in uneven resource allocation. In some cases, some resources may become bottlenecks due to overload, while other resources are idle, resulting in low resource utilization and failure to fully utilize the system's potential. Summary of the invention

[0004] The purpose of the embodiments of the present application is to provide a task processing method, apparatus, computer equipment and storage medium to solve the technical problem of low resource utilization in the existing parallel task scheduling system.

[0005] In order to solve the above technical problems, the present application provides a task processing method, which adopts the following technical solutions:

[0006] Get pending tasks;

[0007] Splitting the task into a plurality of subtasks;

[0008] Obtaining the dependencies and constraints of each of the subtasks, and adjusting the subtasks based on the constraints to obtain corresponding target subtasks;

[0009] Constructing a task dependency graph corresponding to the target subtask based on the dependency relationship;

[0010] Performing topological sorting on the first subtask in the task dependency graph based on a preset topological sorting algorithm to obtain a corresponding first task sequence;

[0011] Filtering out a second subtask from the first task sequence; wherein the second subtask is a task that has no direct dependency in the first task sequence;

[0012] Obtaining a priority value of the second subtask, and performing sorting and adjustment processing on the first task sequence based on the priority value to obtain a corresponding second task sequence;

[0013] Based on a preset resource management algorithm, the second task sequence is allocated to corresponding target resources for execution.

[0014] Further, the step of obtaining the priority value of the second subtask and performing sorting and adjustment processing on the first task sequence based on the priority value to obtain the corresponding second task sequence specifically includes:

[0015] Get the preset priority evaluation strategy;

[0016] Performing a priority evaluation process on the second subtask based on the priority evaluation strategy to generate a priority value corresponding to the second subtask;

[0017] Performing sorting and adjustment processing on the first task sequence based on the priority value to obtain an adjusted first task sequence;

[0018] The first task sequence is used as the second task sequence.

[0019] Furthermore, the step of allocating the second task sequence to corresponding target resources for execution based on a preset resource management algorithm specifically includes:

[0020] Acquire resource requirement information of all the second subtasks included in the second task sequence;

[0021] Calculate the corresponding total resource requirement information based on the resource requirement information of all the second subtasks;

[0022] Building a corresponding resource layout strategy based on the total resource demand;

[0023] Based on the resource layout strategy and the resource management algorithm, the second task sequence is allocated to corresponding target resources for execution.

[0024] Furthermore, the step of splitting the task into multiple subtasks specifically includes:

[0025] Call the preset process model;

[0026] Splitting the task based on the process model to obtain a corresponding plurality of split tasks;

[0027] The split task is used as the subtask.

[0028] Furthermore, after the step of allocating the second task sequence to the corresponding target resource for execution based on the preset resource management algorithm, the method further includes:

[0029] During the execution of the task corresponding to the second task sequence, monitoring the task execution time of the third subtask included in the second task sequence based on a preset monitoring code; wherein the third subtask is any one of all the second subtasks;

[0030] Determine whether the task execution time is greater than a preset time threshold;

[0031] If yes, marking the third subtask as abnormal;

[0032] Generate designated alarm information corresponding to the third subtask;

[0033] The specified alarm information is sent to the preset operation and maintenance personnel.

[0034] Furthermore, after the step of allocating the second task sequence to the corresponding target resource for execution based on the preset resource management algorithm, the method further includes:

[0035] During the execution of the task corresponding to the second task sequence, monitoring the resource usage information of the target resource based on a preset resource monitoring tool;

[0036] Determining whether there is designated resource usage information exceeding a preset usage threshold in the resource usage information;

[0037] If so, determining the designated resource corresponding to the designated resource usage information;

[0038] The designated resource is adjusted based on a preset resource adjustment policy.

[0039] Furthermore, after the step of allocating the second task sequence to the corresponding target resource for execution based on the preset resource management algorithm, the method further includes:

[0040] After completing the task processing for the second task sequence, collecting the task processing results corresponding to the second task sequence;

[0041] Determining a target storage method corresponding to the task processing result;

[0042] The task processing result is stored based on the target storage mode.

[0043] In order to solve the above technical problems, the embodiment of the present application further provides a task processing device, which adopts the following technical solution:

[0044] The acquisition module is used to obtain tasks to be processed;

[0045] A splitting module, used for splitting the task into multiple subtasks;

[0046] A first adjustment module, used to obtain the dependency relationship and constraint conditions of each of the subtasks, and adjust the subtasks based on the constraint conditions to obtain corresponding target subtasks;

[0047] A construction module, used to construct a task dependency graph corresponding to the target subtask based on the dependency relationship;

[0048] A sorting module, used for topologically sorting the first subtask in the task dependency graph based on a preset topological sorting algorithm to obtain a corresponding first task sequence;

[0049] A screening module, used to screen out a second subtask from the first task sequence; wherein the second subtask is a task that has no direct dependency in the first task sequence;

[0050] A second adjustment module, used for obtaining the priority value of the second subtask, and performing sorting and adjustment processing on the first task sequence based on the priority value to obtain a corresponding second task sequence;

[0051] The allocation module is used to allocate the second task sequence to the corresponding target resources for execution based on a preset resource management algorithm.

[0052] In order to solve the above technical problems, the embodiment of the present application further provides a computer device, which adopts the following technical solution:

[0053] Get pending tasks;

[0054] Splitting the task into a plurality of subtasks;

[0055] Obtaining the dependencies and constraints of each of the subtasks, and adjusting the subtasks based on the constraints to obtain corresponding target subtasks;

[0056] Constructing a task dependency graph corresponding to the target subtask based on the dependency relationship;

[0057] Performing topological sorting on the first subtask in the task dependency graph based on a preset topological sorting algorithm to obtain a corresponding first task sequence;

[0058] Filtering out a second subtask from the first task sequence; wherein the second subtask is a task that has no direct dependency in the first task sequence;

[0059] Obtaining a priority value of the second subtask, and performing sorting and adjustment processing on the first task sequence based on the priority value to obtain a corresponding second task sequence;

[0060] Based on a preset resource management algorithm, the second task sequence is allocated to corresponding target resources for execution.

[0061] In order to solve the above technical problems, the embodiment of the present application further provides a computer-readable storage medium, which adopts the following technical solution:

[0062] Get pending tasks;

[0063] Splitting the task into a plurality of subtasks;

[0064] Obtaining the dependencies and constraints of each of the subtasks, and adjusting the subtasks based on the constraints to obtain corresponding target subtasks;

[0065] Constructing a task dependency graph corresponding to the target subtask based on the dependency relationship;

[0066] Performing topological sorting on the first subtask in the task dependency graph based on a preset topological sorting algorithm to obtain a corresponding first task sequence;

[0067] Filtering out a second subtask from the first task sequence; wherein the second subtask is a task that has no direct dependency in the first task sequence;

[0068] Obtaining a priority value of the second subtask, and performing sorting and adjustment processing on the first task sequence based on the priority value to obtain a corresponding second task sequence;

[0069] Based on a preset resource management algorithm, the second task sequence is allocated to corresponding target resources for execution.

[0070] Compared with the prior art, the embodiments of the present application have the following beneficial effects:

[0071] The present application first obtains the task to be processed and splits the task into multiple subtasks; then obtains the dependency relationship and constraint conditions of each of the subtasks, and adjusts the subtasks based on the constraint conditions to obtain the corresponding target subtasks; then constructs a task dependency graph corresponding to the target subtask based on the dependency relationship; subsequently, topologically sorts the first subtask in the task dependency graph based on a preset topological sorting algorithm to obtain a corresponding first task sequence; and selects the second subtask from the first task sequence; wherein the second subtask is a task that has no direct dependency relationship in the first task sequence; further obtains the priority value of the second subtask, and sorts and adjusts the first task sequence based on the priority value to obtain a corresponding second task sequence; finally, based on a preset resource management algorithm, allocates the second task sequence to the corresponding target resource for execution. The present application splits the task to be processed into multiple subtasks, adjusts the subtasks based on the constraints of the subtasks to obtain target subtasks, and constructs a task dependency graph corresponding to the target subtask based on the dependency relationship of the subtasks, and then combines the topological sorting and priority sorting methods to perform parallel task sorting for the tasks to obtain the corresponding second task sequence, and finally combines the use of resource layout strategy and resource management algorithm to perform task allocation processing for the second task sequence, which can ensure that the subtasks in the second task sequence can be balanced. Allocated to various resources for concurrent processing, effectively improves the throughput and response speed of the system, while making full use of system resources, improving the system's resource utilization and task execution efficiency, which is beneficial to improving the overall processing efficiency and performance of the system. BRIEF DESCRIPTION OF THE DRAWINGS

[0072] In order to more clearly illustrate the scheme in the present application, a brief introduction is given below to the drawings required for use in the description of the embodiments of the present application. Obviously, the drawings described below are some embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative work.

[0073] Figure 1 is an exemplary system architecture diagram to which the present application may be applied;

[0074] Figure 2 A flowchart of an embodiment of a task processing method according to the present application;

[0075] Figure 3 is a structural schematic diagram of an embodiment of a task processing device according to the present application;

[0076] Figure 4 It is a structural diagram of an embodiment of a computer device according to the present application. DETAILED DESCRIPTION

[0077] Unless otherwise defined, all technical and scientific terms used herein have the same meaning as those commonly understood by technicians in the technical field of the present application; the terms used in the specification of the application herein are only for the purpose of describing specific embodiments and are not intended to limit the present application; the terms "including" and "having" and any variations thereof in the specification and claims of the present application and the above-mentioned drawings are intended to cover non-exclusive inclusions. The terms "first", "second", etc. in the specification and claims of the present application or the above-mentioned drawings are used to distinguish different objects, not to describe a specific order.

[0078] Reference to "embodiments" herein means that a particular feature, structure, or characteristic described in conjunction with the embodiments may be included in at least one embodiment of the present application. The appearance of the phrase in various locations in the specification does not necessarily refer to the same embodiment, nor is it an independent or alternative embodiment that is mutually exclusive with other embodiments. It is explicitly and implicitly understood by those skilled in the art that the embodiments described herein may be combined with other embodiments.

[0079] In order to enable those skilled in the art to better understand the solution of the present application, the technical solution in the embodiments of the present application will be clearly and completely described below in conjunction with the accompanying drawings.

[0080] like Figure 1 As shown, the system architecture 100 may include a terminal device 101, a network 102 and a server 103. The terminal device 101 may be a laptop 1011, a tablet computer 1012 or a mobile phone 1013. The network 102 is used to provide a medium for a communication link between the terminal device 101 and the server 103. The network 102 may include various connection types, such as wired, wireless communication links or optical fiber cables, etc.

[0081] The user can use the terminal device 101 to interact with the server 103 through the network 102 to receive or send messages, etc. Various communication client applications can be installed on the terminal device 101, such as web browser applications, shopping applications, search applications, instant messaging tools, email clients, social platform software, etc.

[0082] The terminal device 101 can be various electronic devices with a display screen and supporting web browsing. In addition to the laptop computer 1011, the tablet computer 1012 or the mobile phone 1013, the terminal device 101 can also be an e-book reader, an MP3 player (Moving Picture Experts Group Audio Layer III), an MP4 (Moving Picture Experts Group Audio Layer IV) player, a laptop computer, a desktop computer, etc.

[0083] The server 103 may be a server that provides various services, such as a background server that provides support for web pages displayed on the terminal device 101 .

[0084] It should be noted that the task processing method provided in the embodiment of the present application is generally executed by a server / terminal device, and accordingly, the task processing device is generally arranged in the server / terminal device.

[0085] It should be understood that Figure 1 The number of terminal devices, networks and servers in the embodiment is only for illustration. Any number of terminal devices, networks and servers may be provided according to implementation requirements.

[0086] Continue to refer Figure 2 , showing a flowchart of an embodiment of a task processing method according to the present application. According to different requirements, the order of the steps in the flowchart can be changed, and some steps can be omitted. The task processing method provided in the embodiment of the present application can be applied to any scenario where task processing is required, and the task processing method can be applied to products in these scenarios, for example, financial task processing in the financial insurance field. The task processing method comprises the following steps:

[0087] Step S201, obtaining tasks to be processed.

[0088] In this embodiment, the task processing method is executed on the electronic device (eg Figure 1The server / terminal device shown in the figure) can obtain the image to be checked for duplicates through a wired connection or a wireless connection. It should be pointed out that the above-mentioned wireless connection method may include but is not limited to 3G / 4G / 5G connection, Wi-Fi connection, Bluetooth connection, Wi MAX connection, Zigbee connection, UWB (Ultra Wi DeBand) connection, and other wireless connection methods currently known or to be developed in the future. The executor of the present application may specifically be a task processing system, or a parallel task scheduling system, hereinafter referred to as the system. And the present application can be applied to the field of finance and insurance. The above-mentioned tasks to be processed are tasks that need to be executed. In the business scenario of task processing in finance and insurance, the above-mentioned tasks to be processed may include transaction tasks, payment tasks, claims tasks, and so on.

[0089] Step S202: split the task into multiple subtasks.

[0090] In this embodiment, the specific implementation process of splitting the task into multiple subtasks will be further described in detail in subsequent specific embodiments of the present application, and will not be elaborated on here.

[0091] Step S203: Obtain the dependency relationship and constraint conditions of each of the subtasks, and adjust the subtasks based on the constraint conditions to obtain corresponding target subtasks.

[0092] In this embodiment, the data dependency and control dependency between subtasks can be identified by reviewing the preset task documents and process models to obtain the above-mentioned dependency. Among them, the execution time window, resource type restriction, data validity check and other constraints of each subtask can be pre-defined according to business requirements or system limitations. These conditions may involve aspects such as the execution order, execution time, resource allocation and data quality of the tasks. In addition. By analyzing the impact of the constraints on the task scheduling and execution order of each subtask obtained by splitting, the possibility and efficiency of task execution under different constraints are evaluated, and it is determined whether it is necessary to adjust the task splitting or dependency to meet the constraints. If necessary, the subtask is adjusted accordingly based on the constraints to obtain the corresponding target subtask, and it is ensured that the obtained target subtask meets the above-mentioned constraints.

[0093] Step S204: construct a task dependency graph corresponding to the target subtask based on the dependency relationship.

[0094] In this embodiment, a directed graph, specifically a task dependency graph, may be used to represent the dependency relationship between target subtasks, including data dependency and control dependency, wherein the nodes in the task dependency graph represent target subtasks and the edges represent the dependency relationship.

[0095] Step S205 , topologically sorting the first subtask in the task dependency graph based on a preset topological sorting algorithm to obtain a corresponding first task sequence.

[0096] In this embodiment, the first subtask in the task dependency graph can be topologically sorted by using a topological sorting algorithm to determine the task execution order of the first subtask in the task dependency graph, thereby obtaining a first task sequence including the task execution order of the first subtask. The topological sorting algorithm can process the task dependencies in a directed acyclic graph and generate an execution plan that satisfies all dependencies and constraints.

[0097] Step S206: Filter out a second subtask from the first task sequence.

[0098] In this embodiment, the second subtask is a task that has no direct dependency in the first task sequence.

[0099] Step S207: obtaining the priority value of the second subtask, and performing sorting and adjustment processing on the first task sequence based on the priority value to obtain a corresponding second task sequence.

[0100] In this embodiment, the priority value of the second subtask is obtained, and the first task sequence is sorted and adjusted based on the priority value to obtain the specific implementation process of the corresponding second task sequence. This application will provide further detailed descriptions of this in subsequent specific embodiments and will not be elaborated on here.

[0101] Step S208: Based on a preset resource management algorithm, the second task sequence is allocated to corresponding target resources for execution.

[0102] In this embodiment, the specific implementation process of allocating the second task sequence to the corresponding target resources for execution based on the preset resource management algorithm will be further described in detail in subsequent specific embodiments of the present application and will not be elaborated on here.

[0103] The present application first obtains the task to be processed and splits the task into multiple subtasks; then obtains the dependency relationship and constraint conditions of each of the subtasks, and adjusts the subtasks based on the constraint conditions to obtain the corresponding target subtasks; then constructs a task dependency graph corresponding to the target subtask based on the dependency relationship; subsequently, topologically sorts the first subtask in the task dependency graph based on a preset topological sorting algorithm to obtain a corresponding first task sequence; and selects the second subtask from the first task sequence; wherein the second subtask is a task that has no direct dependency relationship in the first task sequence; further obtains the priority value of the second subtask, and sorts and adjusts the first task sequence based on the priority value to obtain a corresponding second task sequence; finally, based on a preset resource management algorithm, allocates the second task sequence to the corresponding target resource for execution. The present application splits the task to be processed into multiple subtasks, adjusts the subtasks based on the constraints of the subtasks to obtain target subtasks, and constructs a task dependency graph corresponding to the target subtask based on the dependency relationship of the subtasks, and then combines the topological sorting and priority sorting methods to perform parallel task sorting for the tasks to obtain the corresponding second task sequence, and finally combines the use of resource layout strategy and resource management algorithm to perform task allocation processing for the second task sequence, which can ensure that the subtasks in the second task sequence can be balanced. Allocated to various resources for concurrent processing, effectively improves the throughput and response speed of the system, while making full use of system resources, improving the system's resource utilization and task execution efficiency, which is beneficial to improving the overall processing efficiency and performance of the system.

[0104] In some optional implementations, step S207 includes the following steps:

[0105] Get the preset priority evaluation strategy.

[0106] In this embodiment, a priority evaluation strategy corresponding to task processing is pre-built according to actual business needs. Specifically, the evaluation criteria of the priority evaluation strategy include: evaluation criteria for clarifying task priorities, such as the urgency of the task (based on the deadline), execution time (short tasks first or long tasks first), resource requirements (resource-intensive tasks may have a lower priority to avoid resource conflicts), task importance, etc.

[0107] A priority evaluation process is performed on the second subtask based on the priority evaluation strategy to generate a priority value corresponding to the second subtask.

[0108] In this embodiment, a corresponding priority value can be calculated for each second subtask selected from the first task sequence according to the evaluation criteria of the priority evaluation strategy. This can be specifically performed by weighted summing of multiple factors (the urgency of the task, execution time, resource requirements, and task importance) or using other complex evaluation algorithms to calculate the priority.

[0109] The first task sequence is sorted and adjusted based on the priority value to obtain an adjusted first task sequence.

[0110] In this embodiment, all second subtasks are sorted according to the calculated priority values ​​to generate a priority list, and the priority list is used to adjust the sorting of the first task sequence, that is, the original sorting of the second subtasks in the first task sequence is replaced with the sorting in the priority list, thereby obtaining the adjusted first task sequence.

[0111] The first task sequence is used as the second task sequence.

[0112] The present application obtains a preset priority evaluation strategy; then performs a priority evaluation process on the second subtask based on the priority evaluation strategy to generate a priority value corresponding to the second subtask; then performs a sorting and adjustment process on the first task sequence based on the priority value to obtain an adjusted first task sequence; and subsequently uses the first task sequence as the second task sequence. The present application can quickly and accurately perform a priority evaluation process on the second subtask and generate a priority value corresponding to the second subtask by using a priority evaluation strategy, thereby ensuring the data accuracy of the priority value corresponding to the obtained second subtask. Subsequently, the first task sequence is sorted and adjusted based on the priority value, thereby completing the optimization of the task execution order in the first task sequence to obtain the second task sequence. The present application performs parallel task scheduling for tasks by combining the sorting methods of topological sorting and priority sorting, which is beneficial to improving the overall performance and efficiency of the system.

[0113] In some optional implementations of this embodiment, step S208 includes the following steps:

[0114] The resource requirement information of all the second subtasks included in the second task sequence is obtained.

[0115] In this embodiment, resource requirements of all the second subtasks included in the second task sequence can be evaluated, so that the key resources such as CPU time, memory size, network bandwidth, etc. required by each subtask during execution can be understood and used as corresponding resource requirement information. Alternatively, a machine learning model trained based on historical data can be used to predict resource requirement information of future tasks.

[0116] The corresponding total resource requirement information is calculated based on the resource requirement information of all the second subtasks.

[0117] In this embodiment, the resource requirement information of all the second subtasks may be summed up to obtain the corresponding total resource requirement information.

[0118] A corresponding resource layout strategy is constructed based on the total resource demand.

[0119] In this embodiment, after calculating the total resource requirement information required for all the second subtasks, the resource layout of the entire system can be further planned according to the total resource requirement information, and a corresponding resource layout strategy can be generated. The strategy content of the resource layout strategy may include: determining the number of servers to be deployed, the configuration information of each server, whether the existing resource pool needs to be expanded, etc. Among them, reasonable resource planning can ensure that the system can still maintain stable performance when facing high loads.

[0120] Based on the resource layout strategy and the resource management algorithm, the second task sequence is allocated to corresponding target resources for execution.

[0121] In this embodiment, the selection of the above resource management algorithm is not specifically limited and can be determined according to the actual task scheduling objectives, for example, polling, random, minimum number of connections, etc. In addition, the resource management algorithm can also be optimized according to factors such as task priority, resource requirements, system load, etc.

[0122] Specifically, after determining the resource layout strategy and resource management algorithm, each second subtask included in the second task sequence can be allocated to the most appropriate resource according to the obtained resource layout strategy and resource management algorithm to ensure resource utilization and load balance and avoid resource overload or idleness.

[0123] The present application obtains the resource requirement information of all the second subtasks contained in the second task sequence; then calculates the corresponding total resource requirement information based on the resource requirement information of all the second subtasks; then constructs a corresponding resource layout strategy based on the total resource requirement; and subsequently allocates the second task sequence to the corresponding target resource for execution based on the resource layout strategy and the resource management algorithm. The present application obtains the resource requirement information of all the second subtasks contained in the second task sequence, and calculates the corresponding total resource requirement information based on the resource requirement information of all the second subtasks, and then constructs a corresponding resource layout strategy based on the total resource requirement, and then allocates the second task sequence to the corresponding target resource for execution based on the resource layout strategy and the resource management algorithm. The present application combines the use of resource layout strategy and resource management algorithm to perform task allocation processing of the second task sequence, which can ensure that the subtasks in the second task sequence can be balanced and allocated to each resource for concurrent processing, effectively improving the throughput and response speed of the system, while making full use of system resources, improving resource utilization and task execution efficiency, and thus helping to improve the overall processing efficiency and performance of the system.

[0124] In some optional implementations, step S202 includes the following steps:

[0125] Call the preset process model.

[0126] In this embodiment, a suitable process modeling method can be selected to construct the above process model according to actual task characteristics and organizational needs. There is no specific limitation on the selection of the above process modeling method, for example, BPMN (Business Process Model and Notation), UML (Unified Modeling Language) activity diagram, etc. can be used.

[0127] The task is split based on the process model to obtain a corresponding plurality of split tasks.

[0128] In this embodiment, based on the use of the process model, a flow chart of a complex task is first drawn. The flow chart should contain elements such as a start node, an end node, activities (i.e., subtasks), decision points, and parallel / serial paths. Then, the splitting process for the task is implemented in the flow chart to obtain corresponding multiple split tasks. Specifically, in the flow chart, the key activities that are crucial to the achievement of the task objectives are first identified. Each key activity is then further refined into specific, executable subtasks. Ensure that each subtask is independent and has clear inputs and outputs. Subsequently, the dependencies, execution order, and parallel / serial paths between subtasks are clarified. This helps to understand the interaction and coordination between subtasks.

[0129] The split task is used as the subtask.

[0130] The present application calls a preset process model; then splits the task based on the process model to obtain a corresponding plurality of split tasks; and subsequently uses the split tasks as the subtasks. The present application can quickly and accurately complete the splitting of tasks based on the process model, thereby improving the processing efficiency of task splitting and ensuring the accuracy of the obtained subtasks. The subsequent processing of the split subtasks is conducive to improving the manageability, traceability and execution efficiency of the tasks.

[0131] In some optional implementations, after step S208, the electronic device may further perform the following steps:

[0132] During the execution of the task corresponding to the second task sequence, the task execution time of the third subtask included in the second task sequence is monitored based on a preset monitoring code; wherein the third subtask is any one of all the second subtasks.

[0133] In this embodiment, the monitoring code is a pre-written code for collecting the task execution time during the execution of the task. The monitoring code can be embedded in the task execution process corresponding to the second task sequence to monitor the task execution time of the third subtask included in the second task sequence.

[0134] Determine whether the task execution time is greater than a preset time threshold.

[0135] In this embodiment, a reasonable execution time threshold, or simply referred to as a time threshold, can be pre-set according to the task type and resource status, and a fault detection rule is defined: if the task execution time of a task exceeds or is greater than the preset time threshold, it is determined that the task has an abnormal situation.

[0136] If so, an exception is marked for the third subtask.

[0137] In this embodiment, when it is determined that the third subtask has an abnormal situation, the third subtask will be intelligently marked as "abnormal" or "failed", and relevant logs will be recorded.

[0138] Generate designated alarm information corresponding to the third subtask.

[0139] In this embodiment, the task identifier of the third subtask can be obtained and filled into the preset alarm information template to obtain the corresponding designated alarm information. The template content of the alarm information template can be written according to the actual alarm prompt requirements, which will not be described in detail here.

[0140] The specified alarm information is sent to the preset operation and maintenance personnel.

[0141] In this embodiment, the operation and maintenance personnel may be task administrators responsible for task management. The specified alarm information may be sent to the operation and maintenance personnel by email, SMS, message notification, etc., so as to display the abnormal state of the third subtask in a striking manner on the user interface and remind the operation and maintenance personnel to pay attention.

[0142] During the execution of tasks corresponding to the second task sequence, the present application monitors the task execution time of the third subtask included in the second task sequence based on a preset monitoring code; then determines whether the task execution time is greater than a preset time threshold; if so, performs an abnormal marking process on the third subtask; then generates a designated alarm message corresponding to the third subtask; and subsequently sends the designated alarm message to the preset operation and maintenance personnel. During the execution of tasks corresponding to the second task sequence, the present application also intelligently monitors the task execution time of the third subtask included in the second task sequence based on a preset monitoring code. If it is detected that the task execution time is greater than the preset time threshold, the third subtask will be intelligently marked as abnormal, and a designated alarm message corresponding to the third subtask will be generated, and the designated alarm message will be sent to the preset operation and maintenance personnel, so as to use a striking way to remind the operation and maintenance personnel of the abnormal state, which helps the operation and maintenance personnel to refer to the designated alarm message and then promptly adopt the abnormal handling mechanism for the third subtask, which is conducive to ensuring that the system can quickly resume normal operation after the abnormal handling is completed, and is conducive to ensuring the rapid and stable execution of tasks.

[0143] In some optional implementations of this embodiment, after step S208, the electronic device may further perform the following steps:

[0144] During the execution of the tasks corresponding to the second task sequence, resource usage information of the target resources is monitored based on a preset resource monitoring tool.

[0145] In this embodiment, the resource monitoring tool is a monitoring tool with a monitoring function. The resource usage information may include one or more of CPU usage, memory usage, disk space, network bandwidth, and the like.

[0146] It is determined whether there is designated resource usage information exceeding a preset usage threshold in the resource usage information.

[0147] In this embodiment, the resource usage information can be numerically compared with the corresponding usage threshold to determine whether there is designated resource usage information exceeding the preset usage threshold in the resource usage information. The above usage threshold may include one or more of a CPU usage threshold, a memory occupancy threshold, a disk space usage threshold, a network bandwidth threshold, etc. The values ​​of the CPU usage threshold, the memory occupancy threshold, the disk space usage threshold, and the network bandwidth threshold can be set according to the actual resource performance analysis requirements.

[0148] If so, determine the designated resource corresponding to the designated resource usage information.

[0149] In this embodiment, the designated resource usage information exceeding the above usage threshold may be screened out, and then the corresponding designated resource may be determined according to the designated resource usage information.

[0150] The designated resource is adjusted based on a preset resource adjustment policy.

[0151] In this embodiment, the designated resources can be adjusted according to the policy content of the above-mentioned resource adjustment policy. Among them, the policy content of the above-mentioned resource adjustment policy may include: if a resource load is too high, dynamically adjust the task allocation and migrate some tasks to other resources; when new resources are added to the system, tasks can be reallocated to balance the load; when it is found that the order of task execution is unreasonable, topological sorting and scheduling can be re-performed. In addition, containerization technology (such as Docker) and orchestration tools (such as Kuber netes) can be used to more conveniently realize the dynamic adjustment of resources. In addition, the effects of load balancing and resource allocation can be regularly evaluated to collect user feedback. And adjust the load balancing algorithm or resource allocation strategy according to the evaluation results. And introduce AI / ML technology to optimize resource management and load balancing, such as using reinforcement learning to dynamically adjust strategies.

[0152] In addition, the system load also has the function of automatically increasing or decreasing resources and performing intelligent resource allocation, thereby improving the system's elasticity and resource utilization.

[0153] During the execution of the task corresponding to the second task sequence, the present application monitors the resource usage information of the target resource based on a preset resource monitoring tool; then determines whether there is designated resource usage information exceeding a preset usage threshold in the resource usage information; if so, determines the designated resource corresponding to the designated resource usage information; and subsequently adjusts the designated resource based on a preset resource adjustment strategy. During the execution of the task corresponding to the second task sequence, the present application also intelligently monitors the resource usage information of the target resource based on a preset resource monitoring tool; if it is detected whether there is designated resource usage information exceeding a preset usage threshold in the resource usage information, then the designated resource corresponding to the designated resource usage information is intelligently adjusted based on a preset resource adjustment strategy, thereby effectively ensuring the rational use of resources and the rapid and stable execution of tasks, and effectively realizing efficient and flexible resource management.

[0154] In some optional implementations of this embodiment, after step S208, the electronic device may further perform the following steps:

[0155] After completing the task processing for the second task sequence, the task processing results corresponding to the second task sequence are collected.

[0156] In this embodiment, the task processing result may include data on the processing process and results of all second subtasks included in the second task sequence, and may specifically include data such as processing time, measures taken, and recovery status.

[0157] Determine a target storage method corresponding to the task processing result.

[0158] In this embodiment, the selection of the above-mentioned target storage method is specifically limited and can be set according to actual storage needs. For example, any one of a local database, a cloud server, a network disk, a blockchain, etc. can be used. Among them, blockchain storage is preferably used as the above-mentioned target storage method. By using blockchain to store and manage task processing results, the security and non-tamperability of task processing results can be effectively guaranteed.

[0159] The task processing result is stored based on the target storage mode.

[0160] In this embodiment, the target storage medium corresponding to the target storage method may be determined, and then the task processing result may be stored in the target storage medium to complete the storage process of the task processing result.

[0161] After completing the task processing for the second task sequence, the present application collects the task processing results corresponding to the second task sequence; then determines the target storage method corresponding to the task processing results; and subsequently stores and processes the task processing results based on the target storage method. After completing the task processing for the second task sequence, the present application will also intelligently collect the task processing results corresponding to the second task sequence, and then use the corresponding target storage method to store and process the task processing results, thereby effectively ensuring the data security and non-tamperability of the task processing results, and improving the storage intelligence of the task processing results. It is also beneficial for subsequent relevant personnel to evaluate and analyze the task processing results, summarize lessons learned, and continuously improve fault handling strategies and processes, thereby improving the user experience of relevant personnel.

[0162] In some optional implementations, the present application uses communication means and mechanisms such as message queues, shared memory or distributed file systems to achieve data sharing between service orchestration tasks and ensure data consistency and correct transmission.

[0163] It should be understood that the order of execution of the steps in the above embodiment does not necessarily mean the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiment of the present invention.

[0164] It should be emphasized that in order to further ensure the privacy and security of the above-mentioned second task sequence, the above-mentioned second task sequence can also be stored in a node of a blockchain.

[0165] The blockchain referred to in this application is a new application model of computer technologies such as distributed data storage, peer-to-peer transmission, consensus mechanism, encryption algorithm, etc. Blockchain is essentially a decentralized database, a string of data blocks generated by cryptographic methods. Each data block contains a batch of network transaction information, which is used to verify the validity of its information (anti-counterfeiting) and generate the next block. Blockchain can include the underlying blockchain platform, platform product service layer, and application service layer.

[0166] The embodiments of the present application can acquire and process relevant data based on artificial intelligence technology. Artificial Intelligence (AI) is the theory, method, technology and application system that uses digital computers or machines controlled by digital computers to simulate, extend and expand human intelligence, perceive the environment, acquire knowledge and use knowledge to obtain the best results.

[0167] AI basic technologies generally include sensors, dedicated AI chips, cloud computing, distributed storage, big data processing technology, operation / interaction systems, mechatronics, etc. AI software technologies mainly include computer vision technology, robotics technology, biometrics technology, speech processing technology, natural language processing technology, and machine learning / deep learning.

[0168] Those skilled in the art can understand that all or part of the processes in the above-mentioned embodiments can be implemented by instructing the relevant hardware through computer-readable instructions, and the computer-readable instructions can be stored in a computer-readable storage medium. When the program is executed, it can include the processes of the embodiments of the above-mentioned methods. Among them, the aforementioned storage medium can be a non-volatile storage medium such as a disk, an optical disk, a read-only memory (ROM), or a random access memory (RAM).

[0169] It should be understood that, although the steps in the flowchart of the accompanying drawings are displayed in sequence as indicated by the arrows, these steps are not necessarily executed in sequence in the order indicated by the arrows. Unless otherwise specified herein, there is no strict order restriction on the execution of these steps, and they can be executed in other orders. Moreover, at least a part of the steps in the flowchart of the accompanying drawings may include multiple sub-steps or multiple stages, and these sub-steps or stages are not necessarily executed at the same time, but can be executed at different times, and their execution order is not necessarily sequential, but can be executed in turn or alternately with other steps or at least a part of the sub-steps or stages of other steps.

[0170] Further references Figure 3 , as a response to the above Figure 2 The present application provides an embodiment of a task processing device, and the device embodiment is similar to Figure 2 Corresponding to the method embodiment shown, the device can be specifically applied to various electronic devices.

[0171] like Figure 3 As shown, the task processing device 300 described in this embodiment includes: an acquisition module 301, a splitting module 302, a first adjustment module 303, a construction module 304, a sorting module 305, a screening module 306, a second adjustment module 307 and an allocation module 308. Among them:

[0172] An acquisition module 301 is used to acquire tasks to be processed;

[0173] A splitting module 302 is used to split the task into multiple subtasks;

[0174] The first adjustment module 303 is used to obtain the dependency relationship and constraint conditions of each of the subtasks, and adjust the subtasks based on the constraint conditions to obtain corresponding target subtasks;

[0175] A construction module 304 is used to construct a task dependency graph corresponding to the target subtask based on the dependency relationship;

[0176] A sorting module 305 is used to perform topological sorting on the first subtask in the task dependency graph based on a preset topological sorting algorithm to obtain a corresponding first task sequence;

[0177] A screening module 306 is used to screen out a second subtask from the first task sequence; wherein the second subtask is a task that has no direct dependency in the first task sequence;

[0178] A second adjustment module 307 is used to obtain the priority value of the second subtask, and perform sorting and adjustment processing on the first task sequence based on the priority value to obtain a corresponding second task sequence;

[0179] The allocation module 308 is used to allocate the second task sequence to the corresponding target resource for execution based on a preset resource management algorithm.

[0180] In this embodiment, the operations performed by the above modules or units correspond one-to-one to the steps of the task processing method in the above-mentioned implementation mode, and are not described in detail here.

[0181] In some optional implementations of this embodiment, the second adjustment module 307 includes:

[0182] A first acquisition submodule is used to acquire a preset priority evaluation strategy;

[0183] an evaluation submodule, configured to perform a priority evaluation process on the second subtask based on the priority evaluation strategy, and generate a priority value corresponding to the second subtask;

[0184] An adjustment submodule, configured to perform a sorting adjustment process on the first task sequence based on the priority value to obtain an adjusted first task sequence;

[0185] The first determining submodule is configured to use the first task sequence as the second task sequence.

[0186] In this embodiment, the operations performed by the above modules or units correspond one-to-one to the steps of the task processing method in the above-mentioned implementation mode, and are not described in detail here.

[0187] In some optional implementations of this embodiment, the allocation module 308 includes:

[0188] A second acquisition submodule, used to acquire resource requirement information of all the second subtasks included in the second task sequence;

[0189] A calculation submodule, used to calculate corresponding total resource requirement information based on the resource requirement information of all the second subtasks;

[0190] A construction submodule, used to construct a corresponding resource layout strategy based on the total resource demand;

[0191] The allocation submodule is used to allocate the second task sequence to the corresponding target resources for execution based on the resource layout strategy and the resource management algorithm.

[0192] In this embodiment, the operations performed by the above modules or units correspond one-to-one to the steps of the task processing method in the above-mentioned implementation mode, and are not described in detail here.

[0193] In some optional implementations of this embodiment, the splitting module 302 includes:

[0194] Call submodule, used to call the preset process model;

[0195] A splitting submodule, used for splitting the task based on the process model to obtain a corresponding plurality of split tasks;

[0196] The second determining submodule is used to use the split task as the subtask.

[0197] In this embodiment, the operations performed by the above modules or units correspond one-to-one to the steps of the task processing method in the above-mentioned implementation mode, and are not described in detail here.

[0198] In some optional implementations of this embodiment, the task processing device further includes:

[0199] A first monitoring module, used for monitoring the task execution time of a third subtask included in the second task sequence based on a preset monitoring code during the execution of the task corresponding to the second task sequence; wherein the third subtask is any one of all the second subtasks;

[0200] A first judging module, used to judge whether the task execution time is greater than a preset time threshold;

[0201] A marking module, configured to, if yes, mark the third subtask as abnormal;

[0202] A generating module, used for generating designated alarm information corresponding to the third subtask;

[0203] The sending module is used to send the specified alarm information to the preset operation and maintenance personnel.

[0204] In this embodiment, the operations performed by the above modules or units correspond one-to-one to the steps of the task processing method in the above-mentioned implementation mode, and are not described in detail here.

[0205] In some optional implementations of this embodiment, the task processing device further includes:

[0206] A second monitoring module, used to monitor resource usage information of the target resource based on a preset resource monitoring tool during the execution of the task corresponding to the second task sequence;

[0207] A second determination module is used to determine whether there is designated resource usage information exceeding a preset usage threshold in the resource usage information;

[0208] A first determining module, configured to determine, if yes, a designated resource corresponding to the designated resource usage information;

[0209] The third adjustment module is used to adjust the designated resource based on a preset resource adjustment strategy.

[0210] In this embodiment, the operations performed by the above modules or units correspond one-to-one to the steps of the task processing method in the above-mentioned implementation mode, and are not described in detail here.

[0211] In some optional implementations of this embodiment, the task processing device further includes:

[0212] A collecting module, used for collecting task processing results corresponding to the second task sequence after completing task processing for the second task sequence;

[0213] A second determination module, used to determine a target storage method corresponding to the task processing result;

[0214] A storage module is used to store the task processing result based on the target storage mode.

[0215] In this embodiment, the operations performed by the above modules or units correspond one-to-one to the steps of the task processing method in the above-mentioned implementation mode, and are not described in detail here.

[0216] To solve the above technical problems, the present application also provides a computer device. Figure 4 , Figure 4 This is a basic structural block diagram of the computer device in this embodiment.

[0217] The computer device 4 includes a memory 41, a processor 42, and a network interface 43 that are interconnected through a system bus. It should be noted that the figure only shows a computer device 4 with components 41-43, but it should be understood that it is not required to implement all the components shown, and more or fewer components can be implemented instead. Among them, those skilled in the art can understand that the computer device here is a device that can automatically perform numerical calculations and / or information processing according to pre-set or stored instructions, and its hardware includes but is not limited to microprocessors, application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), digital processors (DSPs), embedded devices, etc.

[0218] The computer device may be a computing device such as a desktop computer, a notebook, a PDA, a cloud server, etc. The computer device may interact with a user through a keyboard, a mouse, a remote controller, a touch pad, or a voice control device.

[0219] The memory 41 includes at least one type of readable storage medium, and the readable storage medium includes flash memory, hard disk, multimedia card, card-type memory (for example, SD or DX memory, etc.), random access memory (RAM), static random access memory (SRAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), programmable read-only memory (PROM), magnetic memory, disk, optical disk, etc. In some embodiments, the memory 41 can be an internal storage unit of the computer device 4, such as a hard disk or memory of the computer device 4. In other embodiments, the memory 41 can also be an external storage device of the computer device 4, such as a plug-in hard disk equipped on the computer device 4, a smart memory card (Smart Med ia Card, SMC), a secure digital (Secure Digital, SD) card, a flash card (Flash Card), etc. Of course, the memory 41 can also include both the internal storage unit of the computer device 4 and its external storage device. In this embodiment, the memory 41 is generally used to store the operating system and various application software installed on the computer device 4, such as computer-readable instructions of the task processing method, etc. In addition, the memory 41 can also be used to temporarily store various types of data that have been output or are to be output.

[0220] The processor 42 may be a central processing unit (CPU), a controller, a microcontroller, a microprocessor, or other data processing chips in some embodiments. The processor 42 is generally used to control the overall operation of the computer device 4. In this embodiment, the processor 42 is used to run the computer-readable instructions stored in the memory 41 or process data, such as computer-readable instructions for running the task processing method.

[0221] The network interface 43 may include a wireless network interface or a wired network interface. The network interface 43 is generally used to establish a communication connection between the computer device 4 and other electronic devices.

[0222] Compared with the prior art, the embodiments of the present application have the following beneficial effects:

[0223] In an embodiment of the present application, the task to be processed is split into multiple subtasks, and the subtasks are adjusted based on the constraints of the subtasks to obtain the target subtasks, and a task dependency graph corresponding to the target subtask is constructed based on the dependency relationship of the subtasks, and then the parallel task sorting of the tasks is performed in combination with the topological sorting and priority sorting to obtain the corresponding second task sequence, and finally, the task allocation processing of the second task sequence is performed by combining the use of resource layout strategy and resource management algorithm, which can ensure that the subtasks in the second task sequence can be balanced and allocated to various resources for concurrent processing, effectively improving the throughput and response speed of the system, while making full use of system resources, improving the system's resource utilization and task execution efficiency, and thus helping to improve the overall processing efficiency and performance of the system.

[0224] The present application also provides another implementation, namely, providing a computer-readable storage medium, wherein the computer-readable storage medium stores computer-readable instructions, and the computer-readable instructions can be executed by at least one processor to enable the at least one processor to perform the steps of the task processing method as described above.

[0225] Compared with the prior art, the embodiments of the present application have the following beneficial effects:

[0226] In an embodiment of the present application, the task to be processed is split into multiple subtasks, and the subtasks are adjusted based on the constraints of the subtasks to obtain the target subtasks, and a task dependency graph corresponding to the target subtask is constructed based on the dependency relationship of the subtasks, and then the parallel task sorting of the tasks is performed in combination with the topological sorting and priority sorting to obtain the corresponding second task sequence, and finally, the task allocation processing of the second task sequence is performed by combining the use of resource layout strategy and resource management algorithm, which can ensure that the subtasks in the second task sequence can be balanced and allocated to various resources for concurrent processing, effectively improving the throughput and response speed of the system, while making full use of system resources, improving the system's resource utilization and task execution efficiency, and thus helping to improve the overall processing efficiency and performance of the system.

[0227] Through the description of the above implementation methods, those skilled in the art can clearly understand that the above-mentioned embodiment methods can be implemented by means of software plus a necessary general hardware platform, and of course by hardware, but in many cases the former is a better implementation method. Based on such an understanding, the technical solution of the present application, or the part that contributes to the prior art, can be embodied in the form of a software product, which is stored in a storage medium (such as ROM / RAM, magnetic disk, optical disk), and includes a number of instructions for a terminal device (which can be a mobile phone, computer, server, air conditioner, or network device, etc.) to execute the methods described in each embodiment of the present application.

[0228] Obviously, the embodiments described above are only some embodiments of the present application, rather than all embodiments. The preferred embodiments of the present application are given in the accompanying drawings, but they do not limit the patent scope of the present application. The present application can be implemented in many different forms. On the contrary, the purpose of providing these embodiments is to make the understanding of the disclosure of the present application more thorough and comprehensive. Although the present application is described in detail with reference to the aforementioned embodiments, for those skilled in the art, it is still possible to modify the technical solutions recorded in the aforementioned specific implementation methods, or to perform equivalent replacement of some of the technical features therein. Any equivalent structure made using the contents of the specification and drawings of this application, directly or indirectly used in other related technical fields, is similarly within the scope of patent protection of this application.

Claims

1. A task processing method, characterized in that: The steps include: Get pending tasks; Splitting the task into a plurality of subtasks; Obtaining the dependencies and constraints of each of the subtasks, and adjusting the subtasks based on the constraints to obtain corresponding target subtasks; Constructing a task dependency graph corresponding to the target subtask based on the dependency relationship; Performing topological sorting on the first subtask in the task dependency graph based on a preset topological sorting algorithm to obtain a corresponding first task sequence; Filtering out a second subtask from the first task sequence; wherein the second subtask is a task that has no direct dependency in the first task sequence; Obtaining a priority value of the second subtask, and performing sorting and adjustment processing on the first task sequence based on the priority value to obtain a corresponding second task sequence; Based on a preset resource management algorithm, the second task sequence is allocated to corresponding target resources for execution.

2. The task processing method according to claim 1, characterized in that: The step of obtaining the priority value of the second subtask and performing sorting and adjustment processing on the first task sequence based on the priority value to obtain the corresponding second task sequence specifically includes: Get the preset priority evaluation strategy; Performing a priority evaluation process on the second subtask based on the priority evaluation strategy to generate a priority value corresponding to the second subtask; Performing sorting and adjustment processing on the first task sequence based on the priority value to obtain an adjusted first task sequence; The first task sequence is used as the second task sequence.

3. The task processing method according to claim 1, characterized in that: The step of allocating the second task sequence to the corresponding target resource for execution based on the preset resource management algorithm specifically includes: Acquire resource requirement information of all the second subtasks included in the second task sequence; Calculate the corresponding total resource requirement information based on the resource requirement information of all the second subtasks; Building a corresponding resource layout strategy based on the total resource demand; Based on the resource layout strategy and the resource management algorithm, the second task sequence is allocated to corresponding target resources for execution.

4. The task processing method according to claim 1, characterized in that: The step of splitting the task into multiple subtasks specifically includes: Call the preset process model; Splitting the task based on the process model to obtain a corresponding plurality of split tasks; The split task is used as the subtask.

5. The task processing method according to claim 1, characterized in that: After the step of allocating the second task sequence to the corresponding target resource for execution based on the preset resource management algorithm, the method further includes: During the execution of the task corresponding to the second task sequence, monitoring the task execution time of the third subtask included in the second task sequence based on a preset monitoring code; wherein the third subtask is any one of all the second subtasks; Determine whether the task execution time is greater than a preset time threshold; If yes, marking the third subtask as abnormal; Generate designated alarm information corresponding to the third subtask; The specified alarm information is sent to the preset operation and maintenance personnel.

6. The task processing method according to claim 1, characterized in that: After the step of allocating the second task sequence to the corresponding target resource for execution based on the preset resource management algorithm, the method further includes: During the execution of the task corresponding to the second task sequence, monitoring the resource usage information of the target resource based on a preset resource monitoring tool; Determining whether there is designated resource usage information exceeding a preset usage threshold in the resource usage information; If so, determining the designated resource corresponding to the designated resource usage information; The designated resource is adjusted based on a preset resource adjustment policy.

7. The task processing method according to claim 1, characterized in that: After the step of allocating the second task sequence to the corresponding target resource for execution based on the preset resource management algorithm, the method further includes: After completing the task processing for the second task sequence, collecting the task processing results corresponding to the second task sequence; Determining a target storage method corresponding to the task processing result; The task processing result is stored based on the target storage mode.

8. A task processing device, characterized in that: include: The acquisition module is used to obtain tasks to be processed; A splitting module, used for splitting the task into multiple subtasks; A first adjustment module, used to obtain the dependency relationship and constraint conditions of each of the subtasks, and adjust the subtasks based on the constraint conditions to obtain corresponding target subtasks; A construction module, used to construct a task dependency graph corresponding to the target subtask based on the dependency relationship; A sorting module, used for topologically sorting the first subtask in the task dependency graph based on a preset topological sorting algorithm to obtain a corresponding first task sequence; A screening module, used to screen out a second subtask from the first task sequence; wherein the second subtask is a task that has no direct dependency in the first task sequence; A second adjustment module, used for obtaining the priority value of the second subtask, and performing sorting and adjustment processing on the first task sequence based on the priority value to obtain a corresponding second task sequence; The allocation module is used to allocate the second task sequence to the corresponding target resources for execution based on a preset resource management algorithm.

9. A computer device, characterized in that: The method comprises a memory and a processor, wherein the memory stores computer-readable instructions, and the processor implements the steps of the task processing method according to any one of claims 1 to 7 when executing the computer-readable instructions.

10. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores computer-readable instructions, and when the computer-readable instructions are executed by a processor, the steps of the task processing method according to any one of claims 1 to 7 are implemented.

Images