Unlock instant, AI-driven research and patent intelligence for your innovation.

Dynamic quota allocation method and apparatus

A dynamic allocation and quota technology, applied in the direction of resource allocation, multi-programming devices, etc., can solve the problem of not getting bandwidth and so on

Active Publication Date: 2015-12-23
INSPUR BEIJING ELECTRONICS INFORMATION IND
View PDF5 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

When running, T2 will give up part of the bandwidth, because T2 is idle, it will take the initiative to give up the CPU, but T1 cannot get the bandwidth given up by T2

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
  • Dynamic quota allocation method and apparatus
  • Dynamic quota allocation method and apparatus
  • Dynamic quota allocation method and apparatus

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0056] The technical solution of the present invention will be described in more detail below with reference to the drawings and embodiments.

[0057] figure 2 A flowchart for a method of dynamically allocating quotas, such as figure 2 shown, including:

[0058] Step 201: Determine whether each task running on the CPU is a busy task or an idle task.

[0059] Among them, it is determined whether each task running on the CPU is a busy task or an idle task in the following manner:

[0060] Busy tasks will not actively give up bandwidth

[0061] Idle tasks will actively give up bandwidth when there is no business to process.

[0062] It should be noted that how to know whether the task has given up the bandwidth is a conventional technical means well known to those skilled in the art, and will not be repeated here.

[0063] Step 202: Allocating bandwidth to each determined busy task and allocating bandwidth to each determined idle task.

[0064] Wherein, allocating bandwidth...

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 present invention discloses a dynamic quota allocation method and apparatus. The method comprises: determining whether each task running on a CPU is a busy task or an idle task; allocating a bandwidth to each determined busy task and allocating a bandwidth to each determined idle task; and enabling each busy task and each idle task to run according to the allocated bandwidths. According to the technical scheme of the present invention, the method and the apparatus realize a dynamic allocation of quotas in a scheduling system, and can more reasonably use the bandwidth.

Description

technical field [0001] The invention relates to the field of operating system scheduling, in particular to a method and device for dynamically allocating quotas. Background technique [0002] The scheduling system in the current operating system mainly adopts the scheduling mechanism with deadline as the priority in real-time scheduling. This scheduling mechanism does not have a dynamic quota mechanism. Get more quota in the system. From a macro point of view, busy tasks cannot always process business in a timely manner because they cannot get more quotas. Specific as figure 1 Shown: Assume that one CPU runs two tasks, namely T1 (busy task) and T2 (idle task), and assume that each task initially occupies 30% of the CPU bandwidth. In the current dealine priority scheduling, T1 and T2 cannot exceed the specified bandwidth, in figure 1 It can be obtained that the sum of the bandwidth of the two tasks at the beginning is T1+T2=30%+30%=60%. When running, T2 will give up a pa...

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/50
Inventor 闫晓峰吴楠
Owner INSPUR BEIJING ELECTRONICS INFORMATION IND
PatSnap Eureka logo

PatSnap Eureka turns technology decisions into work you can execute. Powered by our Innovation Knowledge Graph, it runs expert workflows across engineering, life sciences, materials and intellectual property. Get your review-ready output in minutes.

X (Twitter)LinkedInYouTubeSubstack

© 2026 PatSnap. All rights reserved. 

Terms of Service

 | 

Privacy policy

 | 

Modern Slavery Act Transparency Statement