METHOD AND SYSTEM FOR SCHEDULING VIRTUAL MACHINES IN INTEGRATED VIRTUAL MACHINE CLUSTERS

• US 20160139957A1
• Filed: 11/13/2015
• Published: 05/19/2016
• Est. Priority Date: 11/14/2014
• Status: Active Grant

• Current Assignee: Sangfor Technologies, Inc.
• Original Assignee: Sangfor Technologies Co., Ltd.
• Inventors: WANG, ZHENG
• Granted Patent: US 10,031,777 B2
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 2009/4557 Distribution of virtual machine instances; Migration and load balancing
• CPC Class Codes: G06F 9/45554 Instruction set architectures of guest OS and hypervisor or native processor differ, e.g. Bochs or VirtualPC on PowerPC MacOS
• CPC Class Codes: G06F 9/45558 Hypervisor-specific management and integration aspects
• CPC Class Codes: G06F 9/50 Allocation of resources, e.g. of the central processing unit [CPU]
• CPC Class Codes: G06F 9/5077 Logical partitioning of resources; Management or configuration of virtualized resources specific details on emulation or internal functioning of virtual machines G06F9/455

Abstract

A method for scheduling virtual machines in a virtual machine cluster includes obtaining a filename of a target virtual machine when a user requests to start the target virtual machine; inquiring, based on the filename of the target virtual machine, a storage module or a database to acquire one or more nodes where copies of the target virtual machine are located; selecting, from the acquired one or more nodes, a node with a highest score as a target node having a copy of the target virtual machine; and running the copy of the target virtual machine on the selected target node with the highest score.

Claims

1. A method for scheduling virtual machines in an integrated virtual machine cluster, comprising:

S1). obtaining a filename of a target virtual machine when a user requests to start the target virtual machine;

S2). inquiring, based on the filename of the target virtual machine, a storage module or a database to acquire one or more nodes where copies of the target virtual machine are located;

S3). selecting, from the acquired one or more nodes, a node with a highest score as a target node having a copy of the target virtual machine; and

S4) running the copy of the target virtual machine on the selected target node with the highest score.

2. The method according to claim 1, wherein (S3) further includes:

S30). obtaining configurations of CPU and memory required by the target virtual machine;

S31). locating all nodes in the integrated virtual machine cluster to obtain a first set of nodes;

S32). judging whether memory of each node in the first set of nodes meets a CPU and memory configuration requirement of the target virtual machine, and removing nodes in the first set of nodes that do not meet the configuration requirement, so as to create a second set of nodes;

S33). determining the acquired one or more nodes as a third set of nodes;

S34). determining intersection of the second set of nodes and the third set of nodes as a fourth set of nodes;

S35). calculating a score of each node in the fourth set of nodes; and

S36). selecting a node with a highest score as the target node.

3. The method according to claim 2, between (S33) and (S34), further including:

judging whether there is intersection between the second set of nodes and the third set of nodes;

when there is no intersection between the second set of nodes and the third set of nodes, determining the second set of nodes as the fourth set of nodes, continuing to (S35); and

when there is intersection between the second set of nodes and the third set of nodes, continuing to (S34).

4. The method according to claim 3, after (S4), further including:

judging whether the selected target node belongs to the third set of nodes; and

when the selected target node does not belong to the third set of nodes, continuing to (S3).

5. The method according to claim 2, between (S32) and (S33), further including:

judging whether the second set of nodes is empty; and

when the second set of nodes is empty, prompting a boot failure.

6. The method according to claim 2, wherein:

provided that S is the score of a current node;

F₀ is CPU frequency of the current node;

F is a sum of the CPU frequency of all nodes in the integrated virtual machine cluster;

N is a number of virtual machines in the integrated virtual machine cluster; and

N₀ is a number of virtual machines running on the current node;

the score of each node in the fourth set of nodes is calculated by;

S=F₀/F*(N+1)−

N₀.

7. A system for scheduling virtual machines in an integrated virtual machine cluster, comprising

a filename acquisition module configured to acquire a filename of a target virtual machine when a user requests to start the target virtual machine;

a copy inquiry module configured to, based on the filename of the target virtual machine, inquire a storage module or a database to acquire one or more nodes where copies of the target virtual machine are located;

a target selection module configured to, from the acquired one or more nodes, select a node with a highest score as a target node having a copy of the target virtual machine; and

a running module configured to run the copy of the target virtual machine on the selected target node with the highest score.

8. A system according to claim 7, wherein the target selection module includes:

a configuration acquisition unit configured to obtain configurations of CPU and memory required by the target virtual machine;

a first set determining unit configured to locate all nodes in the integrated virtual machine cluster to obtain a first set of nodes;

a second set determining unit configured to judge whether memory of each node in the first set of nodes meets a CPU and memory configuration requirement of the target virtual machine, and to remove the nodes in the first set of nodes that do not meet the requirement, so as to create a second set of nodes;

a third set determining unit configured to determine the acquired one or more nodes as a third set of nodes;

a fourth set determining unit configured to determine intersection of the second set of nodes and the third set of nodes as a fourth set of nodes;

a score calculation unit configured to calculate a score of each node in the fourth set of nodes; and

a target selection unit configured to select a node with a highest score as the target node.

9. A system according to claim 8, wherein the target selection module further includes:

an intersection determining unit configured to determine whether there is intersection between the second set of nodes and the third set of nodes; and

a fourth set determining unit configured to, when there is intersection between the second set of nodes and the third set of nodes, determine the intersection between the second set of nodes and the third set of nodes as a fourth set of nodes and, when there is no intersection between the second set of nodes and the third set of nodes, to determine the second set of nodes as a fourth set of nodes.

10. A system according to claim 9, wherein the target selection module is further configured to run the target virtual machine on the selected target node and, when the selected target node does not belong to the third set of nodes, to re-select, from the acquired one or more nodes, a node with a highest score as a target node having a copy of the target virtual machine.

11. A system according to claim 8, wherein the target selection module further includes:

an empty set determining unit configured to determine whether the second set of nodes is empty; and

a prompting unit configured to, when the second set of nodes is empty, prompt a boot failure.

12. A system according to claim 8, wherein:

provided that S is the score of a current node;

F₀ is CPU frequency of the current node;

F is a sum of the CPU frequency of all nodes in the integrated virtual machine cluster;

N is a number of virtual machines in the integrated virtual machine cluster; and

N₀ is a number of virtual machines running on the current node;

the score calculation unit configured to calculate the score of each node in the fourth set of nodes by;

S=F₀/F*(N+1)−

N₀.

13. A non-transitory computer-readable medium having computer program for, when being executed by a processor, performing a method for scheduling virtual machines in an integrated virtual machine cluster, the method comprising:

S1). obtaining a filename of a target virtual machine when a user requests to start the target virtual machine;

S2). inquiring, based on the filename of the target virtual machine, a storage module or a database to acquire one or more nodes where copies of the target virtual machine are located;

S3). selecting, from the acquired one or more nodes, a node with a highest score as a target node having a copy of the target virtual machine; and

S4). running the copy of the target virtual machine on the selected target node with the highest score.

14. The non-transitory computer-readable medium according to claim 13, wherein (S3) further includes:

S30). obtaining configurations of CPU and memory required by the target virtual machine;

S31). locating all nodes in the integrated virtual machine cluster to obtain a first set of nodes;

S32). judging whether memory of each node in the first set of nodes meets a CPU and memory configuration requirement of the target virtual machine, and removing nodes in the first set of nodes that do not meet the configuration requirement, so as to create a second set of nodes;

S33). determining the acquired one or more nodes as a third set of nodes;

S34). determining intersection of the second set of nodes and the third set of nodes as a fourth set of nodes;

S35). calculating a score of each node in the fourth set of nodes; and

S36). selecting a node with a highest score as the target node.

15. The non-transitory computer-readable medium according to claim 14, between (S33) and (S34), the method further including:

judging whether there is intersection between the second set of nodes and the third set of nodes;

when there is no intersection between the second set of nodes and the third set of nodes, determining the second set of nodes as the fourth set of nodes, continuing to (S35); and

when there is intersection between the second set of nodes and the third set of nodes, continuing to (S34).

16. The non-transitory computer-readable medium according to claim 15, after (S4), the method further including:

judging whether the selected target node belongs to the third set of nodes; and

when the selected target node does not belong to the third set of nodes, continuing to (S3).

17. The non-transitory computer-readable medium according to claim 14, between (S32) and (S33), the method further including:

judging whether the second set of nodes is empty; and

when the second set of nodes is empty, prompting a boot failure.

18. The non-transitory computer-readable medium according to claim 14, wherein:

provided that S is the score of a current node;

F₀ is CPU frequency of the current node;

F is a sum of the CPU frequency of all nodes in the integrated virtual machine cluster;

N is a number of virtual machines in the integrated virtual machine cluster; and

N₀ is a number of virtual machines running on the current node;

the score of each node in the fourth set of nodes is calculated by;

S=F₀/F*(N+1)−

N₀.