Virtual machine initial placement strategy method based on Rendezvous Hash algorithm

A placement strategy and hash algorithm technology, applied in computing, energy-saving computing, program control devices, etc., can solve problems such as unbalanced load and no comprehensive consideration of CPU

Active Publication Date: 2017-09-22
ZHEJIANG UNIV OF TECH
View PDF3 Cites 9 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0007] In order to overcome the unbalanced load of the existing virtual machine placement strategy and the lack of comprehensive consideration of CPU and memory factors, the present invention proposes a virtual machine placement strategy method based on the Rendezvous hash algorithm, which is suitable for cloud computing environments. The initial p

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 initial placement strategy method based on Rendezvous Hash algorithm
  • Virtual machine initial placement strategy method based on Rendezvous Hash algorithm
  • Virtual machine initial placement strategy method based on Rendezvous Hash algorithm

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0047] The present invention will be further described below in conjunction with the accompanying drawings.

[0048] refer to Figure 1 ~ Figure 3 , a virtual machine initial placement strategy method based on the Rendezvous hash algorithm, comprising the following steps:

[0049] Step 1: First define the physical host set PM={pm in the data center 1 ,pm 2 ,...,pm n}, where the number of hosts is n, and the set of virtual machines that need to be initialized VM={vm 1 , vm 2 ,...,vm m}, where the number of virtual machines is m, and the number of virtual machines m is set to be greater than or equal to host n;

[0050] Step 2: For a given virtual machine vm i , define Vpes i for the virtual machine vm i Required CPU resources, Vram i for the virtual machine vm i memory resources required, V i-pes for the virtual machine vm i CPU utilization, W i-ram for the virtual machine vm i memory utilization, for a given host pm j , defining Ppes j for the host pm j Curre...

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 virtual machine initial placement strategy method based on Rendezvous Hash algorithm. The method comprises the following steps: step one, firstly defining a physical mainframe set PM existing in a data center, and a virtual machine set VM needing the initial placement; step two, defining parameter for a given virtual machine vmi; step four, defining that any virtual machine vmi is provided with a distribution weight score set Wi to correspond to each mainframe for any virtual machine vmi when the mainframe number n is less than 4; step five, establishing a virtual layered structure when the mainframe number n is greater than and equal to 4, wherein the virtual layered structure comprises two parts of virtual layered nodes and a real mainframe node cluster, the virtual layered nodes are distributed in a tree way, and the real mainframe node cluster is a set formed by multiple real mainframes and associated with the virtual leaf sub-nodes at the bottom of the virtual layered nodes. By comprehensively considering the load balancing, the virtual machine mainframe performance, the data center energy consumption and like factors, the reasonable scheduling of the physical resource is finally realized.

Description

technical field [0001] The invention relates to a virtual machine initial placement strategy method based on Rendezvous hash algorithm. Background technique [0002] Cloud computing is a new hot spot that has attracted the attention of the industry in recent years, and virtualization technology is an important means to realize cloud computing. Through virtualization technology, the cloud data center uses the virtual machine to share the physical machine resource pool, and uses the physical machine unit to carry the virtual machine and the virtual machine unit to carry the application service. The cloud data center has become a collection of high-performance computers with thousands of physical servers and network equipment. Due to the large amount of resources and strong heterogeneity, cloud data centers have more prominent requirements for on-demand services, dynamic and elastic resource management, and service quality. However, cloud data centers are now facing problems ...

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/455
CPCG06F9/45558G06F2009/45562G06F2009/4557Y02D10/00
Inventor 陆佳炜李杰卢成炳张元鸣肖刚高燕煦周焕
Owner ZHEJIANG UNIV OF 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