Task scheduling method and system based on topological sorting
A technology of task scheduling and topological sorting, which is applied in the field of computer systems, can solve problems such as high computational complexity, achieve the effects of reducing computational complexity, reducing processing capacity, and improving efficiency
Pending Publication Date: 2021-06-11
HUNAN UNIV
View PDF0 Cites 0 Cited by
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
[0004] In view of the above defects or improvement needs of the prior art, the present invention provides a task scheduling method and system based on topological sorting. time and lead to technical problems with high computational complexity
Method used
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View moreImage
Smart Image Click on the blue labels to locate them in the text.
Smart ImageViewing Examples
Examples
Experimental program
Comparison scheme
Effect test
Embodiment Construction
[0053] In order to make the object, technical solution and advantages of the present invention clearer, the present invention will be further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described here are only used to explain the present invention, not to limit the present invention. In addition, the technical features involved in the various embodiments of the present invention described below can be combined with each other as long as they do not constitute a conflict with each other.
[0054] The current traditional task scheduling algorithms, such as the earliest completion time algorithm in a heterogeneous computing environment and the scheduling algorithm based on task replication, etc. Among them, the earliest completion time algorithm is a basic static scheduling algorithm. Its main idea is to arrange all tasks to be executed on the processor that can complete them the ea...
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More PUM
Login to View More Abstract
The invention discloses a task scheduling method and system based on topological sorting, and belongs to the technical field of computer systems. The method comprises the steps of obtaining a large-scale directed acyclic task scheduling graph, and performing multi-stage coarsening processing on the large-scale directed acyclic task scheduling graph based on a topological sorting coarsening algorithm to obtain a corresponding directed acyclic initial scheduling graph; performing initial division on the directed acyclic initial scheduling graph based on a small-scale scheduling algorithm to obtain a coarsened graph division result of the directed acyclic initial scheduling graph; and mapping the coarsened graph division result back to the large-scale directed acyclic task scheduling graph based on a refinement algorithm, and performing refinement adjustment to obtain a task scheduling division result of the large-scale directed acyclic task scheduling graph. Due to the fact that the large-scale directed acyclic task scheduling graph is subjected to multi-stage coarsening processing in advance, and the tasks are clustered, for a large-scale task scheduling scene, the processing amount can be effectively reduced by using a task scheduling algorithm, and then the operation complexity is reduced.
Description
technical field [0001] The invention belongs to the technical field of computer systems, and more specifically relates to a task scheduling method and system based on topology sorting. Background technique [0002] The current traditional task scheduling algorithms, such as the earliest completion time algorithm in a heterogeneous computing environment and the scheduling algorithm based on task replication, etc. Among them, the earliest completion time algorithm is a basic static scheduling algorithm. Its main idea is to arrange each task to be executed on the processor that can complete it the earliest. Specifically, according to the dependencies in the task directed acyclic graph, Calculate the earliest completion time of all tasks on each processor before scheduling, and then compare the minimum earliest completion time with the processor that can meet the condition, match the task with the processor and correspond to the corresponding occupation period , after all tasks...
Claims
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More Application Information
Patent Timeline
Login to View More Patent Type & Authority Applications(China)
IPC IPC(8): G06F9/48
CPCG06F9/4881
Inventor 李肯立雷直航陈岑肖正刘楚波段明星阳王东唐卓
Owner HUNAN UNIV