CN107995039B - Resource self-learning and self-adaptive distribution method for cloud software service - Google Patents

Resource self-learning and self-adaptive distribution method for cloud software service Download PDF

Info

Publication number
CN107995039B
CN107995039B CN201711281436.2A CN201711281436A CN107995039B CN 107995039 B CN107995039 B CN 107995039B CN 201711281436 A CN201711281436 A CN 201711281436A CN 107995039 B CN107995039 B CN 107995039B
Authority
CN
China
Prior art keywords
chromosome
resource
self
learning
software service
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.)
Active
Application number
CN201711281436.2A
Other languages
Chinese (zh)
Other versions
CN107995039A (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.)
Fuzhou University
Original Assignee
Fuzhou 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 Fuzhou University filed Critical Fuzhou University
Priority to CN201711281436.2A priority Critical patent/CN107995039B/en
Publication of CN107995039A publication Critical patent/CN107995039A/en
Application granted granted Critical
Publication of CN107995039B publication Critical patent/CN107995039B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/50Network service management, e.g. ensuring proper service fulfilment according to agreements
    • H04L41/5003Managing SLA; Interaction between SLA and QoS
    • H04L41/5006Creating or negotiating SLA contracts, guarantees or penalties
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements 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/46Multiprogramming arrangements
    • G06F9/50Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5005Allocation of resources, e.g. of the central processing unit [CPU] to service a request
    • G06F9/5027Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals
    • G06F9/505Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals considering the load
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/14Network analysis or design
    • H04L41/145Network analysis or design involving simulating, designing, planning or modelling of a network
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/14Network analysis or design
    • H04L41/147Network analysis or design for predicting network behaviour
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/14Network analysis or design
    • H04L41/142Network analysis or design using statistical or mathematical methods

Abstract

The invention discloses a resource self-learning and self-adaptive distribution method for cloud software service, which comprises the following steps: 1) establishing a QoS model of software service, and training the QoS model through a machine learning algorithm by using a data set of historical data as learning data; 2) constructing a fitness function of the software service resource allocation plan; 3) searching an optimal resource allocation plan based on a genetic algorithm, and performing online automatic allocation decision of resources. The invention has simple operation, can maintain the QoS value at a reasonable level, improves the resource utilization rate and has better cost performance.

Description

Resource self-learning and self-adaptive distribution method for cloud software service
Technical Field
The invention relates to the technical field of software engineering cloud computing, in particular to a resource self-learning and self-adaptive distribution method for cloud software service.
Background
Cloud computing is developing vigorously and a large number of cloud-based software services are apparent. To provide scalability and resiliency under varying workloads, cloud service providers are typically able to provide the ability to configure software and hardware resources in a shared infrastructure. The resiliency of the cloud has led us to manage the transition of cloud-based software service approaches. However, at the early stages of design, it is difficult for software engineers and cloud engineers to predict workload dynamics and runtime requirements for these cloud-based software services. The fact means that it becomes more and more complex for engineers to allocate appropriate resources for software services to guarantee good quality of service and low resource costs.
Software adaptation comes to bear against the complexity of current software systems. Such adaptive systems can configure and reconfigure themselves, enhance their functionality, continually optimize themselves, protect themselves and restore themselves, while keeping much of the complexity hidden from the user and administrator. Adaptive capabilities are needed in resource allocation for cloud-based software services because engineer intervention is difficult or even impossible. Traditional adaptive resource allocation methods are policy driven and are designed by experts. However, software services have different characteristics in workload type and resource preferences. Therefore, cloud engineers typically must develop a separate rule set for each system in order to efficiently allocate resources, resulting in high administrative costs and implementation complexity.
Machine learning, which allows computers to have the ability to learn themselves without explicit procedures, means that it allows systems to learn from data, and the autonomous learning ability needed to achieve enormous achievements in many areas is adaptive resource allocation, which is difficult to obtain because adaptive management is based on knowledge, experience, and rules. However, there are still two problems to be dealt with, firstly, the resource is configured with a large number of metrics and parameters. On the basis of machine learning, expert knowledge of resource allocation is difficult to define, and a proper model is trained from huge historical data; second, quality of service and low cost of resources need to be guaranteed when configuring resources for software services. Based on expert knowledge, it is difficult to make decisions on resource scheduling on-line.
Software services have different QoS values when the runtime environment changes. Depending on the nature of the originating agent, the environmental change may be classified as an external or internal change. External changes are initiated by external elements, while internal changes are applied by the management system.
TABLE 1
Figure GDA0001537722730000021
As shown in Table 1, there are three main elements in this problem area, including external changes, internal changes, and objects. External variations refer to workloads having different numbers and types. Internal changes refer to allocated resources that are made up of several virtual machines that vary in computing power and price. The object refers to an evaluation value calculated by a fitness function, which makes a trade-off between a QoS value and a resource cost. QoS may include goals for response time, data throughput, etc., whose values may be calculated by SLA contracts. The resource Cost (Cost) mainly comes from the lease Cost (CostL) and the stop Cost (CostD) of the virtual machine, and Cost is the CostL+CostD. Therefore, the goal of the adaptive system is to automatically allocate appropriate resources for software services, ensuring quality of service and resourcesLow cost of the source.
Disclosure of Invention
Aiming at the defects of the prior art, the invention provides a resource self-learning and self-adaptive distribution method for cloud software service, which can maintain a QoS value at a reasonable level, improve the resource utilization rate and have better cost performance. In order to achieve the purpose, the technical scheme of the invention is as follows: a resource self-learning and self-adaptive distribution method for cloud software service comprises the following steps:
step 1: establishing a QoS model of the software service, and training the QoS model through a machine learning algorithm by using a data set of historical data as learning data:
Y=Q(X) (1)
wherein the input matrix X comprises a number X of workloadsi,0Proportion of different types of task workload (x)i,1,xi,2,…,xi,m) Allocated resource (x)i,m+1,xi,m+2,…,xi,m+n) Wherein x isi,1+xi,2+…+xi,m=1,xi,m+sThe number of the virtual machines of the s-th class is represented, wherein s is 1,2i
Step 2: constructing a fitness function of the software service resource allocation plan:
Figure GDA0001537722730000022
where fit is the fitness value, CostLIs the lease Cost of the virtual machine, CostDIs the stopping cost of the virtual machine, r1、r2Is weight, set according to the requirements of different systems;
and step 3: searching an optimal resource allocation plan based on a genetic algorithm, and performing online automatic allocation decision of resources. Further, the machine learning algorithm is a non-linear regression, support vector machine, or classification regression tree method. Further, the step 3 specifically includes:
step 31: binary coding is carried out on the resource allocation plan, each chromosome represents a resource allocation plan, and parameter values including the population size, the maximum iteration number and the chromosome number are initialized;
assuming that there are n types of virtual machines, the code length of the number of each type of virtual machine is v, the number of each type of virtual machine ranges from [0,2 ]V-1]The ith chromosome in the tth iteration is defined as follows:
Figure GDA0001537722730000031
the s-th gene in the chromosome represents the number of the s-th class of virtual machines, and s is 1,2, …, n, and is described as follows by using a binary coding method:
Figure GDA0001537722730000032
step 32: calculating the fitness value of each chromosome according to the formula (2);
step 33: chromosomes with low fitness values are selected according to relative probabilities, and random mutation and cross operation are carried out on the chromosomes to update the population, wherein the relative probabilities are defined as follows:
Figure GDA0001537722730000033
step 34: calculating the fitness value of each chromosome of the new population;
step 35: repeating steps 33-34 until a finish loop condition is met;
step 36: and taking the chromosome with the lowest fitness value in the finally obtained new population as an optimal solution, and performing decoding operation on the chromosome to obtain the type and the corresponding number of the virtual machines, wherein the chromosome is the optimal resource allocation plan.
Further, the random mutation refers to randomly selecting a gene position in a chromosome and then mutating its attribute to a new value, i.e., 0 to 1, or 1 to 0.
Further, the crossover operation refers to the exchange of a gene for two parent chromosomes to generate a daughter chromosome.
Compared with the prior art, the invention has the beneficial effects that:
(1) the method greatly reduces the search space when training the Qos prediction model;
(2) the invention can be used under most resource allocation conditions, because the QoS model and the fitness function can be adjusted according to different requirements;
(3) the invention can be independent of workload changes, i.e. predicting the workload and allocating resources independently, therefore, the invention can interact with the workload prediction model;
(4) the invention can maintain the stability of the Qos value at a reasonable level under the condition of the change of the operating environment, can improve the resource utilization rate and obtain higher cost performance.
Drawings
FIG. 1 is a self-learning and adaptive resource configuration framework;
FIG. 2 is a coding scheme for a chromosome of the present invention;
FIG. 3 is a schematic diagram of the operation of the gene mutation of the present invention;
FIG. 4 is a schematic diagram of the gene crossover operation of the present invention;
FIG. 5 is a QoS mapping formula in an embodiment of the present invention;
FIG. 6 is a schematic diagram of the variation of the average workload in an embodiment of the present invention;
fig. 7(a) is a schematic diagram of workload change when Swing is 200 in the embodiment of the present invention;
fig. 7(b) is a schematic diagram of the workload change when Swing is 500 in the embodiment of the present invention;
fig. 8(a) is a response time chart of a software service when Swing is 200 in an embodiment of the present invention;
fig. 8(b) is a Qos value map of the software service when Swing is 200 in the embodiment of the present invention;
fig. 9(a) is a response time chart of a software service when Swing is 500 in an embodiment of the present invention;
fig. 9(b) is a Qos value map of the software service when Swing is 500 in the embodiment of the present invention;
fig. 10(a) is the consumption and utilization of the CPU when Swing is 200 in an embodiment of the present invention;
fig. 10(b) shows memory consumption and usage when Swing is 200 in the embodiment of the present invention;
fig. 11(a) is the consumption and utilization of the CPU when Swing is 500 in an embodiment of the present invention;
fig. 11(b) shows memory consumption and usage when Swing is 500 in the embodiment of the present invention.
Detailed Description
The invention is further explained below with reference to the drawings and the embodiments.
Fig. 1 shows a framework for self-learning and adaptive resource configuration. The system mainly comprises a cloud resource module, an offline input module, an online self-learning module and a self-adaptive management module. The cloud resource module provides an api for monitoring and controlling cloud resources. The offline input module describes basic information about the workload, the virtual machines, and the fitness function. Based on the information of the offline input module, the online self-learning module trains the QoS model from historical data. The adaptive management module automatically allocates the appropriate software service resources using a genetic algorithm based on the QoS model.
The invention discloses a resource self-learning and self-adaptive distribution method for cloud software service, which comprises the following steps:
step 1: establishing a QoS model of the software service, and training the QoS model through a machine learning algorithm by using a data set of historical data as learning data:
Y=Q(X) (1)
wherein the input matrix X comprises a number X of workloadsi,0Proportion of different types of task workload (x)i,1,xi,2,…,xi,m) Allocated resource (x)i,m+1,xi,m+2,…,xi,m+n) Wherein x isi,1+xi,2+…+xi,m=1,xi,m+sThe number of the virtual machines of the s-th class is represented, wherein s is 1,2i(ii) a The data set of the historical data is shown in table 2:
TABLE 2
Figure GDA0001537722730000051
The machine learning algorithm is a non-linear regression, support vector machine, or classification regression tree method.
For the non-linear regression method, the regression equation was established as follows:
Figure GDA0001537722730000052
the mean squared error is used as a loss function, and the matrix W and the parameter b in the above equation are solved by least squares method parameter estimation.
For the Support Vector Machine (SVM) method, the hyperplane equation is set as follows:
Figure GDA0001537722730000053
parameter (u)TV) mapping the feature space by a gaussian kernel, whose function is as follows:
Figure GDA0001537722730000054
for the classification regression tree (CART) method, the purity of the calculated dataset D ═ X, Y) is as follows:
Figure GDA0001537722730000055
wherein p iskIs the proportion of the kth class in the dataset, wherein the dataset can be classified into r classes;
in the attribute column of the input matrix X, the Gini value calculation function of attribute att is as follows:
Figure GDA0001537722730000056
the one with the smallest kini coefficient is considered to be the optimal allocation attribute.
Step 2: constructing a fitness function of the software service resource allocation plan:
Figure GDA0001537722730000061
where fit is the fitness value, CostLIs the lease Cost of the virtual machine, CostDIs the stopping cost of the virtual machine, r1、r2Is weight, set according to the requirements of different systems; y isiThe value of (c) can be calculated by the QoS model and the cost of the virtual machine can be calculated by the contract. Thus, for a given workload and assigned virtual machine, a fitness function value may be calculated.
And step 3: searching an optimal resource allocation plan based on a genetic algorithm, and performing online automatic allocation decision of resources. The step 3 specifically includes:
step 31: binary coding is carried out on the resource allocation plan, each chromosome represents a resource allocation plan, and parameter values including the population size, the maximum iteration number and the chromosome number are initialized;
assuming that there are n types of virtual machines, the code length of the number of each type of virtual machine is v, the number of each type of virtual machine ranges from [0,2 ]V-1]The ith chromosome in the tth iteration is defined as follows:
Figure GDA0001537722730000062
the s-th gene in the chromosome represents the number of the s-th class of virtual machines, and s is 1,2, …, n, and is described as follows by using a binary coding method:
Figure GDA0001537722730000063
the value of each gene in the chromosome may be from 0 to 2v-1 is unequal. For example, fig. 2 shows a chromosome encoded with a resource allocation plan of six VM types in a cloud environment, assuming that the maximum number of virtual machines of each type is 7 (i.e., v is 3), and thus the value of each gene is [0,7 ]]In the range of (1), the chromosome describes the scoreThe allocated resources include 3 vm1, 5 vm2, 5 vm3, 5 vm4, 6 vm5, and 7vm 7.
Step 32: calculating the fitness value of each chromosome according to formula (7);
step 33: chromosomes with low fitness values are selected according to relative probabilities, and random mutation and cross operation are carried out on the chromosomes to update the population, wherein the relative probabilities are defined as follows:
Figure GDA0001537722730000064
step 34: calculating the fitness value of each chromosome of the new population;
step 35: repeating steps 33-34 until a finish loop condition is met;
step 36: and taking the chromosome with the lowest fitness value in the finally obtained new population as an optimal solution, and performing decoding operation on the chromosome to obtain the type and the corresponding number of the virtual machines, wherein the chromosome is the optimal resource allocation plan.
The random mutation refers to randomly selecting a gene position in a chromosome and then mutating the attribute thereof to a new value, i.e., 0 to 1, or 1 to 0. As shown in FIG. 3, gene "101" was mutated to "010".
The crossover operation refers to the exchange of a gene for two parent chromosomes to produce daughter chromosomes. As shown in FIG. 4, "P1" and "P2" are two parent chromosomes. "s 1" and "s 2" represent two daughter chromosomes, in FIG. 4, the "010,101,101" of the gene is exchanged for the "011,100,110" in the gene "P2".
Experimental evaluation was performed by RUBiS benchmark test. RUBiS is an auction site prototype that mimics ebay.com and is commonly used to evaluate the performance scalability of application servers. It provides a client that can simulate user behavior in different workload patterns. The number of clients represents the number of workloads. Assuming that the number of workloads is typically in the range of [0,3000], there are two types of tasks in the workload. The experiment was conducted in a private cloud, with three types of virtual machines, as shown in table 3.
TABLE 3
Property Small Medium Large
CPU 1core 1core 1core
Memory device 1G 2G 4G
Price(s) 1.761RMB/hour 1.885RMB/hour 2.084RMB/hour
In the present embodiment, the QoS value is mainly determined by the response time RT, which is mapped to a range of [0,1], as shown in fig. 5.
In this embodiment, the weight defining the fitness function is as follows:
Figure GDA0001537722730000071
collecting two-week operation data and respectively performing three machine learning method pairsThe QoS model is trained, and in order to evaluate the accuracy of the QoS model, a predicted value QoS is definedpredictAnd actual value QoSactualThe tolerance E, confidence interval Pr and confidence level P are introduced as follows:
P=Pr(QoSactual-E≤QoSpredict≤QoSactual+E) (12)
60 sets of tests were performed, the results are shown in Table 4,
TABLE 4
P E=0.1 E=0.15
NonlinearRegression 83.30% 86.70%
SVM 90.00% 96.70%
CART 91.70% 95.00%
The confidence level of the QoS models based on the support vector machine and the decision tree both exceed 90% when the allowed error of the QoS is set to 0.1, and the confidence level of the QoS models based on the support vector machine and the decision tree both exceed 95% when the allowed error of the QoS is set to 0.15. The accuracy of the QoS model is acceptable from a system management perspective. For the QoS model, model training is carried out based on an original data set, and then a model with high accuracy is selected as a factor of a fitness function.
To evaluate the genetic algorithm based on-line decision method, the inventive method was compared to a rule based method, and table 5 describes a rule based scheme.
TABLE 5
Condition Operation of
Ucpu_ave<30% Shutting down arbitrary virtual machines
Ucpu_ave>60% Launching new VMs of any type
Two tests were performed simulating a three hour workload change as shown in figure 6, the workload average and the ratio of the two tasks each changed every half hour, and for each 30 minute period of the method of the invention the workload in the two tests would change in a sinusoidal manner with different values of swing as shown in figure 7(a) and figure 7 (b).
The inventive method and rule-based method are then used to allocate resources for software services in an automated manner, in accordance with workload changes. The resource allocation scheme when Swing is 200 is shown in table 6, and the resource allocation scheme when Swing is 500 is shown in table 7. Fig. 8(a) fig. 8(b) and fig. 9(a) the response time and QoS values of the software service are depicted in fig. 9 (b). Fig. 10(a) fig. 10(b) and fig. 11(a) fig. 11(b) describe the consumption and utilization of CPU and memory in detail.
TABLE 6
Figure GDA0001537722730000081
TABLE 7
Figure GDA0001537722730000091
As shown in fig. 8, when the workload varies in a sinusoidal pattern with a swing value of 200, the QoS values in the selected solution of the present invention are slightly lower than those in the rule-based solution, the average of the QoS values in the solution of the present invention is about 0.7, and the value of the rule-based solution is about 0.78. However, as shown in FIG. 9, when the workload varies in a sinusoidal pattern with a swing value of 500, the QoS values in the solution according to the invention are slightly higher than those in the solution based on rules, with an average value of about 0.75 for the QoS values and about 0.71 for the solution based on rules. Thus, there is not much difference between the inventive solution and the rule based QoS value, and the inventive solution is more stable than the rule based solution. It can be seen that the inventive solution enables the QoS value to be maintained at a reasonable level.
As shown in tables 6 and 7, the resource cost of the inventive solution is much lower than the rule-based resource cost under the condition of guaranteeing QoS premise. There are two main reasons: on the one hand, although the solution of the invention has almost less allocated resources than the rule-based ones, in practice the resources using both solutions are more or less the same, as shown in fig. 10 and 11. This means that the resource utilization of the inventive solution is almost higher than that of the rule-based solution. On the other hand, the three types of virtual machines had different cost performance, with the larger type being the best in this experiment, as shown in table 3. The method of the present invention tends to use large virtual machines, but the rule-based solution uses virtual machines randomly from among three types. It can be seen that the method of the present invention can provide a reasonable solution with a better performance/price ratio.
Although the present invention has been described with reference to the preferred embodiments, it is not intended to limit the present invention, and those skilled in the art can make variations and modifications of the present invention without departing from the spirit and scope of the present invention by using the methods and technical contents disclosed above. The above description is only a preferred embodiment of the present invention, and all equivalent changes and modifications made in accordance with the claims of the present invention should be covered by the present invention.

Claims (4)

1. A resource self-learning and self-adaptive distribution method for cloud software service is characterized by comprising the following steps:
step 1: establishing a QoS model of the software service, and training the QoS model through a machine learning algorithm by using a data set of historical data as learning data:
Y=Q(X) (1)
wherein the input matrix X comprises a number X of workloadsi,0Proportion of different types of task workload (x)i,1,xi,2,…,xi,m) Allocated resource (x)i,m+1,xi,m+2,…,xi,m+n) Wherein x isi,1+xi,2+…+xi,m=1,xi,m+sThe number of the virtual machines of the s-th class is represented, wherein s is 1,2i
Step 2: constructing a fitness function of the software service resource allocation plan:
Figure FDA0002647605470000011
where fit is the fitness value, CostLIs the lease Cost of the virtual machine, CostDIs the stopping cost of the virtual machine, r1、r2Is weight, set according to the requirements of different systems;
and step 3: searching an optimal resource allocation plan based on a genetic algorithm, and performing online automatic allocation decision of resources; wherein, the step 3 specifically comprises:
step 31: binary coding is carried out on the resource allocation plan, each chromosome represents a resource allocation plan, and parameter values including the population size, the maximum iteration number and the chromosome number are initialized;
assuming that there are n types of virtual machines, the code length of the number of each type of virtual machine is v, the number of each type of virtual machine ranges from [0,2 ]V-1]The ith chromosome in the tth iteration is defined as follows:
Figure FDA0002647605470000012
the s-th gene in the chromosome represents the number of the s-th class of virtual machines, and s is 1,2, …, n, and is described as follows by using a binary coding method:
Figure FDA0002647605470000013
step 32: calculating the fitness value of each chromosome according to the formula (2);
step 33: chromosomes with low fitness values are selected according to relative probabilities, and random mutation and cross operation are carried out on the chromosomes to update the population, wherein the relative probabilities are defined as follows:
Figure FDA0002647605470000014
step 34: calculating the fitness value of each chromosome of the new population;
step 35: repeating steps 33-34 until a finish loop condition is met;
step 36: and taking the chromosome with the lowest fitness value in the finally obtained new population as an optimal solution, and performing decoding operation on the chromosome to obtain the type and the corresponding number of the virtual machines, wherein the chromosome is the optimal resource allocation plan.
2. The method of claim 1, wherein the machine learning algorithm is a non-linear regression, support vector machine, or classification regression tree method.
3. The method for resource self-learning and adaptive allocation according to claim 1, wherein the random mutation is to randomly select a gene location in the chromosome and then mutate its attribute to a new value, i.e. 0 to 1, or 1 to 0.
4. The method of claim 1, wherein the crossover operation is performed by exchanging a gene between two parent chromosomes to generate a child chromosome.
CN201711281436.2A 2017-12-07 2017-12-07 Resource self-learning and self-adaptive distribution method for cloud software service Active CN107995039B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201711281436.2A CN107995039B (en) 2017-12-07 2017-12-07 Resource self-learning and self-adaptive distribution method for cloud software service

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201711281436.2A CN107995039B (en) 2017-12-07 2017-12-07 Resource self-learning and self-adaptive distribution method for cloud software service

Publications (2)

Publication Number Publication Date
CN107995039A CN107995039A (en) 2018-05-04
CN107995039B true CN107995039B (en) 2020-11-03

Family

ID=62036362

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201711281436.2A Active CN107995039B (en) 2017-12-07 2017-12-07 Resource self-learning and self-adaptive distribution method for cloud software service

Country Status (1)

Country Link
CN (1) CN107995039B (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
IT202000031034A1 (en) * 2020-12-16 2022-06-16 Vodafone Italia S P A METHOD FOR MANAGING INFRASTRUCTURE RESOURCES FOR NETWORK FUNCTION VIRTUALIZATION

Families Citing this family (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109144724A (en) * 2018-07-27 2019-01-04 众安信息技术服务有限公司 A kind of micro services resource scheduling system and method
CN109165081B (en) * 2018-08-15 2021-09-28 福州大学 Web application self-adaptive resource allocation method based on machine learning
CN108900980B (en) * 2018-09-21 2020-01-10 北京邮电大学 Resource allocation optimization method based on mobility prediction in heterogeneous network
US11507430B2 (en) * 2018-09-27 2022-11-22 Intel Corporation Accelerated resource allocation techniques
CN110138612B (en) * 2019-05-15 2020-09-01 福州大学 Cloud software service resource allocation method based on QoS model self-correction
CN110209467B (en) * 2019-05-23 2021-02-05 华中科技大学 Elastic resource expansion method and system based on machine learning
CN111314120A (en) * 2020-01-23 2020-06-19 福州大学 Cloud software service resource self-adaptive management framework based on iterative QoS model
CN111090401B (en) * 2020-03-23 2020-06-26 上海飞旗网络技术股份有限公司 Storage device performance prediction method and device
CN111506425B (en) * 2020-04-14 2021-12-17 星辰天合(北京)数据科技有限公司 Method and device for processing quality of service data
CN111638959A (en) * 2020-06-02 2020-09-08 山东汇贸电子口岸有限公司 Elastic expansion method based on load regression prediction in cloud environment and readable storage medium
CN112052071B (en) * 2020-09-08 2023-07-04 福州大学 Cloud software service resource allocation method combining reinforcement learning and machine learning
CN112965813B (en) * 2021-02-10 2023-01-10 山东英信计算机技术有限公司 AI platform resource regulation and control method, system and medium
CN113487078A (en) * 2021-06-30 2021-10-08 上海淇馥信息技术有限公司 Method and device for executing new generation task and electronic equipment
US20230071278A1 (en) * 2021-09-03 2023-03-09 International Business Machines Corporation Using a machine learning module to determine a group of execution paths of program code and a computational resource allocation to use to execute the group of execution paths

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101686553A (en) * 2008-09-24 2010-03-31 ***通信集团公司 Resource adapting method, device and system
US8046765B2 (en) * 2006-07-25 2011-10-25 Hewlett-Packard Development Company, L.P. System and method for determining allocation of resource access demands to different classes of service based at least in part on permitted degraded performance
CN102394812A (en) * 2011-10-21 2012-03-28 南京邮电大学 Self-feedback dynamic self-adaption resource distribution method of cognitive network
CN102780759A (en) * 2012-06-13 2012-11-14 合肥工业大学 Cloud computing resource scheduling method based on scheduling object space
CN103902375A (en) * 2014-04-11 2014-07-02 北京工业大学 Cloud task scheduling method based on improved genetic algorithm
WO2016165392A1 (en) * 2015-04-17 2016-10-20 华南理工大学 Genetic algorithm-based cloud computing resource scheduling method

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8046765B2 (en) * 2006-07-25 2011-10-25 Hewlett-Packard Development Company, L.P. System and method for determining allocation of resource access demands to different classes of service based at least in part on permitted degraded performance
CN101686553A (en) * 2008-09-24 2010-03-31 ***通信集团公司 Resource adapting method, device and system
CN102394812A (en) * 2011-10-21 2012-03-28 南京邮电大学 Self-feedback dynamic self-adaption resource distribution method of cognitive network
CN102780759A (en) * 2012-06-13 2012-11-14 合肥工业大学 Cloud computing resource scheduling method based on scheduling object space
CN103902375A (en) * 2014-04-11 2014-07-02 北京工业大学 Cloud task scheduling method based on improved genetic algorithm
WO2016165392A1 (en) * 2015-04-17 2016-10-20 华南理工大学 Genetic algorithm-based cloud computing resource scheduling method

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
Self-Adaptive and Online QoS Modeling for Cloud-Based Software Services;Tao Chen,etc;《IEEE》;20170531;全文 *

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
IT202000031034A1 (en) * 2020-12-16 2022-06-16 Vodafone Italia S P A METHOD FOR MANAGING INFRASTRUCTURE RESOURCES FOR NETWORK FUNCTION VIRTUALIZATION

Also Published As

Publication number Publication date
CN107995039A (en) 2018-05-04

Similar Documents

Publication Publication Date Title
CN107995039B (en) Resource self-learning and self-adaptive distribution method for cloud software service
Chen et al. Self-adaptive resource allocation for cloud-based software services based on iterative QoS prediction model
Asim et al. A review on computational intelligence techniques in cloud and edge computing
Ghobaei-Arani et al. An efficient resource provisioning approach for analyzing cloud workloads: a metaheuristic-based clustering approach
Karim et al. BHyPreC: a novel Bi-LSTM based hybrid recurrent neural network model to predict the CPU workload of cloud virtual machine
Iftikhar et al. HunterPlus: AI based energy-efficient task scheduling for cloud–fog computing environments
Kołodziej et al. Energy efficient genetic‐based schedulers in computational grids
Jatoth et al. Optimal fitness aware cloud service composition using an adaptive genotypes evolution based genetic algorithm
Thakkar et al. MUVINE: Multi-stage virtual network embedding in cloud data centers using reinforcement learning-based predictions
CN109165081B (en) Web application self-adaptive resource allocation method based on machine learning
Jayanetti et al. Deep reinforcement learning for energy and time optimized scheduling of precedence-constrained tasks in edge–cloud computing environments
Ismaeel et al. Using ELM techniques to predict data centre VM requests
US20220261295A1 (en) Method and system for ai based automated capacity planning in data center
Su et al. Optimal resource allocation in sdn/nfv-enabled networks via deep reinforcement learning
Ahmad et al. Differential evolution with modified initialization scheme using chaotic oppositional based learning strategy
Chen et al. Self‐learning and self‐adaptive resource allocation for cloud‐based software services
Singh et al. Ensemble learning for large-scale workload prediction
CN115686846B (en) Container cluster online deployment method integrating graph neural network and reinforcement learning in edge calculation
Cardellini et al. Self-adaptive container deployment in the fog: A survey
CN114461386A (en) Task allocation method and task allocation device
Moazeni et al. Dynamic resource allocation using an adaptive multi-objective teaching-learning based optimization algorithm in cloud
Chouliaras et al. An adaptive auto-scaling framework for cloud resource provisioning
Kumar et al. QoS‐aware resource scheduling using whale optimization algorithm for microservice applications
CN110233763B (en) Virtual network embedding algorithm based on time sequence difference learning
Prado et al. Genetic fuzzy rule-based scheduling system for grid computing in virtual organizations

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