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

Virtual machine cpu resource reservation algorithm based on kvm platform

A CPU resource and resource reservation technology, which is applied in the field of virtual machine CPU resource reservation algorithm, can solve problems such as high-priority tasks cannot be executed and high-priority tasks are completed first, so as to ensure real-time performance and improve response performance effect

Active Publication Date: 2019-06-14
SICHUAN ZHONGDIAN AOSTAR INFORMATION TECHNOLOGIES CO LTD
View PDF5 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Although tasks with high priority run longer, there is no guarantee that high-priority tasks can be completed before other tasks within the allocated running time, which may still fail to achieve the purpose of high-priority tasks being executed first

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
  • Virtual machine cpu resource reservation algorithm based on kvm platform
  • Virtual machine cpu resource reservation algorithm based on kvm platform
  • Virtual machine cpu resource reservation algorithm based on kvm platform

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0051] The virtual machine CPU resource reservation algorithm based on the KVM platform includes the following steps:

[0052] 1) In the kernel state, the priority S of the virtual machine is calculated according to the virtual machine priority formula by obtaining the resource reservation parameters set by the user i The theoretical value, find the kernel state task_struct data structure through the process id of the virtual machine, and set the process priority in the task_struct data structure to S i ;

[0053] 2) After step 1), another virtual machine timer task with a period of t will be triggered, in which the priority S of the virtual machine is passed i The theoretical value of is compared with the actual running time value of the virtual machine. When the actual running time value of the virtual machine is greater than or equal to the priority S of the virtual machine i When the theoretical value of , the virtual machine that reaches the theoretical reserved time sl...

Embodiment 2

[0055] The present embodiment is further optimized on the basis of the above-mentioned embodiment, and further for realizing the present invention better, adopts following setting mode especially: Described step 2) comprises the following specific steps:

[0056] 2-1) After the kernel state obtains the reserved parameters, compare and judge whether the virtual machine timer with a period of t has reached the virtual machine statistics time T period;

[0057] 2-2) After step 2-1), if the virtual machine timer with a period of t reaches the virtual machine statistics time T period, set the scheduling priority of the virtual machine to the priority S of the virtual machine i Theoretical value, otherwise go to step 2-3);

[0058] 2-3) Determine whether the user has changed the resource reservation value Ri of the virtual machine again, or whether a new virtual machine has been added to the resource reservation queue, if yes, repeat step 2-2), if not, perform step 2-4);

[0059] ...

Embodiment 3

[0062] This embodiment is further optimized on the basis of the above-mentioned embodiments. In order to further realize the present invention better, the following setting method is adopted in particular: the theoretical reserved time slice includes the time when the virtual machine reaches the reserved time slice within t period Theoretical value t i And / or the virtual machine reaches the theoretical value T of the reserved time slice within the T period i ;

[0063] the t i By formula: calculated;

[0064] The T i By formula: calculated.

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 discloses a KVM platform based virtual machine CPU resource reservation algorithm. The algorithm comprises the following steps: obtaining a resource reservation parameter set by a user in a kernel state, calculating a theoretical value of a priority Si of a virtual machine according to a priority formula of the virtual machine, finding a kernel-state task_struct data structure through a process id of the virtual machine, and setting a process priority to be Si; and then, triggering another virtual machine timer task with a t cycle, comparing the theoretical value of the priority Si of the virtual machine with an actual runtime value of the virtual machine in the task, and when the actual runtime value of the virtual machine is greater than or equal to the theoretical value of the priority Si of the virtual machine, recovering a default CFS algorithm from a resource reservation algorithm. By calling a KVM interface to obtain related data in a running process of the virtual machine, the response performance of the virtual machine is improved; and a task with the high priority is ensured to have sufficient resources to complete and execute a target.

Description

technical field [0001] The invention relates to technical fields such as CPU virtualization and resource reservation, and specifically relates to a virtual machine CPU resource reservation algorithm based on a KVM platform. Background technique [0002] With the deployment and implementation of the virtualization platform, the basic structure and business processing methods of informatization construction have changed. Virtualization technology is to re-divide and configure the real physical resources on a single machine to form multiple independent virtual partitions, which work as independent operating systems. The resources involved in virtualization include CPU, memory, disk, IO, etc., among which CPU virtualization is a very important component. Under the framework of KVM full virtualization technology, virtual machines can overload physical resources, that is, the amount of CPU and memory allocated to virtual machines is more than the actual resources on the physical ...

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
Patent Type & Authority Patents(China)
IPC IPC(8): G06F9/50
CPCG06F9/5038
Inventor 辜文斌佘文魁周锐张慧郭晶田丹
Owner SICHUAN ZHONGDIAN AOSTAR INFORMATION TECHNOLOGIES CO LTD