LaSS
Authors:
Open Access
- 21 June 2021
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 239-251
Abstract
Serverless computing has emerged as a new paradigm for running short-lived computations in the cloud. Due to its ability to handle IoT workloads, there has been considerable interest in running serverless functions at the edge. However, the constrained nature of the edge and the latency sensitive nature of workloads result in many challenges for serverless platforms. In this paper, we present LaSS, a platform that uses model-driven approaches for running latency-sensitive serverless computations on edge resources. LaSS uses principled queuing-based methods to determine an appropriate allocation for each hosted function and auto-scales the allocated resources in response to workload dynamics. LaSS uses a fair-share allocation approach to guarantee a minimum of allocated resources to each function in the presence of overload. In addition, it utilizes resource reclamation methods based on container deflation and termination to reassign resources from over-provisioned functions to under-provisioned ones. We implement a prototype of our approach on an OpenWhisk serverless edge cluster and conduct a detailed experimental evaluation. Our results show that LaSS can accurately predict the resources needed for serverless functions in the presence of highly dynamic workloads, and reprovision container capacity within hundreds of milliseconds while maintaining fair share allocation guarantees.Keywords
All Related Versions
Funding Information
- NSF (1908536, 1836752, 1802523)
This publication has 18 references indexed in Scilit:
- Supporting Multi-Provider Serverless Computing on the Edge2018
- DeepRT: predictable deep learning inference for cyber-physical systemsReal-Time Systems, 2018
- Serverless computing: economic and architectural impact2017
- Will Serverless End the Dominance of Linux in the Cloud?2017
- The Emergence of Edge ComputingComputer, 2017
- ArA: Adaptive resource allocation for cloud computing environments under bursty workloads2011
- Performance Analysis of Cloud Computing Centers Using M/G/m/m+r Queuing SystemsIEEE Transactions on Parallel and Distributed Systems, 2011
- Power-Aware Speed Scaling in Processor Sharing Systems2009
- Size-based scheduling to improve web performanceACM Transactions on Computer Systems, 2003
- Analysis of SRPT scheduling2001