Dynamic scheduling method with virtual function

A virtual function, dynamic scheduling technology, applied in software simulation/interpretation/simulation, multi-programming device, resource allocation, etc., can solve problems such as insufficient scalability and poor flexibility

Active Publication Date: 2013-04-17
HUAZHONG UNIV OF SCI & TECH
View PDF4 Cites 19 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0021] The present invention provides a dynamic scheduling method for virtual functions, which solves the problem of insufficient scalability and poor flexibility in t

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 scheduling method with virtual function
  • Dynamic scheduling method with virtual function
  • Dynamic scheduling method with virtual function

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0089] Embodiment 1, adding a virtual machine includes the following steps:

[0090] (1) Initialization step, the sequence includes the following sub-steps:

[0091] (1.1) The user creates a configuration file a, and in configuration file a, enters the virtual machine name h1 and bandwidth value of 600Mb to ensure bandwidth, and the virtual machine name h2 and bandwidth value of 1200Mb to ensure bandwidth;

[0092] (1.2) The user enables the single-root I / O virtualization function of the Intel 82599 network card, and creates 16 virtual functions on the network card;

[0093] (2) create a queue step, the sequence includes the following sub-steps:

[0094] (2.1) Create the first queue Q1, the second queue Q2, and the third queue Q3 to store virtual machine information respectively. Each queue is composed of nodes, and each node includes a virtual machine name, I / O priority value, bandwidth value, number of virtual functions;

[0095] (2.2) create a virtual function queue V, t...

Embodiment 2

[0143] Embodiment 2, reducing virtual machines, includes the following steps:

[0144] Steps (1), (2), (3), (4) are the same as in Example 1.

[0145] (5) Judging the wake-up step: judging whether there is a wake-up signal, if so, proceed to sub-step (5.1); otherwise turn to step (9); the present embodiment has a wake-up signal, which reduces the signal for the virtual machine, and the type is to reduce the virtual machine, virtual machine The name is h2; (at this time, the user closes the virtual machine h2);

[0146] (5.1) Calculate the I / O priority value of each node in the second queue Q2 and the third queue Q3 and sort, the method is the same as the sub-step (4.6); start the virtual machine of each node from the head of the second queue Q2 The names and I / O priority values ​​are h8 300, h9 256, h42 24, h6 198, h11 175, h5148, h7 103, h12 93, h3 84; the virtual machine names of each node starting from the head of the third queue Q3 , I / O priority values ​​are h10 71 in s...

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 relates to a dynamic scheduling method with a virtual function, belongs to the field of computer virtualization, and solves the problems of insufficient expandability and poor flexibility in using of virtual functions provided by a single root input and output virtualization standard network card so as to improve use ratio of the network card. The dynamic scheduling method with the virtual function comprises the steps of initializing, establishing queues, classifying virtual machines, distributing virtual functions, judging and wakening, adding virtual machines, dynamically adjusting and sleeping. During a period, the dynamic scheduling method with the virtual function performs dynamic scheduling on the virtual functions provided by the single root (input/output) I/O virtualization standard network card through statistics of I/O interruption times and sleeping time of the virtual machines, guarantees that the virtual function is utilized by a virtual machine with the largest I/O priority value, improves, network performance, fully utilizes hardware, and is used for supporting virtual machine platforms with a device direct distribution method.

Description

technical field [0001] The invention belongs to the field of computer virtualization, and in particular relates to a dynamic scheduling method for virtual functions, which is used for a virtual machine platform that supports the direct allocation of equipment, and for the virtualization provided by the single-root input-output virtualization standard (SR-IOV) network card. Functions are dynamically dispatched. Background technique [0002] With the advancement of science and technology, the application scope of virtualization technology is getting wider and wider. Virtualization technology can be divided into CPU virtualization, memory virtualization and I / O virtualization. Currently, CPU virtualization and memory virtualization technologies are relatively mature, but the performance of I / O virtualization needs to be improved. [0003] The I / O devices used by the virtual machine are divided into two types, the I / O devices simulated by software and the I / O devices allocated...

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/455
Inventor 童薇冯丹刘景宁李宇张炬
Owner HUAZHONG UNIV OF SCI & TECH
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

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

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap