Font Size: a A A

Greedy Algorithm Based Cloud Computing Resource Scheduling Strategy

Posted on:2019-06-27Degree:MasterType:Thesis
Country:ChinaCandidate:Y H WangFull Text:PDF
GTID:2428330566478259Subject:Computational Mathematics
Abstract/Summary:PDF Full Text Request
Cloud computing is currently one of the most cutting-edge exploration directions in the network information industry.Due to the commercialization of cloud services,the huge economic benefits of cloud computing as an emerging operating method are gradually emerging.When cloud computing services are used as transaction services to provide services to consumers,the guarantee of QoS(Quality of Service)related to cloud computing services becomes particularly critical.The QoS of cloud computing resources relates to the core interests of users.At the same time,The cloud computing service provider can only obtain the user's approval and success only if it guarantees QoS.Therefore,it is very important that this study is based on the content related to QoS cloud computing resource scheduling.The main research results of this paper are as follows:(1)Based on multi-level QoS cloud computing resource scheduling algorithm designed to provide experienced user experience when customer service usage of purchasing services is not high and surplus resources are available,customer resource utilization rate of purchasing services rapidly increases.At the same time,the resource is returned from the experienced user to the customer who purchased the service.While ensuring the QoS of the customer who purchased the service,the proportion of the possible user experience is increased,and the conversion rate from the user experiencing the user to the customer who purchases the service is found from the proportion of the energy loss.Explore its feasibility.(2)Using the Cloudsim simulation tool as a means,a simulation experiment was performed on a new type of research and design algorithm.Compared with theBindCloudletToVMO method in the DataCenterBroker class,the greedy algorithm and task allocation based on the rapid ordering greedy algorithm designed in this study were implemented.The algorithm is compared.The result proves that: Compared with greedy algorithm,the algorithm designed in this study can avoid the problem of greedy algorithm well at the same time,so that the algorithm allocation time is significantly reduced,and at the same time,the cloud computing service provider is well promoted.QoS guarantee level.According to simulation simulation based on multi-level QoS cloud computing resource scheduling algorithm,the possible profit obtained by the cloud computing service provider is greater than the cost of energy loss increase,which can theoretically be achieved.It also needs to demonstrate its feasibility from the perspective of market economy.
Keywords/Search Tags:cloud computing, multi-level Qo S, resource scheduling, rapid sequencing
PDF Full Text Request
Related items