.png){kind=icon}
.png){kind=icon}
Return
Optimizing Completion Time of Requests in Serverless Computing
.png){kind=icon}
PRE
AI
DOI：10.1007/s10922-024-09800-4.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Serverless computing offers people with the liberty of not thinking about the backend side of the things in an application development. They are scalable and cost efficient as they provide pay-for-use service. Providing acceptable performance while having no knowledge about the kind of application is the main challenge the cloud providers have. Many applications may have the need to be completed before the deadline. In that case, the request has to be completed before the deadline or else it will lead to service level agreement violation. If the cloud provider completes the requests faster, there would be less SLA violations. This will also reduce cost for the user as the functions will be completed sooner. Therefore, improving the completion time of the requests will benefit the user as well as the provider. In this paper, we present a method to improve the completion time of requests using genetic algorithm for allocation of requests to virtual machines that could provide optimal completion time for them.
Keywords:
Serverless Ccomputing
Genetic algorithm
Virtual machine
Container placement
Journal
IF:
3.9
Papers:
1.0K
Citations:
1.3K