CN111443989A - Virtual machine placing method, device, equipment and storage medium based on harmony search - Google Patents

Virtual machine placing method, device, equipment and storage medium based on harmony search Download PDF

Info

Publication number
CN111443989A
CN111443989A CN202010210298.4A CN202010210298A CN111443989A CN 111443989 A CN111443989 A CN 111443989A CN 202010210298 A CN202010210298 A CN 202010210298A CN 111443989 A CN111443989 A CN 111443989A
Authority
CN
China
Prior art keywords
harmony
virtual machine
placing
physical host
memory
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.)
Granted
Application number
CN202010210298.4A
Other languages
Chinese (zh)
Other versions
CN111443989B (en
Inventor
张小庆
柏元江
胡亚捷
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Wuhan Polytechnic University
Original Assignee
Wuhan Polytechnic University
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Wuhan Polytechnic University filed Critical Wuhan Polytechnic University
Priority to CN202010210298.4A priority Critical patent/CN111443989B/en
Publication of CN111443989A publication Critical patent/CN111443989A/en
Application granted granted Critical
Publication of CN111443989B publication Critical patent/CN111443989B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/44—Arrangements for executing specific programs
    • G06F9/455—Emulation; Interpretation; Software simulation, e.g. virtualisation or emulation of application or operating system execution engines
    • G06F9/45533—Hypervisors; Virtual machine monitors
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F1/00—Details not covered by groups G06F3/00 - G06F13/00 and G06F21/00
    • G06F1/26—Power supply means, e.g. regulation thereof
    • G06F1/32—Means for saving power
    • G06F1/3203—Power management, i.e. event-based initiation of a power-saving mode
    • G06F1/3234—Power saving characterised by the action undertaken
    • G06F1/329—Power saving characterised by the action undertaken by task scheduling
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/60—Information retrieval; Database structures therefor; File system structures therefor of audio data
    • G06F16/61—Indexing; Data structures therefor; Storage structures
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Software Systems (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Multimedia (AREA)
  • Data Mining & Analysis (AREA)
  • Databases & Information Systems (AREA)
  • Memory System Of A Hierarchy Structure (AREA)
  • Stored Programmes (AREA)

Abstract

The invention belongs to the technical field of cloud computing, and discloses a virtual machine placement method, a virtual machine placement device, virtual machine placement equipment and a storage medium based on harmony search. The method comprises the following steps: acquiring a virtual machine set and a physical host set to be placed, and establishing a harmony memory library according to the virtual machine set and the physical host set; generating a new harmony according to a preset harmony generation condition; carrying out fitness calculation on various harmony waves and new harmony waves in the harmony wave memory library, and updating the harmony waves in the harmony wave memory library according to the calculation result; determining target harmony with the maximum fitness value according to the updating result, and taking tone information of the target harmony as an optimal solution for placing the virtual machine; and placing the virtual machines in the virtual machine set into the physical host corresponding to the physical host set according to the optimal solution for placing the virtual machines. Under the condition that the resource utilization rate and the energy consumption of the physical host are both restricted, the low-energy-consumption optimization of virtual machine placement is formed by generating a new harmony, namely a new placement scheme.

Description

Virtual machine placing method, device, equipment and storage medium based on harmony search
Technical Field
The invention relates to the technical field of cloud computing, in particular to a virtual machine placement method, a virtual machine placement device, virtual machine placement equipment and a storage medium based on harmony search.
Background
The problem of high energy consumption in cloud computing data centers is more and more prominent, and the host energy consumption and the cooling system energy consumption of the cloud computing data centers form a main part of the operation cost of the data centers. Inefficient use of physical hosts increases the energy consumption cost of the data center. Through virtualization technology, a plurality of virtual machines can be virtualized on one physical host, and user applications can be executed by taking the virtual machines as units. How to place virtual machines on a host becomes a key factor that ultimately affects the host's energy consumption. The virtual machine placement problem is the process of placing a set of virtual machines to a physical host. Due to the differences in the resource request heterogeneity and host resource provisioning capabilities of the virtual machines, different virtual machine placement strategies will result in different host energy consumption. Research shows that the idle part of the physical host still consumes more than half of the energy consumption of the full-load host. In order to reduce the overall host energy consumption, the virtual machine placement should be performed by using a smaller number of hosts as much as possible, so as to shut down the completely unused hosts and save the energy consumption of the idle part.
The harmony search mechanism is a heuristic method with high efficiency, the method simulates the performance process of the impromptu music, players impromptu adjust the tones of the musical instruments, and the goal is to play the most beautiful harmony through different tone adjustment, so that the method can be used for both the continuous space optimization problem and the discrete space optimization problem. The method is simple to implement and less in dependent parameters.
Disclosure of Invention
The invention mainly aims to provide a virtual machine placement method, a virtual machine placement device, virtual machine placement equipment and a storage medium based on harmony search, and aims to solve the technical problem of how to realize virtual machine placement with less dependent parameters and low energy consumption.
In order to achieve the above object, the present invention provides a virtual machine placing method based on harmony search, including:
acquiring a virtual machine set and a physical host set to be placed, and establishing a harmony memory library according to the virtual machine set and the physical host set;
generating a new harmony according to a preset harmony generation condition;
carrying out fitness calculation on various harmony waves and the new harmony waves in the harmony wave memory bank, and updating the harmony waves in the harmony wave memory bank according to the calculation result;
determining a target harmony with the maximum fitness value according to the updating result, and taking tone information of the target harmony as an optimal solution for placing the virtual machine;
and placing the virtual machines in the virtual machine set into the physical host corresponding to the physical host set according to the optimal solution for placing the virtual machines.
Preferably, the step of acquiring a virtual machine set and a physical host set to be placed, and establishing a harmony memory base according to the virtual machine set and the physical host set specifically includes:
acquiring the number of physical hosts corresponding to the physical host set and the number of virtual machines corresponding to the virtual machine set;
taking the virtual machine number as the tone information number corresponding to various harmony sounds, and randomly setting tone information corresponding to various harmony sounds according to the physical host number;
and establishing a harmony memory base according to the preset harmony number, the tone information number and the tone information.
Preferably, the step of generating a new harmony sound according to a preset harmony sound generation condition specifically includes:
tone information of which the number is randomly set as the number of the virtual machines is set according to the physical host number so as to obtain harmony to be processed;
and carrying out harmony memory bank selection processing and tone fine-tuning disturbance processing on the harmony to be processed so as to obtain new harmony after processing.
Preferably, the step of performing harmony memory bank selection processing and pitch fine tuning disturbance processing on the harmony to be processed to obtain a new harmony after processing specifically includes:
generating a first random number pair corresponding to each tone information in the harmony to be processed, randomly selecting tone information from the harmony memory base according to the first random number pair and a preset harmony memory base selection probability, and replacing the tone information corresponding to the harmony to be processed with the tone information;
and generating a second random number pair corresponding to each tone information in the harmony to be processed, and performing tone fine-tuning disturbance processing on the replaced tone information according to the second random number pair, the tone regulation probability and the disturbance bandwidth to acquire the processed new harmony.
Preferably, before the step of generating a first random number pair corresponding to each tone information in the to-be-processed harmony, randomly selecting tone information from the harmony memory base according to the first random number pair and a preset harmony memory base selection probability, and replacing the tone information corresponding to the to-be-processed harmony with the tone information, the method further includes:
acquiring the current iteration times of the harmony memory bank;
and updating the tone adjustment probability and the disturbance bandwidth according to the current iteration times.
Preferably, the step of calculating the fitness of each harmony in the harmony memory bank and the new harmony and updating the harmony in the harmony memory bank according to the calculation result specifically includes:
carrying out fitness calculation on various harmony waves and the new harmony waves in the harmony wave memory library;
acquiring the harmony to be selected with the minimum current fitness value in the harmony memory base, and judging whether the fitness value of the new harmony is greater than the fitness value of the harmony to be selected;
and when the fitness value of the new harmony is larger than that of the harmony to be selected, replacing the harmony to be selected with the new harmony so as to update the harmony in the harmony memory library.
Preferably, after the step of determining the target harmony sound with the largest fitness value according to the update result and using the pitch information of the target harmony sound as the optimal solution for virtual machine placement, the method further includes:
detecting the current iteration times of the current harmony memory bank, and judging whether the current iteration times are smaller than the preset iteration times;
when the current iteration times are smaller than the preset iteration times, returning to the step of generating a new harmony according to the preset harmony generation condition;
and outputting the optimal solution for placing the virtual machine when the current iteration times are equal to the preset iteration times.
In addition, to achieve the above object, the present invention further provides a virtual machine placing apparatus based on harmony search, the apparatus including: the system comprises a harmony database establishing module, a fitness calculating module, an optimal solution acquiring module and a placing module, wherein the harmony database establishing module is used for establishing a harmony database;
the system comprises a sound mixing library establishing module, a sound mixing memory library establishing module and a sound mixing memory library establishing module, wherein the sound mixing library establishing module is used for acquiring a virtual machine set and a physical host set to be placed, and establishing the sound mixing memory library according to the virtual machine set and the physical host set;
the fitness calculation module is used for generating a new harmony according to a preset harmony generation condition; the system is also used for calculating the fitness of various harmony waves and the new harmony waves in the harmony memory bank and updating the harmony waves in the harmony memory bank according to the calculation result;
the optimal solution acquisition module is used for determining a target harmony with the maximum fitness value according to the updating result and taking tone information of the harmony as a virtual machine to place an optimal solution;
the placement module is used for placing the virtual machines in the virtual machine set into the physical host corresponding to the physical host set according to the optimal solution for placing the virtual machines.
In addition, to achieve the above object, the present invention further provides a virtual machine placing apparatus based on harmony search, including: a memory, a processor, and a harmony search based virtual machine placement program stored on the memory and executable on the processor, the harmony search based virtual machine placement program configured to implement the steps of the harmony search based virtual machine placement method as described above.
In addition, to achieve the above object, the present invention further provides a storage medium, on which a harmony search based virtual machine placing program is stored, which when executed by a processor implements the steps of the harmony search based virtual machine placing method as described above.
The method comprises the steps of acquiring a virtual machine set and a physical host set to be placed, and establishing a harmony memory base according to the virtual machine set and the physical host set; generating a new harmony according to a preset harmony generation condition; carrying out fitness calculation on various harmony waves and the new harmony waves in the harmony wave memory bank, and updating the harmony waves in the harmony wave memory bank according to the calculation result; determining a target harmony with the maximum fitness value according to the updating result, and taking tone information of the target harmony as an optimal solution for placing the virtual machine; and placing the virtual machines in the virtual machine set into the physical host corresponding to the physical host set according to the optimal solution for placing the virtual machines. Under the condition that the resource utilization rate and the energy consumption of the physical host are both constrained, the low-energy-consumption optimization of virtual machine placement is formed by generating a new harmony, namely a new placement scheme, and the efficiency and the effect of virtual machine placement are improved.
Drawings
Fig. 1 is a schematic structural diagram of a harmony search based virtual machine placement device of a hardware operating environment according to an embodiment of the present invention;
FIG. 2 is a flowchart illustrating a first embodiment of a harmony search based virtual machine placement method according to the present invention;
FIG. 3 is a flowchart illustrating a second embodiment of a harmony search based virtual machine placement method according to the present invention;
fig. 4 is a block diagram illustrating a first embodiment of the harmony search based virtual machine placing apparatus according to the present invention.
The implementation, functional features and advantages of the objects of the present invention will be further explained with reference to the accompanying drawings.
Detailed Description
It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.
Referring to fig. 1, fig. 1 is a schematic structural diagram of a virtual machine placement device based on harmonic search in a hardware operating environment according to an embodiment of the present invention.
As shown in fig. 1, the harmony search based virtual machine placing apparatus may include: a processor 1001, such as a Central Processing Unit (CPU), a communication bus 1002, a user interface 1003, a network interface 1004, and a memory 1005. Wherein a communication bus 1002 is used to enable connective communication between these components. The user interface 1003 may include a Display screen (Display), an input unit such as a Keyboard (Keyboard), and the optional user interface 1003 may also include a standard wired interface, a wireless interface. The network interface 1004 may optionally include a standard wired interface, a WIreless interface (e.g., a WIreless-FIdelity (WI-FI) interface). The Memory 1005 may be a Random Access Memory (RAM) Memory, or may be a Non-Volatile Memory (NVM), such as a disk Memory. The memory 1005 may alternatively be a storage device separate from the processor 1001.
Those skilled in the art will appreciate that the architecture shown in fig. 1 does not constitute a limitation of the harmony search based virtual machine placement device, and may include more or fewer components than shown, or some components in combination, or a different arrangement of components.
As shown in fig. 1, a memory 1005, which is a storage medium, may include therein an operating system, a network communication module, a user interface module, and a harmony search-based virtual machine placing program.
In the harmony search based virtual machine placing apparatus shown in fig. 1, the network interface 1004 is mainly used for data communication with a network server; the user interface 1003 is mainly used for data interaction with a user; the processor 1001 and the memory 1005 of the harmony search based virtual machine placing device of the present invention may be provided in the harmony search based virtual machine placing device, which calls the harmony search based virtual machine placing program stored in the memory 1005 through the processor 1001 and performs the harmony search based virtual machine placing method provided by the embodiment of the present invention.
An embodiment of the present invention provides a virtual machine placement method based on harmony search, and referring to fig. 2, fig. 2 is a flowchart illustrating a first embodiment of a virtual machine placement method based on harmony search according to the present invention.
It should be noted that, in the cloud computing environment, energy consumption of the physical host mainly comes from the CPU, the memory RAM, the storage system, and the like. Typically, the power consumption of the CPU accounts for a significant portion of the power consumption of the physical host. The power saving technique of a single CPU is most commonly used as Dynamic Voltage and Frequency Scaling (DVFS). The technology mainly considers two states of the CPU: an idle state and a loaded state. In an idle state (i.e., without any execution load), the internal components of the CPU may be switched to an off mode, thereby reducing the clock frequency of the CPU, which may operate at a minimum operating frequency, thereby saving power consumption. Under the load condition, the power consumption of the CPU depends on the load amount executed on the CPU and the utilization rate of the CPU. Research has shown that the power consumption of a physical host is linear with its CPU utilization.
Defining the host power consumption formula as:
Figure BDA0002422415130000061
wherein, Pj，maxRepresents a physical host hjThe maximum power consumption of (1), i.e. the power consumption when the physical host is fully loaded, Pj，idleRepresents a physical host hjI.e. the power consumption in the idle condition of the physical host, which is typically 70% of the full power consumption, uj，CPURepresents a physical host hjCPU utilization of.
It is easy to understand that, assuming n virtual machines to be placed in the cloud computing environment, the set V ═ V is expressed1，v2，...，vnThere may be m physical hosts, denoted as set H ═ H1，h2，...，hm}. The virtual machine placement problem is the process of mapping a set of virtual machines to a physical host. Consider requests of three resource types during placement, including:CPU, RAM and DISK storage DISK. Let r bei，CPU、ri，RAMAnd ri，DISKRespectively representing virtual machines viThe amount of requests, i.e., 1, 2., n, c, on CPU resources, memory RAM resources, and storage DISK resourcesj，CPU、cj，RAMAnd cj，DISKRespectively representing physical hosts hjProviding capabilities on CPU resources, memory RAM resources, and storage DISK resources, j 1, 2. Let xi，jRepresenting a Placement factor, indicating a virtual machine viWhether or not to be placed on the physical host hjFor binary variables, the expression of the placement factor is:
Figure BDA0002422415130000062
let zjRepresenting the utilization factor of the physical host, representing the physical host h in the process of placing the virtual machinejWhether the utilization factor is utilized or not is a binary variable, and the expression of the utilization factor is as follows:
Figure BDA0002422415130000063
in order to save the energy consumption of the physical host, the physical host in the fully idle state needs to be converted into a sleep mode, so as to save the energy consumption of the idle physical host. Thus, the energy consumption minimization formula is:
Figure BDA0002422415130000071
the corresponding constraint conditions are as follows in sequence: the virtual machine corresponds to the constraint condition, and ensures that one virtual machine can only be placed on one physical host, and the corresponding formula is as follows:
Figure BDA0002422415130000072
the constraint condition of the placement factor indicates that the placement factor is a binary number which can only take a value of 0 or 1, and the corresponding formula is as follows:
Figure BDA0002422415130000073
the utilization factor constraint condition indicates that the utilization factor of the physical host is a binary number which can only take a value of 0 or 1, and the corresponding formula is as follows:
Figure BDA0002422415130000074
the memory amount constraint condition indicates that the memory amount requested by the virtual machine cannot exceed the memory capacity of the host, and the corresponding formula is as follows:
Figure BDA0002422415130000075
the memory request constraint condition ensures that the memory resource requested by the virtual machine cannot exceed the memory capacity of the physical host, and the corresponding formula is as follows:
Figure BDA0002422415130000076
the storage request constraint condition ensures that the storage resource requested by the virtual machine cannot exceed the storage capacity of the physical host, and the corresponding formula is as follows:
Figure BDA0002422415130000077
in this embodiment, the virtual machine placement method based on harmony search includes the following steps:
step S10, acquiring a virtual machine set and a physical host set to be placed, and establishing a harmony memory base according to the virtual machine set and the physical host set.
Step S10 specifically includes: acquiring the number of physical hosts corresponding to the physical host set and the number of virtual machines corresponding to the virtual machine set; taking the virtual machine number as the tone information number corresponding to various harmony sounds, and randomly setting tone information corresponding to various harmony sounds according to the physical host number; and establishing a harmony memory base according to the preset harmony number, the tone information number and the tone information.
Let one harmony h be represented as:
Xh＝[xh,1,xh,2,...,xh,n]
wherein, the element x in the vectorh，kA tone representing the performance of the kth instrument in the harmony h, the tone corresponding to the physical host number where the virtual machine k is placed, the physical host number having a value of [1, m]The method comprises the following steps of setting an interval inner integer value h as 1, 2, …, HMS, wherein the HMS represents the size of a harmony memory base, the HMS is a preset harmony number and can be set according to actual requirements of problems, and k as 1, 2, …, n and n represent the number of musical instruments and correspond to the total number of virtual machines to be placed, namely the number of corresponding tone information. In other words, an harmony represents a virtual machine placement scheme, which may be defined within the n-dimensional search space. One harmony in the harmony search mechanism under the virtual machine placement problem can only appear in the form of a discrete numerical number between 1 and m, where m represents the maximum number of physical hosts.
In this embodiment, if the harmony sound h is Xh＝[2，1，5，4，2，3，2，1]It is shown that a total of 8 musical instruments play 8 tones, which represents the meaning of the virtual machine placement scheme: virtual machine v1、v5And v7Put to physical host h2Upper, virtual machine v2、v8Put to physical host h1Upper, virtual machine v3Put to physical host h5Upper, virtual machine v4Put to physical host h4Upper, virtual machine v6Put to physical host h3。
All possible harmony sounds may be combined into a matrix, defined as harmony memory HM:
Figure BDA0002422415130000081
and step S20, generating a new harmony sound according to the preset harmony sound generating conditions.
Step S20 specifically includes: tone information of which the number is randomly set as the number of the virtual machines is set according to the physical host number so as to obtain harmony to be processed; and carrying out harmony memory bank selection processing and tone fine-tuning disturbance processing on the harmony to be processed so as to obtain new harmony after processing.
It should be noted that the process of selecting and processing the acoustic memory library specifically includes: and generating a first random number pair corresponding to each tone information in the harmony to be processed, randomly selecting tone information from the harmony memory base according to the first random number pair and the preset harmony memory base selection probability, and replacing the tone information corresponding to the harmony to be processed with the tone information.
For each harmony XhPitch x inh，kN, randomly generating a pair of random numbers, i.e., a first random number pair including a random number r1And a random number r2Both random numbers in the random number pair are between (0, 1).
If r is1If the selection probability is less than the harmony memory bank selection probability HMCR, one harmony HM [ a ] is randomly selected from the harmony memory bank HM][b]Replacement of xh，kA 1, 2, HMS, b 1, 2, n, i.e. pitch xh，kThe updating is as follows:
xh,k＝HM[a][b]
otherwise, if r1>HMCR, then xh，kIs in the interval [1, m ]]And internally randomly generating an integer number, namely:
Figure BDA0002422415130000091
wherein r is2Represents a random number in the interval (0, 1).
It should be noted that the process of pitch fine tuning disturbance processing specifically includes: and generating a second random number pair corresponding to each tone information in the harmony to be processed, and performing tone fine-tuning disturbance processing on the replaced tone information according to the second random number pair, the tone regulation probability and the disturbance bandwidth to acquire the processed new harmony.
It will be readily appreciated that for each harmony XhTone ofxh，kN, and randomly generating a pair of random numbers, i.e., a second random number pair, wherein the first random number pair includes a random number r3And a random number r4Both random numbers in the random number pair are between (0, 1).
At the time of satisfying r1<Simultaneous with HMCR, if r3Less than the pitch adjustment probability PAR, the value HM a of the previous step is further updated][b]And carrying out fine tuning disturbance. The fine tuning disturbance formula is:
Figure BDA0002422415130000092
wherein r is4Denotes a random number in the interval (0, 1), and BW denotes a disturbance bandwidth.
Since the placement scheme is limited to [1, m]Integer values within the interval, i.e. xh，kMust be in the value of [1, m]Within the interval, the updating mode according to the fine tuning disturbance formula may cause the situation that the value is not in the range. Thus, the optimized pitch trimming perturbation formula is:
Figure BDA0002422415130000093
where mod represents the modulo operation,
Figure BDA0002422415130000094
indicating rounding down and m indicating the total number of physical hosts, i.e. the maximum physical host number.
Before the step of generating the first random number pair corresponding to each tone information in the harmony to be processed, randomly selecting tone information from the harmony memory base according to the first random number pair and the preset harmony memory base selection probability, and replacing the tone information corresponding to the harmony to be processed with the tone information, the method further comprises: acquiring the current iteration times of the harmony memory bank; and updating the tone adjustment probability and the disturbance bandwidth according to the current iteration times.
In a traditional harmony search mechanism, the pitch regulation probability PAR and the disturbance bandwidth BW are fixed values, two parameters determine global exploration and local development balance in the harmony search process, and the fixed values do not consider the iterative evolution process of the harmony search. The small PAR in the initial iteration stage can enable the harmony search to have stronger overall exploration capacity, and the algorithm is prevented from being premature and being converged too fast; and the large PAR in the later iteration stage can enable the chorus search to have stronger local development capability, improve the search capability in a local space and accelerate the convergence of the algorithm. The same considerations apply to BW, and as the iteration progresses, corresponding changes should be made.
In this embodiment, the formula corresponding to the pitch adjustment probability PAR is:
Figure BDA0002422415130000101
where PAR (t) denotes the pitch adjustment probability at iteration t, PARminRepresenting the minimum value of the pitch adjustment probability, PARmaxRepresenting the maximum value of the pitch modulation probability, TmaxRepresents the maximum number of iterations of the harmony search, i.e., the maximum number of times of the harmony performance.
In this embodiment, the formula corresponding to the disturbance bandwidth BW is as follows:
Figure BDA0002422415130000102
where BW (t) represents the disturbance bandwidth at iteration t, BWminRepresents the minimum disturbance bandwidth, BWmaxRepresenting the maximum disturbance bandwidth, TmaxRepresents the maximum number of iterations of the harmony search, i.e., the maximum number of times of the harmony performance.
And step S30, calculating the fitness of each harmony in the harmony memory bank and the new harmony, and updating the harmony in the harmony memory bank according to the calculation result.
It should be noted that, fitness calculation is performed on various harmony sounds in the harmony memory library and the new harmony sounds; acquiring the harmony to be selected with the minimum current fitness value in the harmony memory base, and judging whether the fitness value of the new harmony is greater than the fitness value of the harmony to be selected; and when the fitness value of the new harmony is larger than that of the harmony to be selected, replacing the harmony to be selected with the new harmony so as to update the harmony in the harmony memory library. That is, if the new harmony fitness is greater than the worst fitness sum sound in the current harmony memory library HM, replacing the worst fitness sum sound with the newly generated harmony sound; otherwise, the original harmony memory library HM is maintained.
According to the placement target of the virtual machine, the smaller the objective function value is, the larger the individual fitness is. Therefore, the fitness function of the virtual machine placement scheme represented by the evaluation harmony can be set as follows:
Figure BDA0002422415130000103
where P represents the objective function in the energy consumption minimization formula, i.e. minimizing the physical host power consumption.
If the obtained placement scheme cannot meet the physical host resource providing constraint, the fitness of the placement scheme can be set to 0. Thus, when evaluating the quality of the placement solution represented by the harmony, the optimized fitness function is:
Figure BDA0002422415130000111
and step S40, determining the target harmony with the maximum fitness value according to the updating result, and taking the tone information of the target harmony as the optimal solution for placing the virtual machine.
It is readily understood that the goal of virtual machine placement is to reduce host power consumption, and thus, the larger the fitness value, the better the placement solution for harmonic representations.
Step S50, placing the virtual machines in the virtual machine set into the physical hosts corresponding to the physical host set according to the optimal solution for placing the virtual machines.
It is easy to understand that after the optimal solution for placing the virtual machine is obtained, the virtual machine can be placed according to the optimal solution, so that the reasonable application of the physical host resources and the energy consumption is realized.
According to the method, the low-energy-consumption optimization of virtual machine placement is formed by generating a new harmony, namely a new placement scheme under the condition that the resource utilization rate and the energy consumption of the physical host are both constrained, and the efficiency and the effect of virtual machine placement are improved.
Referring to fig. 3, fig. 3 is a flowchart illustrating a virtual machine placing method based on harmony search according to a third embodiment of the present invention. Based on the first embodiment, after step S40, the virtual machine placing method based on harmony search according to this embodiment further includes:
step S401, detecting the current iteration times of the current harmony memory bank, and judging whether the current iteration times is less than the preset iteration times.
And S402, when the current iteration times are less than the preset iteration times, returning to the step of generating a new harmony according to the preset harmony generation condition.
It is easy to understand that the preset iteration number is the maximum iteration number of the harmony memory HM, and the preset iteration number is set according to the requirement of the virtual machine placement problem when the harmony memory HM is generated. And when the iteration times are insufficient, repeatedly generating new harmony, namely a new virtual machine placing scheme, calculating the fitness, performing corresponding judgment according to the calculation result, and updating the harmony memory library HM until the maximum iteration time Tmax is reached. And finally, outputting the harmony with the maximum fitness in the harmony memory library as a final optimal solution for placing the virtual machine.
Step S403, when the current iteration number is equal to the preset iteration number, outputting the optimal solution for virtual machine placement.
According to the method, the new harmony is generated in an iterative mode, the harmony library is continuously updated, a new placing scheme is continuously formed, an optimized placing scheme is obtained, and the placing precision and the placing effect of the virtual machine are improved.
Referring to fig. 4, fig. 4 is a block diagram illustrating a first embodiment of a harmony search based virtual machine placing apparatus according to the present invention. It should be noted that, the present embodiment is based on the cloud computing environment in the foregoing method embodiment, and details are not repeated here. The device comprises: the system comprises a harmony database establishing module 10, a fitness calculating module 20, an optimal solution acquiring module 30 and a placing module 40, wherein the harmony database establishing module is used for establishing a harmony database;
the harmony database establishing module 10 is configured to acquire a virtual machine set and a physical host set to be placed, and establish a harmony memory database according to the virtual machine set and the physical host set.
The harmony database establishing module 10 is specifically configured to: acquiring the number of physical hosts corresponding to the physical host set and the number of virtual machines corresponding to the virtual machine set; taking the virtual machine number as the tone information number corresponding to various harmony sounds, and randomly setting tone information corresponding to various harmony sounds according to the physical host number; and establishing a harmony memory base according to the preset harmony number, the tone information number and the tone information.
Let one harmony h be represented as:
Xh＝[xh,1,xh,2,...,xh,n]
wherein, the element x in the vectorh，kA tone representing the performance of the kth instrument in the harmony h, the tone corresponding to the physical host number where the virtual machine k is placed, the physical host number having a value of [1, m]The method comprises the following steps of setting an interval inner integer value h as 1, 2, …, HMS, wherein the HMS represents the size of a harmony memory base, the HMS is a preset harmony number and can be set according to actual requirements of problems, and k as 1, 2, …, n and n represent the number of musical instruments and correspond to the total number of virtual machines to be placed, namely the number of corresponding tone information. In other words, an harmony represents a virtual machine placement scheme, which may be defined within the n-dimensional search space. One harmony in the harmony search mechanism under the virtual machine placement problem can only appear in the form of a discrete numerical number between 1 and m, where m represents the maximum number of physical hosts.
In this embodiment, if the harmony sound h is Xh＝[2，1，5，4，2，3，2，1]It is shown that a total of 8 musical instruments play 8 tones, which represents the meaning of the virtual machine placement scheme: virtual machine v1、v5And v7Put to physical host h2Upper, virtual machine v2、v8Put to physical host h1Upper, virtual machine v3Put to physical host h5Upper, virtual machine v4Put to physical host h4Upper, virtual machine v6Put to physical host h3。
All possible harmony sounds may be combined into a matrix, defined as harmony memory HM:
Figure BDA0002422415130000131
and the fitness calculating module 20 is configured to generate a new harmony according to the preset harmony generating condition. The tone information is specifically used for randomly setting the number as the virtual machine number according to the physical host number so as to obtain harmony to be processed; and carrying out harmony memory bank selection processing and tone fine-tuning disturbance processing on the harmony to be processed so as to obtain new harmony after processing.
It should be noted that the process of selecting and processing the acoustic memory library specifically includes: and generating a first random number pair corresponding to each tone information in the harmony to be processed, randomly selecting tone information from the harmony memory base according to the first random number pair and the preset harmony memory base selection probability, and replacing the tone information corresponding to the harmony to be processed with the tone information.
For each harmony XhPitch x inh，kN, randomly generating a pair of random numbers, i.e., a first random number pair including a random number r1And a random number r2Both random numbers in the random number pair are between (0, 1).
If r is1If the selection probability is less than the harmony memory bank selection probability HMCR, one harmony HM [ a ] is randomly selected from the harmony memory bank HM][b]Replacement of xh，kA 1, 2, HMS, b 1, 2, n, i.e. pitch xh，kThe updating is as follows:
xh,k＝HM[a][b]
otherwise, if r1>HMCR, then xh，kIs in the interval [1, m ]]And internally randomly generating an integer number, namely:
Figure BDA0002422415130000132
wherein r is2Represents a random number in the interval (0, 1).
It should be noted that the process of pitch fine tuning disturbance processing specifically includes: and generating a second random number pair corresponding to each tone information in the harmony to be processed, and performing tone fine-tuning disturbance processing on the replaced tone information according to the second random number pair, the tone regulation probability and the disturbance bandwidth to acquire the processed new harmony.
It will be readily appreciated that for each harmony XhPitch x inh，kN, and randomly generating a pair of random numbers, i.e., a second random number pair, wherein the first random number pair includes a random number r3And a random number r4Both random numbers in the random number pair are between (0, 1).
At the time of satisfying r1<Simultaneous with HMCR, if r3Less than the pitch adjustment probability PAR, the value HM a of the previous step is further updated][b]And carrying out fine tuning disturbance. The fine tuning disturbance formula is:
Figure BDA0002422415130000141
wherein r is4Denotes a random number in the interval (0, 1), and BW denotes a disturbance bandwidth.
Since the placement scheme is limited to [1, m]Integer values within the interval, i.e. xh，kMust be in the value of [1, m]Within the interval, the updating mode according to the fine tuning disturbance formula may cause the situation that the value is not in the range. Thus, the optimized pitch trimming perturbation formula is:
Figure BDA0002422415130000142
where mod represents the modulo operation,
Figure BDA0002422415130000143
indicating rounding down and m indicating the total number of physical hosts, i.e. the maximum physical host number.
Before the step of generating the first random number pair corresponding to each tone information in the harmony to be processed, randomly selecting tone information from the harmony memory base according to the first random number pair and the preset harmony memory base selection probability, and replacing the tone information corresponding to the harmony to be processed with the tone information, the method further comprises: acquiring the current iteration times of the harmony memory bank; and updating the tone adjustment probability and the disturbance bandwidth according to the current iteration times.
In a traditional harmony search mechanism, the pitch regulation probability PAR and the disturbance bandwidth BW are fixed values, two parameters determine global exploration and local development balance in the harmony search process, and the fixed values do not consider the iterative evolution process of the harmony search. The small PAR in the initial iteration stage can enable the harmony search to have stronger overall exploration capacity, and the algorithm is prevented from being premature and being converged too fast; and the large PAR in the later iteration stage can enable the chorus search to have stronger local development capability, improve the search capability in a local space and accelerate the convergence of the algorithm. The same considerations apply to BW, and as the iteration progresses, corresponding changes should be made.
In this embodiment, the formula corresponding to the pitch adjustment probability PAR is:
Figure BDA0002422415130000144
where PAR (t) denotes the pitch adjustment probability at iteration t, PARminRepresenting the minimum value of the pitch adjustment probability, PARmaxRepresenting the maximum value of the pitch modulation probability, TmaxRepresents the maximum number of iterations of the harmony search, i.e., the maximum number of times of the harmony performance.
In this embodiment, the formula corresponding to the disturbance bandwidth BW is as follows:
Figure BDA0002422415130000145
where BW (t) represents the disturbance bandwidth at iteration t, BWminRepresents the minimum disturbance bandwidth, BWmaxRepresenting the maximum disturbance bandwidth, TmaxRepresents the maximum number of iterations of the harmony search, i.e., the maximum number of times of the harmony performance.
The fitness calculating module 20 is further configured to calculate the fitness of each harmony in the harmony memory bank and the new harmony, and update the harmony in the harmony memory bank according to the calculation result.
It should be noted that, fitness calculation is performed on various harmony sounds in the harmony memory library and the new harmony sounds; acquiring the harmony to be selected with the minimum current fitness value in the harmony memory base, and judging whether the fitness value of the new harmony is greater than the fitness value of the harmony to be selected; and when the fitness value of the new harmony is larger than that of the harmony to be selected, replacing the harmony to be selected with the new harmony so as to update the harmony in the harmony memory library. That is, if the new harmony fitness is greater than the worst fitness sum sound in the current harmony memory library HM, replacing the worst fitness sum sound with the newly generated harmony sound; otherwise, the original harmony memory library HM is maintained.
According to the placement target of the virtual machine, the smaller the objective function value is, the larger the individual fitness is. Therefore, the fitness function of the virtual machine placement scheme represented by the evaluation harmony can be set as follows:
Figure BDA0002422415130000151
where P represents the objective function in the energy consumption minimization formula, i.e. minimizing the physical host power consumption.
If the obtained placement scheme cannot meet the physical host resource providing constraint, the fitness of the placement scheme can be set to 0. Thus, when evaluating the quality of the placement solution represented by the harmony, the optimized fitness function is:
Figure BDA0002422415130000152
and the optimal solution obtaining module 30 is configured to determine a target harmony with the largest fitness value according to the update result, and place the optimal solution by using the tone information of the target harmony as the virtual machine.
It is readily understood that the goal of virtual machine placement is to reduce host power consumption, and thus, the larger the fitness value, the better the placement solution for harmonic representations.
The placing module 40 is configured to place the virtual machine in the virtual machine set into the physical host corresponding to the physical host set according to the optimal solution for placing the virtual machine.
It is easy to understand that after the optimal solution for placing the virtual machine is obtained, the virtual machine can be placed according to the optimal solution, so that the reasonable application of the physical host resources and the energy consumption is realized.
According to the embodiment of the invention, by the device, under the condition that the resource utilization rate and the energy consumption of the physical host are both constrained, the low-energy-consumption optimization of virtual machine placement is formed by generating a new harmony, namely a new placement scheme, and the efficiency and the effect of virtual machine placement are improved.
In addition, an embodiment of the present invention further provides a virtual machine placement device based on harmony search, where the device is an electronic device, and the device includes: a memory, a processor, and a harmony search based virtual machine placement program stored on the memory and executable on the processor, the harmony search based virtual machine placement program configured to implement the steps of the harmony search based virtual machine placement method as described above.
Since the present device adopts all technical solutions of all the above embodiments, at least all the beneficial effects brought by the technical solutions of the above embodiments are achieved, and are not described in detail herein.
In addition, an embodiment of the present invention further provides a storage medium, where a harmony search based virtual machine placing program is stored on the storage medium, and the harmony search based virtual machine placing program is executed by a processor to perform the steps of the harmony search based virtual machine placing method described above.
Since the storage medium adopts all technical solutions of all the embodiments, at least all the beneficial effects brought by the technical solutions of the embodiments are achieved, and no further description is given here.
It should be understood that the above is only an example, and the technical solution of the present invention is not limited in any way, and in a specific application, a person skilled in the art may set the technical solution as needed, and the present invention is not limited thereto.
It should be noted that the above-described work flows are only exemplary, and do not limit the scope of the present invention, and in practical applications, a person skilled in the art may select some or all of them to achieve the purpose of the solution of the embodiment according to actual needs, and the present invention is not limited herein.
In addition, the technical details that are not described in detail in this embodiment may refer to the virtual machine placement method based on harmonic search provided in any embodiment of the present invention, and are not described herein again.
Furthermore, it should be noted that, in the present embodiment, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or system that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or system. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other like elements in a process, method, article, or system that comprises the element.
The above-mentioned serial numbers of the embodiments of the present invention are merely for description and do not represent the merits of the embodiments.
Through the above description of the embodiments, those skilled in the art will clearly understand that the method of the above embodiments can be implemented by software plus a necessary general hardware platform, and certainly can also be implemented by hardware, but in many cases, the former is a better implementation manner. Based on such understanding, the technical solution of the present invention or portions thereof that contribute to the prior art may be embodied in the form of a software product, where the computer software product is stored in a storage medium (e.g. Read Only Memory (ROM)/RAM, magnetic disk, optical disk), and includes several instructions for enabling a terminal device (e.g. a mobile phone, a computer, a server, or a network device) to execute the method according to the embodiments of the present invention.
The above description is only a preferred embodiment of the present invention, and not intended to limit the scope of the present invention, and all modifications of equivalent structures and equivalent processes, which are made by using the contents of the present specification and the accompanying drawings, or directly or indirectly applied to other related technical fields, are included in the scope of the present invention.

