{"title":"An Optimal Technique for Computation-intensive Task Allocation at Virtual Machines","authors":"Akil Uddin Chowdhury, Md. Sazzad Hossen, M. Zahed","doi":"10.1109/ECCE57851.2023.10101526","DOIUrl":null,"url":null,"abstract":"Currently, the world is moving towards data-driven cloud-based services for diverse applications. In such applications, the user is more willing to request space and computational resources from a virtual machine (VM) rather than investing in building more costly and space-consuming physical machines. This ever-increasing demand for VMs introduces a growing need for optimal task allocations. The goal of this study is to develop a model to allocate user requests for tasks into the least possible number of available VMs. The problem is designed as an integer linear programming (ILP) optimization problem. To solve the problem in a practical time span, a heuristic algorithm is also designed. The simulation results show that the heuristic approach achieves a near-optimal solution for task allocation and eventually leads to reduced setup and operational costs for the service providers.","PeriodicalId":131537,"journal":{"name":"2023 International Conference on Electrical, Computer and Communication Engineering (ECCE)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 International Conference on Electrical, Computer and Communication Engineering (ECCE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ECCE57851.2023.10101526","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Currently, the world is moving towards data-driven cloud-based services for diverse applications. In such applications, the user is more willing to request space and computational resources from a virtual machine (VM) rather than investing in building more costly and space-consuming physical machines. This ever-increasing demand for VMs introduces a growing need for optimal task allocations. The goal of this study is to develop a model to allocate user requests for tasks into the least possible number of available VMs. The problem is designed as an integer linear programming (ILP) optimization problem. To solve the problem in a practical time span, a heuristic algorithm is also designed. The simulation results show that the heuristic approach achieves a near-optimal solution for task allocation and eventually leads to reduced setup and operational costs for the service providers.