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
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
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...
PUM

Abstract
Description
Claims
Application Information

- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com