Claims (10)

1. A method for placing a virtual machine based on harmony search, the method comprising:
acquiring a virtual machine set and a physical host set to be placed, and establishing a harmony memory library according to the virtual machine set and the physical host set;
generating a new harmony according to a preset harmony generation condition;
carrying out fitness calculation on various harmony waves and the new harmony waves in the harmony wave memory bank, and updating the harmony waves in the harmony wave memory bank according to the calculation result;
determining a target harmony with the maximum fitness value according to the updating result, and taking tone information of the target harmony as an optimal solution for placing the virtual machine;
and placing the virtual machines in the virtual machine set into the physical host corresponding to the physical host set according to the optimal solution for placing the virtual machines.
2. The method for placing virtual machines based on harmony search according to claim 1, wherein the steps of obtaining a set of virtual machines to be placed and a set of physical hosts, and establishing a harmony memory base according to the set of virtual machines and the set of physical hosts specifically include:
acquiring the number of physical hosts corresponding to the physical host set and the number of virtual machines corresponding to the virtual machine set;
taking the virtual machine number as the tone information number corresponding to various harmony sounds, and randomly setting tone information corresponding to various harmony sounds according to the physical host number;
and establishing a harmony memory base according to the preset harmony number, the tone information number and the tone information.
3. The virtual machine placing method based on harmony search as claimed in claim 2, wherein the step of generating a new harmony according to the preset harmony generation condition specifically includes:
tone information of which the number is randomly set as the number of the virtual machines is set according to the physical host number so as to obtain harmony to be processed;
and carrying out harmony memory bank selection processing and tone fine-tuning disturbance processing on the harmony to be processed so as to obtain new harmony after processing.
4. The method for placing the virtual machine based on harmony search as claimed in claim 3, wherein the step of performing harmony memory bank selection processing and pitch fine tuning disturbance processing on the harmony to be processed to obtain the processed new harmony specifically comprises:
generating a first random number pair corresponding to each tone information in the harmony to be processed, randomly selecting tone information from the harmony memory base according to the first random number pair and a preset harmony memory base selection probability, and replacing the tone information corresponding to the harmony to be processed with the tone information;
and generating a second random number pair corresponding to each tone information in the harmony to be processed, and performing tone fine-tuning disturbance processing on the replaced tone information according to the second random number pair, the tone regulation probability and the disturbance bandwidth to acquire the processed new harmony.
5. The method as claimed in claim 4, wherein before the step of generating a first random number pair corresponding to each tone information in the harmony speech, randomly selecting tone information from the harmony memory according to the first random number pair and a preset harmony memory selection probability, and replacing the tone information corresponding to the harmony speech with the tone information, the method further comprises:
acquiring the current iteration times of the harmony memory bank;
and updating the tone adjustment probability and the disturbance bandwidth according to the current iteration times.
6. The method for placing the virtual machine based on the harmony search as claimed in claim 5, wherein the step of calculating the fitness of each harmony in the harmony memory bank and the new harmony and updating the harmony in the harmony memory bank according to the calculation result specifically comprises:
carrying out fitness calculation on various harmony waves and the new harmony waves in the harmony wave memory library;
acquiring the harmony to be selected with the minimum current fitness value in the harmony memory base, and judging whether the fitness value of the new harmony is greater than the fitness value of the harmony to be selected;
and when the fitness value of the new harmony is larger than that of the harmony to be selected, replacing the harmony to be selected with the new harmony so as to update the harmony in the harmony memory library.
7. The virtual machine placement method based on harmony search as set forth in claim 6, wherein after the step of determining the target harmony whose fitness value is the largest according to the update result and using the pitch information of the target harmony as the optimal solution for virtual machine placement, the method further comprises:
detecting the current iteration times of the current harmony memory bank, and judging whether the current iteration times are smaller than the preset iteration times;
when the current iteration times are smaller than the preset iteration times, returning to the step of generating a new harmony according to the preset harmony generation condition;
and outputting the optimal solution for placing the virtual machine when the current iteration times are equal to the preset iteration times.
8. A harmony search based virtual machine placement apparatus, the apparatus comprising: the system comprises a harmony database establishing module, a fitness calculating module, an optimal solution acquiring module and a placing module, wherein the harmony database establishing module is used for establishing a harmony database;
the system comprises a sound mixing library establishing module, a sound mixing memory library establishing module and a sound mixing memory library establishing module, wherein the sound mixing library establishing module is used for acquiring a virtual machine set and a physical host set to be placed, and establishing the sound mixing memory library according to the virtual machine set and the physical host set;
the fitness calculation module is used for generating a new harmony according to a preset harmony generation condition; the system is also used for calculating the fitness of various harmony waves and the new harmony waves in the harmony memory bank and updating the harmony waves in the harmony memory bank according to the calculation result;
the optimal solution acquisition module is used for determining a target harmony with the maximum fitness value according to the updating result and taking tone information of the harmony as a virtual machine to place an optimal solution;
the placement module is used for placing the virtual machines in the virtual machine set into the physical host corresponding to the physical host set according to the optimal solution for placing the virtual machines.
9. A harmony search based virtual machine placement device, the device comprising: a memory, a processor, and a harmony search based virtual machine placement program stored on the memory and executable on the processor, the harmony search based virtual machine placement program configured to implement the steps of the harmony search based virtual machine placement method as recited in any one of claims 1 to 7.
10. A storage medium having a harmony search based virtual machine placing program stored thereon, wherein the harmony search based virtual machine placing program when executed by a processor implements the steps of the harmony search based virtual machine placing method according to any one of claims 1 to 7.
CN202010210298.4A 2020-03-23 2020-03-23 Virtual machine placement method, device, equipment and storage medium based on harmony search Active CN111443989B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010210298.4A CN111443989B (en) 2020-03-23 2020-03-23 Virtual machine placement method, device, equipment and storage medium based on harmony search

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010210298.4A CN111443989B (en) 2020-03-23 2020-03-23 Virtual machine placement method, device, equipment and storage medium based on harmony search

Publications (2)

Publication Number Publication Date
CN111443989A true CN111443989A (en) 2020-07-24
CN111443989B CN111443989B (en) 2023-06-23

Family

ID=71654324

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010210298.4A Active CN111443989B (en) 2020-03-23 2020-03-23 Virtual machine placement method, device, equipment and storage medium based on harmony search

Country Status (1)

Country Link
CN (1) CN111443989B (en)

Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6584612B1 (en) * 1999-07-15 2003-06-24 International Business Machines Corporation Transparent loading of resources from read-only memory for an application program
CN1805483A (en) * 2006-01-23 2006-07-19 王凌云 Multimedia transmission and playing method and system in mobile phone network
CN102789493A (en) * 2012-07-06 2012-11-21 葛彦强 Self-adaptive dual-harmony optimization method
CN103853618A (en) * 2014-03-06 2014-06-11 南京理工大学 Resource allocation method with minimized cloud system cost based on expiration date drive
CN106227491A (en) * 2016-08-04 2016-12-14 浪潮电子信息产业股份有限公司 A kind of remote desktop video broadcasting method, server, client and system
US20180253453A1 (en) * 2017-03-01 2018-09-06 International Business Machines Corporation Iterative widening search for designing chemical compounds
CN109961152A (en) * 2019-03-14 2019-07-02 广州多益网络股份有限公司 Personalized interactive method, system, terminal device and the storage medium of virtual idol
CN110135094A (en) * 2019-05-22 2019-08-16 长沙理工大学 A kind of virtual plant Optimization Scheduling based on shrink space harmony algorithm
US20190325079A1 (en) * 2018-04-24 2019-10-24 Rovi Guides, Inc. Systems and methods for updating search results based on a conversation

