TL;DR
This paper explores the dynamic nature of application statefulness in serverless computing, proposing a joint resource allocation model that enables applications to adapt between stateless and stateful modes for optimized performance and cost.
Contribution
It introduces a mathematical formulation for resource management that considers both stateless and stateful modes as a time-varying property, enabling adaptive application operation.
Findings
The proposed model efficiently solves resource allocation at run-time.
Simulation results show improved performance and cost optimization.
Applications can dynamically switch modes based on network and workload conditions.
Abstract
Serverless computing has emerged as a very popular cloud technology, together with its companion Function-as-a-Service (FaaS) programming model enabling invocations of stateless functions from clients. An evolution of serverless is now taking place, shifting it towards the edge of the network and broadening its scope to stateful functions, as well. In this paper we argue that stateless vs. stateful is not a dichotomy of the application per se, but rather a time-varying property of most (if not all) applications, as confirmed by the analysis of real traces collected in a production environment. Based on this observation, we propose a mathematical formulation of a resource allocation problem that jointly encompasses both operation modes, dubbed lambda vs. mu, which can be solved efficiently at run-time by an edge orchestrator. We evaluate the proposed solution via simulation experiments…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
