Data-driven scheduling in serverless computing to reduce response time
Bart{\l}omiej Przybylski, Pawe{\l} \.Zuk, Krzysztof Rzadca

TL;DR
This paper proposes data-driven heuristics for scheduling functions in serverless computing to reduce response times, demonstrating significant improvements over traditional scheduling methods through simulation on real Azure Functions data.
Contribution
It introduces new scheduling heuristics based on local call frequency and execution time data, tailored for FaaS environments, improving response times.
Findings
Significant response time reduction compared to FIFO and round-robin.
Effective adaptation of theoretical scheduling algorithms like SEPT and SERPT.
Validation using real Azure Functions trace data.
Abstract
In Function as a Service (FaaS), a serverless computing variant, customers deploy functions instead of complete virtual machines or Linux containers. It is the cloud provider who maintains the runtime environment for these functions. FaaS products are offered by all major cloud providers (e.g. Amazon Lambda, Google Cloud Functions, Azure Functions); as well as standalone open-source software (e.g. Apache OpenWhisk) with their commercial variants (e.g. Adobe I/O Runtime or IBM Cloud Functions). We take the bottom-up perspective of a single node in a FaaS cluster. We assume that all the execution environments for a set of functions assigned to this node have been already installed. Our goal is to schedule individual invocations of functions, passed by a load balancer, to minimize performance metrics related to response time. Deployed functions are usually executed repeatedly in response…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
