Dynamic priority scheduling algorithm based on delay
A dynamic priority and scheduling algorithm technology, applied in the Internet field, can solve the problems of priority reduction, non-changing, lack of flexibility and precision, etc., and achieve the effect of small response time
Inactive Publication Date: 2019-04-16
北京云端智度科技有限公司
View PDF2 Cites 7 Cited by
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
[0004] However, the existing scheduling technology can solve the problem of network resource allocation to a certain extent, but it also has certain defects, which are mainly manifested in the following aspects. storage, and these orders will not change once they are arranged. In actual business, the priority of some tasks is basically dynamic. Over time, these tasks may become less prioritized and need to be moved down the list
However, the existing technology lacks the ability of automatic adjustment, and cannot make corresponding adjustments according to changes in the priority level of tasks, so it lacks corresponding flexibility and precision in technology
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
[0023] In order to make the purpose, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments It is a part of embodiments of the present invention, but not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by persons of ordinary skill in the art without creative efforts fall within the protection scope of the present invention.
[0024] Such as Figure 1-2 As shown, in order to improve the service quality of the CDN network, the present invention proposes a CDN dynamic priority scheduling algorithm based on time delay. In this algorithm, each packet in the queue has a service time limit, and when the packet is close to its limited time, a higher priority is assigned to it...
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 relates to a CDN dynamic priority scheduling algorithm based on delay. Each group in each queue has the service time limitation, a relatively high priority is distributed when the groupapproaches to the limitation time, the closer the limitation is, the higher the priority is; for avoiding the condition that the groups are intermittent since the processing time limitation of the system is enlarged, the time slice and the priority are combined, along the increase of the time slice, the service time of the high-priority group can be possibly preempted due to ceaseless improvementof the low priority. The determination of the process switching opportunity and the time slice size is controlled, majority of interactive processes can be accomplished in one time slice, thereby acquiring small response time; and the problem of how to avoid the conflict with the existing group when performing reading-writing on the new group when the new group arrives is further solved.
Description
technical field [0001] The invention relates to the technical field of the Internet, in particular to a delay-based CDN dynamic priority scheduling algorithm. Background technique [0002] In the CDN business platform, when the CDN node is processing network traffic, it often encounters the situation that multiple tasks need to occupy resources at the same time, and the total network resources are limited. In this case, it is necessary to decide which tasks should be processed first and which tasks can be delayed. In the current situation, scheduling is an effective means to solve the problem of multiple services competing for shared resources. [0003] According to the scheduling rules, the existing scheduling algorithms can be divided into the following categories: service based on distinguishing business priority, based on dynamic two-way priority, proportional differentiation algorithm and based on discrete particle swarm. The current queue scheduling algorithm adjusts...
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 IPC IPC(8): H04L12/863H04L12/865H04L47/6275
CPCH04L47/6235H04L47/6275H04L47/6285
Inventor刘晓光赵子毅张晴晴
Owner北京云端智度科技有限公司