Task management method and device, computer equipment, storage medium and product
Time chain mapping table manages timing tasks, and time nodes and priority axis are used to solve the problem of low-efficiency timing task management in the existing technology, and efficient task management and breakpoint execution in weak or off-net environments are achieved.
Patent Information
- Application Number
- CN202510326685.7
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2025-03-19
- Publication Date
- 2025-08-12
AI Technical Summary
The existing timing task management scheme is inefficient in multi-task sorting, especially when inserting high-priority tasks, and fails in the case of disconnection or weak network, and fails to achieve breakpoint execution.
Time chain mapping table is used to manage timing tasks, and time nodes and priority are used as the two coordinate axes to directly find the execution order of timing tasks. The execution order of tasks is obtained through the two dimensions of the time chain mapping table, reducing the number of traversals, improving operation efficiency, and managing tasks locally on the user terminal.
In the case of weak network or disconnection, timed tasks can still be executed in sequence, which improves the operation efficiency of task management, supports insertion and breakpoint execution of high-priority tasks, and reduces algorithm complexity.
Smart Images
Figure CN120469771A_ABST
Abstract
Description
Technical Field
[0001] The present disclosure relates to the field of task processing technology, and in particular to a task management method and apparatus, computer equipment, storage medium, and product. Background Art
[0002] Current scheduled task management systems often use a method to sequentially iterate through each scheduled task, comparing the priority of the new scheduled task with the remaining scheduled tasks. Once the scheduled playback schedule list is updated, the traversal algorithm is executed multiple times, resulting in extremely low efficiency. Summary of the Invention
[0003] In view of the above problems, the present disclosure is proposed. The present disclosure provides a task management method and apparatus, a computer device, a storage medium and a product.
[0004] According to one aspect of the present disclosure, a task management method is provided, including: managing scheduled tasks using a time chain mapping table; wherein the time chain mapping table uses the time node as the first coordinate axis, and the second coordinate axis corresponding to any time node is used to mount each scheduled task in order of priority from high to low; and executing each scheduled task according to the time chain mapping table.
[0005] According to another aspect of the present disclosure, a task management device is provided, including: a management module for managing scheduled tasks using a time chain mapping table; wherein the time chain mapping table uses the time node as the first coordinate axis, and the second coordinate axis corresponding to any time node is used to mount each scheduled task in order from high to low priority; an execution module for executing each scheduled task according to the time chain mapping table.
[0006] According to another aspect of the present disclosure, a computer device is provided, including a memory, a processor, and a computer program stored in the memory, wherein the processor executes the computer program to implement the method described in any one of the above embodiments.
[0007] According to another aspect of the present disclosure, a computer-readable storage medium is provided, on which a computer program / instruction is stored. When the computer program / instruction is executed by a processor, the method described in any one of the above embodiments is implemented.
[0008] According to another aspect of the present disclosure, a computer program product is provided, including a computer program / instruction, which implements the method described in any one of the above embodiments when executed by a processor.
[0009] As will be described in detail below, a task management method and apparatus, computer equipment, storage medium and product according to an embodiment of the present disclosure. The present disclosure uses a time chain mapping table to manage scheduled tasks, first obtaining the time nodes for the execution of each task according to the first coordinate axis of the time chain mapping table, and then obtaining the execution order of the scheduled tasks executed at the same time node according to the second coordinate axis. According to the two dimensions of the search time chain mapping table, the execution order of each scheduled task can be obtained. In this way, compared with the need to traverse all scheduled tasks in sequence each time a task is executed, the method adopted by the present disclosure only needs to query in the existing time chain mapping table, and the time complexity is greatly reduced to a certain extent, thereby improving the operating efficiency.
[0010] It is to be understood that both the foregoing general description and the following detailed description are exemplary, and are intended to provide further explanation of the technology as claimed. BRIEF DESCRIPTION OF THE DRAWINGS
[0011] The above and other purposes, features, and advantages of the present disclosure will become more apparent through a more detailed description of the embodiments of the present disclosure in conjunction with the accompanying drawings. The accompanying drawings are intended to provide a further understanding of the embodiments of the present disclosure and constitute a part of the specification. Together with the embodiments of the present disclosure, they are used to explain the present disclosure and are not intended to limit the present disclosure. In the drawings, the same reference numerals generally represent the same components or steps.
[0012] Figure 1 It is a flowchart illustrating a task management method according to an embodiment of the present disclosure.
[0013] Figure 2 It is a schematic diagram illustrating a music public broadcasting platform according to an embodiment of the present disclosure.
[0014] Figure 3 It is a schematic diagram illustrating a time chain mapping table according to an embodiment of the present disclosure.
[0015] Figure 4 It is a schematic diagram illustrating a time chain mapping table after a time node is inserted according to an embodiment of the present disclosure.
[0016] Figure 5 2 is a schematic diagram illustrating a time chain mapping table after a timed task is inserted according to an embodiment of the present disclosure.
[0017] Figure 6 It is a schematic diagram illustrating a task management process according to an embodiment of the present disclosure.
[0018] Figure 7 is a block diagram illustrating a task management apparatus according to an embodiment of the present disclosure.
[0019] Figure 8is a hardware block diagram illustrating a computer device according to an embodiment of the present disclosure.
[0020] Figure 9 is a schematic diagram illustrating a computer-readable storage medium according to an embodiment of the present disclosure. DETAILED DESCRIPTION
[0021] In order to make the purpose, technical solutions and advantages of the present disclosure more apparent, the following will describe in detail exemplary embodiments of the present disclosure with reference to the accompanying drawings. Obviously, the described embodiments are only a part of the embodiments of the present disclosure, rather than all the embodiments of the present disclosure, and it should be understood that the present disclosure is not limited to the exemplary embodiments described herein.
[0022] Currently, existing technologies for sequencing multiple scheduled tasks often use a double-loop algorithm, which requires iterating through each scheduled task in turn and comparing their priorities. This approach has an algorithmic complexity of n(n-1). Adding a new scheduled task during execution requires multiple iterations of the algorithm, resulting in low efficiency.
[0023] Furthermore, because current scheduled task management solutions are mostly server-side, they require a message communication mechanism with user terminals and rely on high-computing server resources. Scheduled tasks will fail when facing a disconnected or weak network.
[0024] In addition, current scheduled task management solutions are mostly used in non-preemptive task execution scenarios and cannot handle high-priority tasks inserted midway. Once inserted, the preempted task will become invalid or re-executed, and there is no breakpoint execution capability.
[0025] In order to solve the above problems, the present disclosure provides a task management method that uses the two coordinate axes of the time chain table to directly find the execution order of each scheduled task. Figure 1 , Figure 1 is a flowchart illustrating a task management method according to an embodiment of the present disclosure, such as Figure 1 As shown, the above method specifically includes:
[0026] S101, using a time chain mapping table to manage scheduled tasks; wherein, the time chain mapping table uses the time node as the first coordinate axis, and the second coordinate axis corresponding to any time node is used to mount each scheduled task in order of priority from high to low.
[0027] In this embodiment, the method can be applied to various multi-scheduled task management scenarios based on user terminals or web platforms, including but not limited to at least one of the following: music platform, e-commerce platform, city management, and financial services.
[0028] The user terminals here include but are not limited to: smartphones, tablets, smart TVs, and personal computers.
[0029] The time chain mapping table is directly stored in the user terminal. The user terminal or the web platform can create or update the time chain mapping table by interacting with the server. This allows each scheduled task to be executed in sequence even when the network is weak or disconnected.
[0030] The time chain mapping table includes at least two dimensions: time node and priority. Any time node has at least one scheduled task attached to it. Scheduled tasks under the same time node are sorted by priority, and each time node is sorted in chronological order.
[0031] For example, you can refer to Figure 3 , Figure 3 is a schematic diagram illustrating a time chain mapping table according to an embodiment of the present disclosure, such as Figure 3 As shown, the vertical axis (i.e., the first coordinate axis) of the time chain mapping table is the time node, and the horizontal axis (i.e., the second coordinate axis) is the scheduled task mounted under the time node. The scheduled tasks are sorted from high to low priority according to the direction of the arrow extension.
[0032] Before executing a scheduled task, you can first obtain the latest time chain mapping table. First, find the time node closest to the current time on the first coordinate axis. Then, based on the found time node, find the scheduled task with the highest priority. This scheduled task is the scheduled task that needs to be executed.
[0033] S102: Execute each scheduled task according to the time chain mapping table.
[0034] According to the time chain mapping table and the above operations, each scheduled task can be executed in sequence.
[0035] In summary, the present disclosure utilizes a time chain mapping table to manage scheduled tasks. First, the time nodes for executing each task are obtained according to the first coordinate axis of the time chain mapping table, and then the execution order of the scheduled tasks executed at the same time node is obtained according to the second coordinate axis. By searching the two dimensions of the time chain mapping table, the execution order of each scheduled task can be obtained. In this way, compared with the need to traverse all scheduled tasks in sequence each time a task is executed, the method adopted by the present disclosure only needs to query in the existing time chain mapping table, and the time complexity is greatly reduced to a certain extent, thereby improving the operating efficiency.
[0036] In step S101, the user terminal may create or update the time chain mapping table by interacting with the server. The specific process of creating or updating may include:
[0037] Obtaining task information for each scheduled task, the task information including at least: task start time and task priority;
[0038] Based on the task information, the time chain mapping table is constructed or updated.
[0039] In this embodiment, the user terminal can first obtain task information for each scheduled task. This task information is used to create or update the time chain mapping table. Based on the two dimensions of the time chain mapping table, the task information includes at least the task start time and the task priority. Update operations include, but are not limited to, adding, deleting, and adjusting.
[0040] The task start time, or the time node where the scheduled task is located, is used to construct the first coordinate axis of the time chain mapping table. The task priority determines the mounting order of the scheduled tasks corresponding to the time nodes in the second coordinate axis.
[0041] Furthermore, the task information may also include at least one of the following: task identification, task name, task end time, task execution status, current task identification, current task progress, and task list.
[0042] The task identifier includes but is not limited to at least one of the following: a hash value, a digital sequence, a character string, and a digital library primary key.
[0043] Taking the application of this method to the music platform as an example, Figure 2 It is a schematic diagram illustrating a music public broadcasting platform according to an embodiment of the present disclosure, where users can set task information on the music platform.
[0044] For task information, please refer to the following table:
[0045]
[0046] The task ID is the task identifier, the currently playing song ID is the current task identifier, and the currently playing song progress is the current task progress. When the task execution status is 0, it means that the current time node has never been executed. When the task execution status is 1, it means that the current time node has been executed. After obtaining the task information, you can obtain each song (i.e., scheduled task) based on the song list ID. Please refer to the table below for details.
[0047]
[0048] Based on this, when creating or updating the time chain mapping table, it is necessary to consider whether the time node in the current time chain mapping table already exists. There are different implementation methods when updating or creating the time chain mapping table.
[0049] When the task start time of the current scheduled task does not exist in the time chain mapping table, that is, the task start time of the scheduled task does not find the same time node in the time chain mapping table, the time node corresponding to the task start time can be inserted into the time chain mapping table in chronological order, and the scheduled task can be mounted under the time node.
[0050] For example, if the current corresponding time chain mapping table is Figure 3 When the time chain mapping table is updated with a scheduled task starting at 8:00 and with a task identifier of 122ags, we can get Figure 3 The time chain mapping table shows that the time node of 8:00 does not exist in the table. Next, the time node of 8:00 can be inserted into the Figure 3 In the time chain mapping table, the updated time chain mapping table is obtained. Figure 4 is a schematic diagram illustrating a time chain mapping table after a time node is inserted according to an embodiment of the present disclosure, such as Figure 4 As shown in the figure, after inserting the time node, the 122ags scheduled task is mounted under the 8:00 time node.
[0051] or,
[0052] When the task start time of the current scheduled task exists in the time chain mapping table, that is, when the task start time of the scheduled task can find the same time node in the time chain mapping table, the priority of the scheduled task and the mounted task of the time node can be compared, and the scheduled task can be mounted under the time node in order of priority from high to low.
[0053] For example, if the current corresponding time chain mapping table is still Figure 3 When the time chain mapping table is updated with a scheduled task that starts at 7:35, has a task ID of 242yas, and a priority of 4, you can Figure 3 Next, compare 242yas with Figure 3 The priority of the scheduled tasks mounted at 7:35 in the middle node is compared. For details, please refer to Figure 5 , Figure 5 is a schematic diagram illustrating a time chain mapping table after inserting a timed task according to an embodiment of the present disclosure, such as Figure 5 As shown in the figure, 242yas has the highest priority. Therefore, 242yas can be executed first at the node of 7:35.
[0054] There are multiple ways to obtain the execution order of scheduled tasks when executing each scheduled task mounted at each time node.
[0055] Preferably, the execution order of the scheduled tasks can be obtained based on the second hash value of the time node. The second hash value is formed by arranging the first hash values of each scheduled task mounted on the time node according to priority. The first hash value can uniquely represent a scheduled task.
[0056] If the task execution order is determined according to the second hash value of the time node as described above, when the time node is mounted and updated, the first hash value of the scheduled task can be obtained and the first hash value can be spliced into the second hash value of the time node in order of priority.
[0057] For example, see Figure 3 and Figure 5 .exist Figure 3 In the example, the first hash value of the scheduled task mounted at node 7:35 is 272yus and 302bgs. According to the priority sorting, the second hash value of node 7:35 is 272yus302bgs. Figure 5 In the example, at 7:35 on the node, the mount task 242yas is updated. Sorted by priority, 242yas has the highest priority, so 242yas is placed at the top of all scheduled tasks, resulting in the updated second hash value: 242yas272yus302bgs.
[0058] In this way, before executing a task, the user terminal only needs to obtain the second hash value of any time node to obtain the execution order of all scheduled tasks at that time node. Even in the case of weak network or network disconnection, the scheduled task can continue to be executed based on the existing second hash value.
[0059] Based on the management process of the aforementioned time chain mapping table, a time poller can be used to obtain updated tasks.
[0060] Exemplarily, this step may include:
[0061] Use time poller to poll tasks;
[0062] Move the scheduled task closest to the current time and with the highest priority into the execution queue;
[0063] The execution queue is used to execute each scheduled task.
[0064] In this embodiment, the time poller can obtain the scheduled task closest to the current time and with the highest priority in the latest time chain mapping table through an asynchronous thread within a fixed time interval (for example, polling once every five minutes), and move the scheduled task into the execution list for execution.
[0065] In this way, it can be ensured that when the time chain mapping table is updated, the execution list can obtain the updated scheduled tasks in a timely manner, thereby managing the execution list in a timely manner.
[0066] If there is a new task in the latest time chain mapping table and the new task is mounted under the current time node, the priority of the new task is compared with the current task being executed. If the priority of the new task is higher than the current task, the current task is paused and the new task is executed.
[0067] If a new task is mounted at a new time node and the new time node is closer to the current time, the new task is executed.
[0068] The methods for obtaining the newly added tasks include but are not limited to second hash value comparison, change log, server notification, and incremental update.
[0069] Optionally, when executing a new task and the current task has not yet finished playing, the pause position of the current task can be recorded. Further, after the new task is completed, if the current task is still the scheduled task closest to the current time and has the highest priority, it can jump to the pause position of the current task and continue executing the current task.
[0070] Furthermore, in order to ensure a smooth transition of breakpoint execution, the recover function can be used.
[0071] For example, Figure 5 As shown, when the scheduled task 272yus is preempted by 242yas, the pause position of 272yus when it is preempted can be recorded: 67s. When 242yas is completed, and 272yus is the scheduled task closest to the current time and has the highest priority, the recover function is executed, starting from the 67th execution of 272yus.
[0072] The above is the task management method provided by the present disclosure. The above embodiments can be freely combined and are not specifically limited here.
[0073] In an illustrative embodiment, Figure 6 is a schematic diagram illustrating a task management process according to an embodiment of the present disclosure. Figure 6As shown, the task management process can be: obtain the latest remote scheduled task management list, wherein the scheduled task management list is a plurality of tasks set by the user. Next, it can be handed over to the task customization factory to unify the format of the task information to obtain a standard task object (i.e., scheduled task). Sort the standard task objects at the same time node according to priority to obtain a task priority queue management queue. Arrange the time nodes in order, and together with the task priority queue management queue of each time node, form a task time chain mapping table (i.e., time chain mapping table). Perform time polling according to the latest task time chain mapping table and the Timer poller (i.e., time poller), and add the scheduled task closest to the current moment and with the highest priority to the task execution queue (i.e., execution queue).
[0074] The present disclosure also provides a task management device. Figure 7 is a block diagram illustrating a task management apparatus according to an embodiment of the present disclosure. Figure 7 As shown, the task management device 700 includes: a management module 701, which is used to manage scheduled tasks using a time chain mapping table; wherein the time chain mapping table uses the time node as the first coordinate axis, and the second coordinate axis corresponding to any time node is used to mount each scheduled task in order of priority from high to low.
[0075] The execution module 702 is used to execute each scheduled task according to the time chain mapping table.
[0076] In an exemplary embodiment, the task management device 700 is further configured to obtain task information of each scheduled task, wherein the task information includes at least: task start time and task priority;
[0077] Based on the task information, the time chain mapping table is constructed or updated.
[0078] In an exemplary embodiment, the task management device 700 is also configured to determine the first time node of the scheduled task in the first coordinate axis based on the task start time of each scheduled task; based on the task priority of each scheduled task, in the second coordinate axis corresponding to the first time node, tasks are mounted in order from high to low priority.
[0079] In an exemplary embodiment, the task management device 700 is also configured to compare the time node of the time chain mapping table with the task start time of the scheduled task for any scheduled task; when there is a first time node that is consistent with the task start time, the first time node is determined as the time node of the scheduled task in the first coordinate axis; when the first time node does not exist, the first time node is added to the first coordinate axis in chronological order.
[0080] In an exemplary embodiment, the task management device 700 is also configured to prioritize the mounted tasks and the scheduled task in the second coordinate axis corresponding to the first time node for any scheduled task; and insert the scheduled task into the second coordinate axis according to the priority ranking result.
[0081] In an exemplary embodiment, the task management device 700 is further configured to obtain a first hash value of the scheduled task; and splice the first hash value into the second hash value of the time node according to the priority order of the mounted tasks of the time node.
[0082] In an exemplary embodiment, the task management device 700 is further configured to perform task polling using a time poller; move the scheduled task closest to the current time and with the highest priority into an execution queue; and execute each scheduled task using the execution queue.
[0083] In an exemplary embodiment, the task management device 700 is also configured to update the time chain mapping table before executing any scheduled task; based on the updated time chain mapping table, determine whether there is a new task at the current moment; if there is a new task at the current moment and the priority of the new task is higher than the current task, pause the current task and execute the new task; when the new task is completed, resume the current task from the breakpoint.
[0084] In an exemplary embodiment, the task management device 700 is further configured to execute a new task if there is a new task at the current moment and the new task is mounted at a new time node.
[0085] Figure 8 800 is a hardware block diagram illustrating a computer device according to an embodiment of the present disclosure. The computer device 800 according to an embodiment of the present disclosure includes at least a memory, a processor, and a computer program stored in the memory. The processor executes the computer program to implement the signal transmission method described in any of the above embodiments.
[0086] Figure 8 The computer device 800 shown specifically includes: a central processing unit (CPU) 801, a graphics processing unit (GPU) 802, and a memory 803. These units are interconnected via a bus 804. The central processing unit (CPU) 801 and / or the graphics processing unit (GPU) 802 can be used as the above-mentioned processor, and the memory 803 can be used as the above-mentioned memory for storing computer-readable instructions. In addition, the computer device 800 may also include a communication unit 805, a storage unit 806, an output unit 807, an input unit 808, and an external device 809, which are also connected to the bus 804.
[0087] Figure 9 Schematic diagram of a computer-readable storage medium according to an embodiment of the present disclosure. The computer-readable storage medium according to an embodiment of the present disclosure stores computer programs / instructions (including but not limited to computer-readable instructions). Specifically, Figure 9 As shown, computer-readable instructions 901 are stored on a computer-readable storage medium 900. When executed by a processor, the computer program / instructions implement the task management method described in any of the previous embodiments of the present disclosure. Computer-readable storage media include, but are not limited to, volatile memory and / or non-volatile memory. Volatile memory may include, for example, random access memory (RAM) and / or cache memory. Non-volatile memory may include, for example, read-only memory (ROM), a hard disk, flash memory, an optical disk, a magnetic disk, etc.
[0088] The present disclosure further provides a computer program product, including a computer program / instruction, which, when executed by a processor, implements the task management method described in any of the foregoing embodiments of the present disclosure.
[0089] The basic principles of the present disclosure have been described above in conjunction with specific embodiments. However, it should be noted that the advantages, strengths, and effects mentioned in this disclosure are merely illustrative and not restrictive, and should not be construed as necessarily possessed by each embodiment of the present disclosure. Furthermore, the specific details disclosed above are provided for illustrative purposes and to facilitate understanding, rather than as limitations. These details do not limit the present disclosure to necessarily being implemented using these specific details.
[0090] The block diagrams of the devices, devices, equipment, and systems involved in this disclosure are merely illustrative examples and are not intended to require or imply that they must be connected, arranged, or configured in the manner shown in the block diagrams. As will be appreciated by those skilled in the art, these devices, devices, equipment, and systems can be connected, arranged, or configured in any manner. Words such as "include," "comprise," "have," and the like are open-ended words, meaning "including but not limited to," and can be used interchangeably therewith. The words "or" and "and" used herein refer to the words "and / or" and can be used interchangeably therewith, unless the context clearly indicates otherwise. The word "such as" used herein refers to the phrase "such as but not limited to," and can be used interchangeably therewith.
[0091] Additionally, as used herein, "or" used in a list of items beginning with "at least one" indicates a separate list, so that, for example, a list of "at least one of A, B, or C" means A or B or C, or AB or AC or BC, or ABC (i.e., A and B and C). Furthermore, the word "exemplary" does not mean that the example described is preferred or better than other examples.
[0092] It should also be noted that in the system and method of the present disclosure, each component or each step can be decomposed and / or recombined. Such decomposition and / or recombination should be regarded as equivalent solutions of the present disclosure.
[0093] Various changes, substitutions, and modifications may be made to the technology described herein without departing from the teachings defined by the appended claims. Moreover, the scope of the claims of this disclosure is not limited to the specific aspects of the processes, machines, manufactures, compositions of things, means, methods, and actions described above. Currently existing or later developed processes, machines, manufactures, compositions of things, means, methods, or actions that perform substantially the same function or achieve substantially the same results as the corresponding aspects described herein may be utilized. Accordingly, the appended claims include within their scope such processes, machines, manufactures, compositions of things, means, methods, or actions.
[0094] The above description of the disclosed aspects is provided to enable any person skilled in the art to make or use the present disclosure. Various modifications to these aspects will be readily apparent to those skilled in the art, and the general principles defined herein may be applied to other aspects without departing from the scope of the present disclosure. Therefore, the present disclosure is not intended to be limited to the aspects shown herein, but rather to be accorded the widest scope consistent with the principles and novel features disclosed herein.
[0095] The above description has been provided for the purpose of illustration and description. In addition, this description is not intended to limit the embodiments of the present disclosure to the forms disclosed herein. Although a number of example aspects and embodiments have been discussed above, those skilled in the art will recognize certain variations, modifications, alterations, additions, and sub-combinations thereof.
Claims
1. A task management method, characterized in that: The method comprises: Use a time chain mapping table to manage scheduled tasks; wherein the time chain mapping table uses the time node as the first coordinate axis, and the second coordinate axis corresponding to any time node is used to mount each scheduled task in order of priority from high to low; Execute each scheduled task according to the time chain mapping table.
2. The method according to claim 1, characterized in that The method of managing scheduled tasks using a time chain mapping table includes: Obtaining task information for each scheduled task, the task information including at least: task start time and task priority; Based on the task information, the time chain mapping table is constructed or updated.
3. The method according to claim 2, characterized in that The constructing or updating the time chain mapping table based on the task information includes: Determine, based on the task start time of each scheduled task, a first time node of the scheduled task in the first coordinate axis; Based on the task priority of each scheduled task, tasks are mounted in a descending order of priority in the second coordinate axis corresponding to the first time node.
4. The method according to claim 3, characterized in that Determining the time node of the scheduled task in the first coordinate axis includes: For any scheduled task, compare the time node in the time chain mapping table with the task start time of the scheduled task; When there is a first time node with the same start time as the task, the first time node is determined as the time node of the scheduled task in the first coordinate axis; When the first time node does not exist, the first time node is added to the first coordinate axis in chronological order.
5. The method according to claim 3, characterized in that The step of mounting tasks based on the task priorities of the scheduled tasks in a descending order of priority on the second coordinate axis corresponding to the first time node includes: For any scheduled task, in the second coordinate axis corresponding to the first time node, prioritize the mounted tasks and the scheduled task in the second coordinate axis; According to the priority sorting result, the scheduled task is inserted into the second coordinate axis.
6. The method according to claim 1, characterized in that Executing each scheduled task according to the time chain mapping table includes: Before executing any scheduled task, update the time chain mapping table; Based on the updated time chain mapping table, determine whether there is a new task at the current moment; If there is a new task at the current moment and the priority of the new task is higher than the current task, the current task is paused and the new task is executed; When the newly added task is completed, the current task is resumed from the breakpoint.
7. A task management device, characterized in that: The device comprises: A management module for managing scheduled tasks using a time chain mapping table; wherein the time chain mapping table uses time nodes as a first coordinate axis, and a second coordinate axis corresponding to any time node is used to mount each scheduled task in descending order of priority; The execution module is used to execute each scheduled task according to the time chain mapping table.
8. A computer device comprising a memory, a processor, and a computer program stored in the memory, wherein: The processor executes the computer program to implement the method according to any one of claims 1 to 6.
9. A computer-readable storage medium having a computer program / instruction stored thereon, characterized in that: When the computer program / instructions are executed by a processor, the method according to any one of claims 1 to 6 is implemented.
10. A computer program product comprising a computer program / instructions, characterized in that When the computer program / instructions are executed by a processor, the method according to any one of claims 1 to 6 is implemented.