Supercharge Your Innovation With Domain-Expert AI Agents!

Pushing task scheduling method and system for balancing CPU resources

A CPU resource and task scheduling technology, applied in the field of network performance, can solve problems such as delayed push tasks and insufficient utilization of CPU resources

Pending Publication Date: 2021-04-20
科来网络技术股份有限公司
View PDF0 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

It will also greatly lead to delays in push tasks and insufficient utilization of CPU resources.

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 more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Pushing task scheduling method and system for balancing CPU resources

Examples

Experimental program
Comparison scheme
Effect test

Embodiment

[0029] This embodiment proposes a push task scheduling method that balances CPU resources. figure 1 As shown, the push task scheduling method includes the following steps:

[0030] S1, use the minimum heap mechanism to predict the execution time of the push task, and get the expected time of the push task; specifically:

[0031] S11, split a push task into push tasks with the smallest granularity, and enter the lock-free queue of the new task through configuration update;

[0032] S12, the main push framework polls the lock-free queue of the new task and judges whether there is a new push task in the lock-free queue of the new task, and if so, adds the new push task to the minimum heap group;

[0033] S13. Classify the minimum heap group according to different links, and then the top of the minimum heap is the expected time of the next push task.

[0034] Through the minimum heap mechanism in step S1, the push task traversal can be greatly reduced to only checking whether th...

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

No PUM Login to View More

Abstract

The invention provides a pushing task scheduling method and system for balancing CPU resources. The method comprises the steps that S1, using a minimum heap mechanism for predicting the execution time of a pushing task to obtain expected time; S2, when the push task reaches the expected time, putting the push task into an unpredictable task linked list; S3, putting the push tasks on the unpredictable task linked list into a lockless queue of a corresponding time consumption level in a working thread according to task time consumption; S4, enabling each worker thread to traverse the push tasks in the lockless queue from the highest priority to the lowest priority and execute the push tasks; and S5, putting the executed pushing tasks into the lockless queues of the completed tasks, recovering the executed pushing tasks from the lockless queues of the completed tasks into the minimum heap group by the main pushing framework, and modifying expected time. According to the method, under the condition that time-consuming tasks and non-time-consuming tasks do not influence each other, the tasks are refined and CPU resources are fully utilized, so that the pushing performance is improved.

Description

technical field [0001] The present invention relates to the technical field of network performance, in particular to a push task scheduling method and system for balancing CPU resources. Background technique [0002] The existing push task scheduling method of CPU resources is as follows: classify push tasks, and allocate different CPU cores for different types to do push. Since push tasks include time-consuming tasks and non-time-consuming tasks, in order not to affect the tasks, the tasks are classified and different CPU cores are assigned to each type of task. When there is a problem with this solution, some CPU cores will be in an idle state for a long time, and some CPU cores will be in a 99% state for a long time. It will also greatly lead to delays in push tasks and insufficient utilization of CPU resources. Contents of the invention [0003] The present invention aims to provide a push task scheduling method and system for balancing CPU resources, so as to refine...

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
no application Login to View More
IPC IPC(8): G06F9/50G06F9/48
Inventor 雷勇
Owner 科来网络技术股份有限公司
Features
  • R&D
  • Intellectual Property
  • Life Sciences
  • Materials
  • Tech Scout
Why Patsnap Eureka
  • Unparalleled Data Quality
  • Higher Quality Content
  • 60% Fewer Hallucinations
Social media
Patsnap Eureka Blog
Learn More

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2025 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com