Paper Info
Title
The Serverless Scheduling Problem and NOAH.
Abstract
The serverless scheduling problem poses a new challenge to Cloud service platform providers because it is rather a job scheduling problem than a traditional resource allocation or request load balancing problem. Traditionally, elastic cloud applications use managed virtual resource allocation and employ request load balancers to orchestrate the deployment. With serverless, the provider needs to solve both the load balancing and the allocation. This work reviews the current Apache OpenWhisk serverless event load balancing and a noncooperative game-theoretic load balancing approach for response time minimization in distributed systems. It is shown by simulation that neither performs well under high system utilization which inspired a noncooperative online allocation heuristic that allows tuning the trade-off between for response time and resource cost of each serverless function.
Year
Venue
Field
2018
arXiv: Distributed, Parallel, and Cluster Computing
Heuristic,Software deployment,Job shop scheduling,Computer science,Load balancing (computing),Response time,Resource allocation,Job scheduler,Distributed computing,Cloud computing
DocType
Volume
Citations 
Journal
abs/1809.06100
0
PageRank 
References 
Authors
0.34
0
1
Name
Order
Citations
PageRank
Manuel Stein144.49