Patent Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6584612B1 (en) * 1999-07-15 2003-06-24 International Business Machines Corporation Transparent loading of resources from read-only memory for an application program
CN1805483A (en) * 2006-01-23 2006-07-19 王凌云 Multimedia transmission and playing method and system in mobile phone network
CN102789493A (en) * 2012-07-06 2012-11-21 葛彦强 Self-adaptive dual-harmony optimization method
CN103853618A (en) * 2014-03-06 2014-06-11 南京理工大学 Resource allocation method with minimized cloud system cost based on expiration date drive
CN106227491A (en) * 2016-08-04 2016-12-14 浪潮电子信息产业股份有限公司 A kind of remote desktop video broadcasting method, server, client and system
US20180253453A1 (en) * 2017-03-01 2018-09-06 International Business Machines Corporation Iterative widening search for designing chemical compounds
US20190325079A1 (en) * 2018-04-24 2019-10-24 Rovi Guides, Inc. Systems and methods for updating search results based on a conversation
CN109961152A (en) * 2019-03-14 2019-07-02 广州多益网络股份有限公司 Personalized interactive method, system, terminal device and the storage medium of virtual idol
CN110135094A (en) * 2019-05-22 2019-08-16 长沙理工大学 A kind of virtual plant Optimization Scheduling based on shrink space harmony algorithm

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
"《计算机工程与设计》2014年第35卷总目次", 计算机工程与设计, no. 12 *
李远征: "云环境中基于混合和声算法的资源调度方案", vol. 29, no. 10, pages 1 - 4 *

Also Published As

Publication number Publication date
CN111443989B (en) 2023-06-23

Similar Documents

Publication Publication Date Title
US11663125B2 (en) Cache configuration performance estimation
US10175745B2 (en) Optimizing power consumption by dynamic workload adjustment
Deng et al. Mobile service selection for composition: An energy consumption perspective
CN111324422B (en) Multi-target virtual machine deployment method, device, equipment and storage medium
TWI482008B (en) Processor,method and system for user level control of power management policies
CN105702249B (en) The method and apparatus for automatically selecting accompaniment
CN106775638A (en) A kind of object serialization method, device and computing device
CN104461739B (en) A kind of virtual machine batch dispositions method based on cloudsim platforms
CN111338765B (en) Virtual machine deployment method, device, equipment and storage medium based on cat swarm algorithm
CN111860841A (en) Quantization model optimization method, device, terminal and storage medium
CN112380016A (en) Cloud computing resource load balancing scheduling method based on improved genetic algorithm and application
CN115033377A (en) Service resource prediction method and device based on cluster server and electronic equipment
CN111443989A (en) Virtual machine placing method, device, equipment and storage medium based on harmony search
CN109697083A (en) Fixed point accelerated method, device, electronic equipment and the storage medium of data
CN115470901B (en) Hybrid precision training method and equipment for supporting load sharing of mobile terminal heterogeneous processor
CN115374164A (en) Frequency searching and adjusting speed method and device and data processing equipment
Wu et al. MOC: Multi-Objective Mobile CPU-GPU Co-Optimization for Power-Efficient DNN Inference
CN115593264A (en) Charging optimization control method and device based on edge calculation and computer equipment
Ertl UltraLogLog: A Practical and More Space-Efficient Alternative to HyperLogLog for Approximate Distinct Counting
CN106569576A (en) CPU performance mode adjustment method and mobile device
US9329876B2 (en) Resource aware programming
CN111427661A (en) Virtual machine placing method and device, electronic equipment and storage medium
Zhu et al. New deadline-aware energy-consumption optimization model and genetic algorithm under cloud computing
Fasciani Interactive computation of timbre spaces for sound synthesis control
JP3006095B2 (en) Musical sound wave generator

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant