Pub Date : 2019-04-27DOI: 10.36811/rjcse.2019.110001
S. Yang, Nong Ye
The resource allocation in cloud computing determines the allocation of computer and network resources of service providers to service requests of users for meeting user service requirements. It is not scalable to solve the resource allocation problem as an optimization problem to obtain the optimal solution in real time. This paper presents the development and testing of heuristics for the efficient resource allocation to obtain near-optimal solutions in a scalable manner. We first define the resource allocation problem as a Mixed Integer rogramming (MIP) optimization problem and obtain the optimal solutions for various resource-service problem types. Based on the analysis of the optimal solutions, we design heuristics for the efficient resource allocation. Then we evaluate the performance of the resource allocation heuristics using various resource-service problem types and different numbers of service requests and resources. The results show the comparable performance of the heuristics to the optimal solutions. The resource allocation heuristics also demonstrate the better computational efficiency and thus scalability than solving the MIP problems to obtain the optimal solutions. Keywords: Resource allocation; Clouds computing; Heuristics; Mixed integer programming
{"title":"Heuristics for Efficient Resource Allocation in Cloud Computing","authors":"S. Yang, Nong Ye","doi":"10.36811/rjcse.2019.110001","DOIUrl":"https://doi.org/10.36811/rjcse.2019.110001","url":null,"abstract":"The resource allocation in cloud computing determines the allocation of computer and network resources of service providers to service requests of users for meeting user service requirements. It is not scalable to solve the resource allocation problem as an optimization problem to obtain the optimal solution in real time. This paper presents the development and testing of heuristics for the efficient resource allocation to obtain near-optimal solutions in a scalable manner. We first define the resource allocation problem as a Mixed Integer rogramming (MIP) optimization problem and obtain the optimal solutions for various resource-service problem types. Based on the analysis of the optimal solutions, we design heuristics for the efficient resource allocation. Then we evaluate the performance of the resource allocation heuristics using various resource-service problem types and different numbers of service requests and resources. The results show the comparable performance of the heuristics to the optimal solutions. The resource allocation heuristics also demonstrate the better computational efficiency and thus scalability than solving the MIP problems to obtain the optimal solutions.\u0000\u0000Keywords: Resource allocation; Clouds computing; Heuristics; Mixed integer programming","PeriodicalId":115801,"journal":{"name":"Research Journal of Computer Science and Engineering","volume":"4 7","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114136558","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：