Task scheduling method and device
A task scheduling and task technology, applied in the Internet field, can solve problems such as low utilization of cluster resources, task execution efficiency needs to be optimized, and remaining resources are not fully utilized, so as to achieve the effect of improving execution efficiency.
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0026] Figure 1a A schematic flowchart of a task scheduling method provided by Embodiment 1 of the present invention, as shown in Figure 1a shown, including:
[0027] Step 11. Create a task priority queue for a task cluster composed of network-like task nodes;
[0028] Among them, the task cluster is a collection of multiple tasks, and there may be interdependence between each task, that is, the child tasks can only be executed after the execution of the parent task is completed. The dependencies between tasks are represented by a network diagram. Each task is regarded as a task node, and the connection between nodes represents the dependencies between tasks. The task priority queue can be set as shown in Table 1 below, which records the order of task execution and the EST corresponding to each task. Among them, EST is 0, indicating that the task is an independently executable task that does not depend on other tasks; EST is 1, indicating that the task has a dependent task...
Embodiment 2
[0066] Figure 2a It is a schematic flowchart of a task scheduling method provided by Embodiment 2 of the present invention. The difference between this embodiment and the foregoing embodiments is that this embodiment is a detailed description of the first implementation manner of creating a task priority queue. Such as Figure 2a As shown, it specifically includes the following steps:
[0067] Step 21. Taking the task cluster composed of network-like task nodes as the current task cluster, and calculating the longest path STL of each task in the current task cluster; wherein, the longest path STL of the jth task j is the time period required from the execution of the entry task to the execution of the task j; and calculate the static critical path of the current task cluster, the static critical path is the longest path from the entry task to the exit task;
[0068] For example, with Figure 2b The task cluster shown is taken as an example, and the current task cluster for...
Embodiment 3
[0086] image 3 A schematic structural diagram of a task scheduling device provided by Embodiment 3 of the present invention, as shown in image 3 shown, including:
[0087] The task queue creation module 31 is used for creating a task priority queue for a task cluster composed of network-like task nodes;
[0088] The task selection module 32 is used to select a task from the task priority queue according to the priority order as the current task, and calculate the resource utilization rate of the current task, and determine whether there are remaining resources according to the resource utilization rate of the current task, If it is determined that there are remaining resources, at least one task whose EST is zero and whose required resources are less than the remaining resources is selected from the task priority queue as the current task;
[0089] The task execution module 33 is used to execute each of the current tasks at the same time, subtract one from the EST of each ...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com