CN102521052B - Resource allocation method of virtualized data center and virtual machine monitor - Google Patents
Resource allocation method of virtualized data center and virtual machine monitor Download PDFInfo
- Publication number
- CN102521052B CN102521052B CN 201110401620 CN201110401620A CN102521052B CN 102521052 B CN102521052 B CN 102521052B CN 201110401620 CN201110401620 CN 201110401620 CN 201110401620 A CN201110401620 A CN 201110401620A CN 102521052 B CN102521052 B CN 102521052B
- Authority
- CN
- China
- Prior art keywords
- virtual machine
- resource
- server
- alternative
- module
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
Images
Abstract
The invention provides a resource allocation method of a virtualized data center and a virtual machine monitor. The method comprises the following steps: selecting an execution server for running virtual machines requested to be constructed by a virtual machine monitor according to a received user application request; allocating initial resource capable of meeting the resource demand of the virtual machine for each virtual machine on the execution server, and constructing the virtual machine based on the initial resource; calculating historical resource consumption of the virtual machine in a preset running period of the virtual machine; determining overbooking ratio O, which is not less than 0 and not larger than 100, according to the historical resource consumption and the resource demand; and allocating finial resource A(O) for each virtual machine on the execution server, and reconstructing the virtual machine based on the finial resource, wherein A represents cumulative distribution function of the historical resource consumption. The method provided by the invention can reduce over-allocation of resources, thereby improving resource utilization rate.
Description
Technical field
The present invention relates to a kind of Visualized data centre resource allocation methods and monitor of virtual machine, belong to the resource allocation techniques field of Visualized data centre.
Background technology
Intel Virtualization Technology is a kind of concurrent and technology of independent operating on identical hardware resource of a plurality of operation system examples that allow.The core of this technology is to carry out on the hardware resource that utilizes monitor of virtual machine unified management and these virtual machines of scheduling to provide in respective service.Utilize Intel Virtualization Technology, will apply individual packages in virtual machine, due to isolation mutually between virtual machine, therefore allow the application of a plurality of isomeries to operate in same station server, thereby realized the polymerization of application.
The existing data center that has applied Intel Virtualization Technology concentrates in together physical resource to form a shared virtual resource pond, and the user can use computational resource as required by the mode of leasing, and adopts the charge method of living within one's income.Yet, existing Intel Virtualization Technology only carries out the resource distribution according to user's request, and the user often has blindness when the application request resource, they often maximum resource use amount apply for resource, final consumed resource while making the user ask the resources requirement of the virtual machine of structure often to move higher than virtual machine, thereby cause the excessive distribution of resource, make resource utilization too low, also make more application request be met.
Summary of the invention
The invention provides a kind of Visualized data centre resource allocation methods and monitor of virtual machine, in order to reduce the excessive distribution of resource, improve resource utilization.
One aspect of the present invention provides a kind of Visualized data centre resource allocation methods, comprising:
Monitor of virtual machine, according to the virtual machine of asking in the user's application request received to build, is selected for moving the execution server of described virtual machine;
Be that each described virtual machine distributes the initial resource of the resources requirement that can meet this virtual machine on described execution server, and build described virtual machine based on this initial resource;
The historical consumed resource of this virtual machine of statistics within the default operation period of described virtual machine;
Sell ratio O according to described historical consumed resource and definite surpassing of described resources requirement, wherein, O ∈ [0,100];
Distribute final resource for each described virtual machine on described execution server, this final resource=A(O), and rebuild described virtual machine based on this final resource, wherein, the cumulative distribution function that A is described historical consumed resource.
The present invention provides a kind of monitor of virtual machine on the other hand, comprising:
Server is selected module, asks the virtual machine built for the user's application request according to receiving, and selects for moving the execution server of described virtual machine;
The original allocation module, for selecting at server on described execution server that module selects as each described virtual machine distributes the initial resource of the resources requirement that can meet this virtual machine, and build described virtual machine based on this initial resource;
The historical statistics module, for the historical consumed resource of this virtual machine of statistics in the default operation period of the described virtual machine at the original allocation module construction;
The super computing module of selling, for the described historical consumed resource and definite the surpassing of described resources requirement that count on according to the historical statistics module selling ratio O, wherein, O ∈ [0,100];
Final distribution module, for on the described execution server of selecting module to select at server, distributing final resource for each described virtual machine, this final resource=A(O), and rebuild described virtual machine based on this final resource, wherein, the cumulative distribution function that A is described historical consumed resource.
The present invention reduces by the super ratio O that sells based on calculating the resource of distributing to virtual machine, thereby, under the prerequisite that guarantees as far as possible the normal operation of virtual machine, has reduced the excessive distribution of resource, has improved the utilization factor of resource.
The accompanying drawing explanation
The process flow diagram that Fig. 1 is Visualized data centre resource allocation methods embodiment of the present invention;
The optional process flow diagram that Fig. 2 is step 100 shown in Fig. 1;
The structural representation that Fig. 3 is monitor of virtual machine embodiment of the present invention;
Fig. 4 is the concrete structure schematic diagram that server shown in Fig. 3 is selected module 11.
Embodiment
The process flow diagram that Fig. 1 is Visualized data centre resource allocation methods embodiment of the present invention, as shown in the figure, the method comprises the steps:
Wherein, described user's application request is that the request of being sent by the user builds virtual machine in order to realize the request of concrete application, and virtual machine to be built may have one or more; Described execution server is used to that virtual machine to be built provides resource so that the server of operation virtual machine.Concrete selection course can adopt greedy algorithm, will describe in subsequent content.
Wherein, described initial resource refers to the resource of distributing according to user's demand, and the size of this initial resource can meet the resources requirement of each virtual machine.Background technology is described as the aforementioned, and user's request is often with blindness, and therefore, this initial resource of distributing often is greater than the consumed resource of virtual machine reality, and the part wherein had more is called the super resource of selling in the present embodiment.
Wherein, in the described default operation period, be a period of time that virtual machine is moved based on initial resource, purpose is in order during this period of time to obtain the actual historical consumed resource taken of virtual machine, so that the reference while as follow-up assessment is super, selling resource.
Wherein, the described super ratio O that sells refers to and superly sells resource and will meet with the probability of (1-O) % user's resource request.By mathematical expression, can be expressed as: Pr (x > A (O))<=O%, wherein, A (O) means take to surpass to sell the final resource that ratio O distributes as this virtual machine, and x means the historical consumed resource of this virtual machine, and Pr means probability.Super variation range of selling ratio O is between 0～100, and O=0, mean not super selling, and asks Resources allocation according to the user fully; During O=100, Resources allocation is zero.
Described super while selling ratio O when determining, can consider that actual gain solves following equation:
E(R│O)=Req×price-A(O)×price-(∑Req)×cost×Pr(x>(A(O)+A'))
Wherein, E (R|O) is illustrated in and surpasses the prospective earnings value that builds a virtual machine under the condition of selling ratio O, Req means the resources requirement of this virtual machine, price means the resource resources profit unit price, can be according to service-level agreement (Service Level Agreement, be called for short: SLA) determine, A (O) means take to surpass and sells the final resource of ratio O for this virtual machine distribution, it meets cumulative distribution function (the Cumulative Distribution Function of resource consumption probability, be called for short: CDF), Σ Req means that this virtual machine place carries out the summation of the resources requirement of the whole virtual machines that move on server, cost means conflict reparation unit price, can determine according to SLA, x means the historical consumed resource of this virtual machine, A ' means the final resource that the execution server at this virtual machine place distributes for other virtual machine except this virtual machine, Pr means probability.
The practical significance of above formula is: the resource that is a virtual machine distribution is more, income is more, but super sell resource and in fact be not fully utilized, thereby hindered, builds more multi-dummy machine, therefore deduct the super income that resource obtains of selling, also deduct in addition the damages of paying when the virtual machine conflict occurs.Relevant virtual machine conflict will be introduced in subsequent content.Concrete equation solution process can adopt process of iteration to realize, below lifts an example explanation:
Wherein, described final resource refers to from initial resource removes the super resource of finally distributing to virtual machine of selling resource, the cumulative distribution function that A is described historical consumed resource, super sell the possibility that resource only has O% and can be utilized due to described, therefore, even this part super do not sold to resource and distributes to described virtual machine, also can not make a big impact to it.
The described method of the present embodiment reduces by the super ratio O that sells based on calculating the resource of distributing to virtual machine, thereby, under the prerequisite that guarantees as far as possible the normal operation of virtual machine, has reduced the excessive distribution of resource, has improved the utilization factor of resource.
In addition, the described super possibility of selling resource O% still being arranged of the present embodiment can be utilized, when virtual machine has utilized this part super while selling resource, a real resource consumption of carrying out the whole virtual machines that move on server likely can surpass the available volume of resources that this execution server can provide, just the virtual machine conflict can occur now, that is to say that distributed virtual machine has exceeded the ability of place execution server, now can continue to carry out following step 600.
Step 600, while clashing between a plurality of virtual machines on described execution server, carry out to another in same alternative group the virtual machine (vm) migration that clashes on server.
Particularly, the virtual machine (vm) migration of committed memory space minimum in the virtual machine clashed can be carried out on server to described another, in order to reduce the expense that migration produces.
Referring to Fig. 2, describe in detail in above-mentioned steps 100 and adopt greedy algorithm to carrying out the selection course of server, as shown in Figure 2, comprise the steps:
Existing Intel Virtualization Technology adopts three layers of tree topology structure usually: top layer is core layer (core level), for realizing concrete application; Middle level is polymer layer, includes many switches, for realizing exchanges data; Bottom is Access Layer, comprises multiple servers, for resource is provided, as the computing power of CPU, memory headroom etc., to build virtual machine.Owing on a station server, can moving a plurality of virtual machines, so its available resources are dynamic changes, need to carry out by the time collect.
Wherein, described alternative services device refers to have the server that enough resources are provided for virtual machine to be built, if enough resources can not be provided, can not be chosen as the alternative services device.
In the prior art, comprise a plurality of switches in polymer layer, each switch directly is connected with a plurality of servers, the alternative services device that will directly be connected with same switch in polymer layer in this step is divided into one alternative group, the alternative services device that will directly be connected with another switch is divided into another alternative group (pod), and the alternative services device in different alternative group will connect via the switch indirect communication.
Suppose that each virtual machine all needs the memory headroom of 2M, alternative services device in first alternative group can provide the available memory space of 10M altogether, alternative services device in second alternative group can provide the available memory space of 4M altogether, alternative services device in the 3rd alternative group can provide the available memory space of 6M altogether, alternative services device in the 4th alternative group can provide the available memory space of 2M altogether, through the statistics obtained after this step, be: first alternative group can build at most 5 virtual machines, second alternative group can build at most 2 virtual machines, the 3rd alternative group can build at most 3 virtual machines, the 4th alternative group can build at most 1 virtual machine.
It should be noted that, in fact, the resources requirement of different virtual machine may be different, only illustrates herein, do not do restriction herein.
For example, in upper example, suppose that the user asks the virtual machine built to add up to 10, in this step, the selection course to alternative group is: first select first alternative group in order to build 5 virtual machines, then select the 3rd alternative group in order to build 3 virtual machines, finally then select second alternative group in order to build 2 virtual machines.
By method shown in Fig. 2, three layers of tree topology structure of existing Intel Virtualization Technology have been considered when selecting to carry out server for virtual machine, virtual machine is placed on as far as possible in alternative group of the execution server that comprises maximum quantity, because the execution server in alternative group all directly is connected with same switch, therefore operate in these and carry out communication data between the virtual machine on servers without the forwarding via core layer, and reduced as far as possible the communication interaction between the virtual machine in different alternative group, thereby be conducive to reduce the burden of core layer.This method also can be called greedy algorithm.
It should be noted that herein, because the execution server in selected each alternative group all directly is connected with an exchange, therefore on concrete which execution server, concrete which virtual machine of operation, there is no difference in essence aspect the communication data transfer amount, is not done restriction herein.
The structural representation that Fig. 3 is monitor of virtual machine embodiment of the present invention, in order to realize said method, as shown in the figure, this monitor of virtual machine 10 at least comprises: server is selected module 11, original allocation module 12, historical statistics module 13, super computing module 14 and the final distribution module 15 of selling.It should be noted that, the thick vertical line in figure means bus herein, and each template all is connected on bus, but in the present embodiment, as long as can make above-mentioned each module realize necessary information interaction, adopts other connected modes also to be fine.Below introduce in detail the principle of work of monitor of virtual machine 10:
When monitor of virtual machine 10 receives user's application request, by server, select module 11 according to the virtual machine of asking in the user's application request received to build, select for moving the execution server of described virtual machine; Then be that each described virtual machine distributes the initial resource of the resources requirement that can meet this virtual machine on the described execution server of selecting module 11 to select by original allocation module 12 at server, and build described virtual machine based on this initial resource.
The historical consumed resource of this virtual machine of statistics in the default operation period of the described virtual machine after this, built in original allocation module 12 by historical statistics module 13; Wherein, in the described default operation period, be a period of time that virtual machine is moved based on initial resource, purpose is in order during this period of time to obtain the actual historical consumed resource taken of virtual machine, so that the reference while as follow-up assessment is super, selling resource.
After this, by super described historical consumed resource that computing module 14 counts on according to historical statistics module 13 and the described resources requirement sold, determine and superly sell ratio O, wherein, O ∈ [0,100].Described super while selling ratio O when determining, can consider that actual gain solves following equation:
E(R│O)=Req×price-A(O)×price-(∑Req)×cost×Pr(x>(A(O)+A'))
Wherein relevant super detailed description of selling each several part in ratio O and above-mentioned equation can, referring to said method embodiment, repeat no more herein.
Finally, distribute final resource for each described virtual machine on the described execution server of selecting module 11 to select at server by final distribution module 15, this final resource=A(O), and rebuild described virtual machine based on this final resource, wherein, the cumulative distribution function that A is described historical consumed resource.
The described method of the present embodiment reduces by the super ratio O that sells based on calculating the resource of distributing to virtual machine, thereby, under the prerequisite that guarantees as far as possible the normal operation of virtual machine, has reduced the excessive distribution of resource, has improved the utilization factor of resource.
In addition, as shown in Figure 3, when server is selected between a plurality of virtual machines on described execution server that module 11 selects to clash, virtual machine (vm) migration module 16 can further be set, the virtual machine (vm) migration that clashes is carried out on server to another in same alternative group.Particularly, the virtual machine (vm) migration of committed memory space minimum in the virtual machine clashed can be carried out on server to described another, in order to reduce the expense that migration produces.
Referring to Fig. 4, illustrate the inner structure that described server is selected module 11, as shown in the figure, this server selects module 11 at least to comprise: collector unit 1101, alternative unit 1102, division unit 1103, statistic unit 1104 and selected cell 1105.It should be noted that, the thick vertical line in figure means bus herein, and each template all is connected on bus, but in the present embodiment, as long as can make above-mentioned each module realize necessary information interaction, adopts other connected modes also to be fine.Below the explanation server is selected the principle of work of module 11:
The available resource information of first by collector unit 1101, collecting the whole servers that are positioned at Access Layer; Then the server that the available resource information of being collected according to collector unit 1101 by alternative unit 1102 can build described virtual machine is defined as the alternative services device; Wherein, described alternative services device refers to have the server that enough resources are provided for virtual machine to be built, if enough resources can not be provided, can not be chosen as the alternative services device.
After this, by division unit 1103, for the described alternative services device of being determined by alternative unit 1102, the alternative services device that will directly be connected with same switch in polymer layer is divided into one alternative group.The detailed description of three layers of tree topology structure of relevant Intel Virtualization Technology can, referring to said method embodiment, repeat no more herein.
The quantity of each described alternative group of virtual machine that can build at most of after this, being divided by division unit 1103 according to the resource requirement information statistics of each described virtual machine by statistic unit 1104; And the described quantity order from big to small counted on according to statistic unit 1104 by selected cell 1105 is selected corresponding alternative group successively, until the summation of alternative group of selected corresponding described quantity equals the sum of virtual machine to be built, and the alternative services device in selected described alternative group is chosen as to described execution server.
By structure shown in Fig. 4, three layers of tree topology structure of existing Intel Virtualization Technology have been considered when selecting to carry out server for virtual machine, virtual machine is placed on as far as possible in alternative group of the execution server that comprises maximum quantity, because the execution server in alternative group all directly is connected with same switch, therefore operate in these and carry out communication data between the virtual machine on servers without the forwarding via core layer, and reduced as far as possible the communication interaction between the virtual machine in different alternative group, thereby be conducive to reduce the burden of core layer.This method also can be called greedy algorithm.
One of ordinary skill in the art will appreciate that: realize that the hardware that all or part of step of said method embodiment can be relevant by programmed instruction completes, aforesaid program can be stored in a computer read/write memory medium, this program, when carrying out, is carried out the step that comprises said method embodiment; And aforesaid storage medium comprises: various media that can be program code stored such as ROM, RAM, magnetic disc or CDs.
Finally it should be noted that: above embodiment only, in order to technical scheme of the present invention to be described, is not intended to limit; Although with reference to previous embodiment, the present invention is had been described in detail, those of ordinary skill in the art is to be understood that: its technical scheme that still can put down in writing aforementioned each embodiment is modified, or part technical characterictic wherein is equal to replacement; And these modifications or replacement do not make the essence of appropriate technical solution break away from the spirit and scope of various embodiments of the present invention technical scheme.
Claims (8)
1. a Visualized data centre resource allocation methods, is characterized in that, comprising:
Monitor of virtual machine, according to the virtual machine of asking in the user's application request received to build, is selected for moving the execution server of described virtual machine;
Be that each described virtual machine distributes the initial resource of the resources requirement that can meet this virtual machine on described execution server, and build described virtual machine based on this initial resource;
The historical consumed resource of this virtual machine of statistics within the default operation period of described virtual machine;
Sell ratio O according to described historical consumed resource and definite surpassing of described resources requirement, wherein, O ∈ [0,100], calculate described super value of selling ratio O according to following equation
E(R│O)=Req×price-A(O)×price-(∑Req)×cost×Pr(x>(A(O)+A'))
Wherein, E (R|O) is illustrated in described super prospective earnings value of selling the described virtual machine built under the condition of ratio O, Req means the resources requirement of described virtual machine, price means the resource resources profit unit price, A (O) means take the described super final resource that ratio O distributes as described virtual machine of selling, Σ Req means that described virtual machine place carries out the summation of the resources requirement of the whole virtual machines that move on server, cost means conflict reparation unit price, x means the historical consumed resource of described virtual machine, A ' means the final resource that the execution server at described virtual machine place distributes for other virtual machine except described virtual machine, Pr means probability,
Distribute final resource for each described virtual machine on described execution server, this final resource=A(O), and rebuild described virtual machine based on this final resource, wherein, the cumulative distribution function that A is described historical consumed resource.
2. method according to claim 1, is characterized in that, described monitor of virtual machine selects described server to comprise:
Collection is positioned at the available resource information of whole servers of Access Layer;
The server that can build described virtual machine according to the available resource information of collecting is defined as the alternative services device;
The alternative services device that will directly be connected with same switch in polymer layer is divided into one alternative group;
Add up the quantity of each described alternative group of virtual machine that can build at most according to the resource requirement information of each described virtual machine;
Select successively corresponding alternative group according to the described quantity order from big to small counted on, until the summation of alternative group of selected corresponding described quantity equals the sum of virtual machine to be built;
Alternative services device in selected described alternative group is chosen as to described execution server.
3. method according to claim 2, is characterized in that, also comprises: while clashing between a plurality of virtual machines on described execution server, the virtual machine (vm) migration that clashes is carried out on server to another in same alternative group.
4. method according to claim 3, it is characterized in that, described the virtual machine (vm) migration that clashes is carried out on server and comprised to another of same alternative group: the virtual machine (vm) migration of committed memory space minimum in the virtual machine clashed is carried out on server to described another.
5. a monitor of virtual machine, is characterized in that, comprising:
Server is selected module, asks the virtual machine built for the user's application request according to receiving, and selects for moving the execution server of described virtual machine;
The original allocation module, for selecting at server on described execution server that module selects as each described virtual machine distributes the initial resource of the resources requirement that can meet this virtual machine, and build described virtual machine based on this initial resource;
The historical statistics module, for the historical consumed resource of this virtual machine of statistics in the default operation period of the described virtual machine at the original allocation module construction;
The super computing module of selling, for the described historical consumed resource and definite the surpassing of described resources requirement that count on according to the historical statistics module selling ratio O, wherein, O ∈ [0,100], calculate described super value of selling ratio O according to following equation
E(R│O)=Req×price-A(O)×price-(∑Req)×cost×Pr(x>(A(O)+A'))
Wherein, E (R|O) is illustrated in described super prospective earnings value of selling the described virtual machine built under the condition of ratio O, Req means the resources requirement of described virtual machine, price means the resource resources profit unit price, A (O) means take the described super final resource that ratio O distributes as described virtual machine of selling, Σ Req means that described virtual machine place carries out the summation of the resources requirement of the whole virtual machines that move on server, cost means conflict reparation unit price, x means the historical consumed resource of described virtual machine, A ' means the final resource that the execution server at described virtual machine place distributes for other virtual machine except described virtual machine, Pr means probability,
Final distribution module, for on the described execution server of selecting module to select at server, distributing final resource for each described virtual machine, this final resource=A(O), and rebuild described virtual machine based on this final resource, wherein, the cumulative distribution function that A is described historical consumed resource.
6. monitor of virtual machine according to claim 5, is characterized in that, described server selects module to comprise:
Collector unit, be positioned at the available resource information of whole servers of Access Layer for collection;
Alternative unit, the server that can build described virtual machine for the available resource information of collecting according to collector unit is defined as the alternative services device;
Division unit, for the described alternative services device for being determined by alternative unit, the alternative services device that will directly be connected with same switch in polymer layer is divided into one alternative group;
Statistic unit, the quantity of each described alternative group of virtual machine that can build at most of being divided by division unit for the statistics of the resource requirement information according to each described virtual machine;
Selected cell, select successively corresponding alternative group for the described quantity order from big to small counted on according to statistic unit, until the summation of alternative group of selected corresponding described quantity equals the sum of virtual machine to be built, and the alternative services device in selected described alternative group is chosen as to described execution server.
7. monitor of virtual machine according to claim 6, it is characterized in that, also comprise: the virtual machine (vm) migration module, when selecting when server between a plurality of virtual machines on described execution server that module selects to clash, by the virtual machine (vm) migration that clashes to another execution server in same alternative group.
8. monitor of virtual machine according to claim 7, it is characterized in that: when described virtual machine (vm) migration module is used between a plurality of virtual machines on the described execution server that server selection module is selected clashing, the virtual machine (vm) migration of committed memory space minimum in the virtual machine clashed is carried out on server to described another.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201110401620 CN102521052B (en) | 2011-12-06 | 2011-12-06 | Resource allocation method of virtualized data center and virtual machine monitor |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201110401620 CN102521052B (en) | 2011-12-06 | 2011-12-06 | Resource allocation method of virtualized data center and virtual machine monitor |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102521052A CN102521052A (en) | 2012-06-27 |
| CN102521052B true CN102521052B (en) | 2013-12-25 |
Family
ID=46291987
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 201110401620 Expired - Fee Related CN102521052B (en) | 2011-12-06 | 2011-12-06 | Resource allocation method of virtualized data center and virtual machine monitor |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102521052B (en) |
Families Citing this family (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103634330A (en) * | 2012-08-20 | 2014-03-12 | 曙光信息产业(北京)有限公司 | Automatic resource distribution method in cloud calculation environment |
| GB2508161A (en) | 2012-11-21 | 2014-05-28 | Ibm | Monitoring applications executing on a virtual machine and allocating the required resources to the virtual machine. |
| CN103336722B (en) * | 2013-07-16 | 2017-09-26 | 上海大学 | A kind of CPU resources of virtual machine monitoring and dynamic allocation method |
| WO2015085475A1 (en) * | 2013-12-10 | 2015-06-18 | 华为技术有限公司 | Method and apparatus for scheduling virtual machine resources |
| CN105335208B (en) * | 2014-06-18 | 2019-01-25 | 上海诺基亚贝尔股份有限公司 | Determine the method and apparatus of physical computing resources collision probability in virtual environment |
| CN105320559B (en) * | 2014-07-30 | 2019-02-19 | 中国移动通信集团广东有限公司 | A kind of dispatching method and device of cloud computing system |
| CN105843678B (en) * | 2016-03-17 | 2018-02-06 | 国网山东省电力公司信息通信公司 | The scheduling of resource moving method and system of a kind of virtual machine based on Optimum Theory |
| CN107025137B (en) * | 2016-11-24 | 2020-11-17 | 创新先进技术有限公司 | Resource query method and device |
| CN108196958B (en) * | 2017-12-29 | 2020-09-29 | 北京泽塔云科技股份有限公司 | Resource scheduling and distributing method, computer system and super-fusion architecture system |
| CN111124657B (en) * | 2018-10-31 | 2024-03-08 | 北京金山云网络技术有限公司 | Resource management method, device, electronic equipment and storage medium |
| CN113672392B (en) * | 2021-08-25 | 2023-07-25 | 国家电网有限公司信息通信分公司 | Method and device for optimizing energy consumption, electronic equipment and computer readable storage medium |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101488098A (en) * | 2009-02-13 | 2009-07-22 | 华中科技大学 | Multi-core computing resource management system based on virtual computing technology |
| CN101593134A (en) * | 2009-06-29 | 2009-12-02 | 北京航空航天大学 | Virtual machine cpu resource distribution method and device |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2005116833A1 (en) * | 2004-05-21 | 2005-12-08 | Computer Associates Think, Inc. | Method and apparatus for dynamic cpu resource management |
| US8336049B2 (en) * | 2009-02-05 | 2012-12-18 | Vmware, Inc. | Virtual machine utility computing method and system |
-
2011
- 2011-12-06 CN CN 201110401620 patent/CN102521052B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101488098A (en) * | 2009-02-13 | 2009-07-22 | 华中科技大学 | Multi-core computing resource management system based on virtual computing technology |
| CN101593134A (en) * | 2009-06-29 | 2009-12-02 | 北京航空航天大学 | Virtual machine cpu resource distribution method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102521052A (en) | 2012-06-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102521052B (en) | Resource allocation method of virtualized data center and virtual machine monitor | |
| CN102780759B (en) | Based on the cloud computing resource scheduling method in regulation goal space | |
| Liu et al. | Job scheduling model for cloud computing based on multi-objective genetic algorithm | |
| CN103338241B (en) | A kind of new publicly-owned cloud framework and virtual resources adaptive configuring method thereof | |
| Samaan | A novel economic sharing model in a federation of selfish cloud providers | |
| CN103731372B (en) | Resource supply method for service supplier under hybrid cloud environment | |
| CN103095788A (en) | Cloud resource scheduling policy based on network topology | |
| CN102402399A (en) | Virtual machine memory management in systems with asymmetric memory | |
| CN103064744B (en) | The method for optimizing resources that a kind of oriented multilayer Web based on SLA applies | |
| CN101561769A (en) | Process migration tracking method based on multi-core platform virtual machine | |
| CN105373432B (en) | A kind of cloud computing resource scheduling method based on virtual resource status predication | |
| CN109684074A (en) | Physical machine resource allocation methods and terminal device | |
| CN107506145A (en) | A kind of physical store dispatching method and cloud main frame creation method | |
| Mylavarapu et al. | An optimized capacity planning approach for virtual infrastructure exhibiting stochastic workload | |
| CN108121601A (en) | A kind of application resource dispatching device and method based on weight | |
| CN108073457A (en) | A kind of hierarchical resource management method of super fusion architecture, apparatus and system | |
| Moghaddam et al. | On coordination of smart grid and cooperative cloud providers | |
| CN102917014A (en) | Resource scheduling method and device | |
| Li et al. | Optimization-based resource allocation for software as a service application in cloud computing | |
| US10007559B1 (en) | Virtual tiering | |
| CN104184685B (en) | Data center resource distribution method, apparatus and system | |
| CN104750614B (en) | Method and apparatus for managing memory | |
| CN111367655B (en) | Method, system and storage medium for GPU resource scheduling in cloud computing environment | |
| Chen et al. | An energy‐efficient method of resource allocation based on request prediction in multiple cloud data centers | |
| CN111626528A (en) | Bezier curve-based resource quota determining method and device and electronic equipment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20131225 Termination date: 20171206 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |