Sequoia
Authors:
Open Access
- 12 October 2020
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 311-327
Abstract
Serverless computing is a rapidly growing paradigm that easily harnesses the power of the cloud. With serverless computing, developers simply provide an event-driven function to cloud providers, and the provider seamlessly scales function invocations to meet demands as event-triggers occur. As current and future serverless offerings support a wide variety of serverless applications, effective techniques to manage serverless workloads becomes an important issue. This work examines current management and scheduling practices in cloud providers, uncovering many issues including inflated application run times, function drops, inefficient allocations, and other undocumented and unexpected behavior. To fix these issues, a new quality-of-service function scheduling and allocation framework, called Sequoia, is designed. Sequoia allows developers or administrators to easily def ne how serverless functions and applications should be deployed, capped, prioritized, or altered based on easily configured, flexible policies. Results with controlled and realistic workloads show Sequoia seamlessly adapts to policies, eliminates mid-chain drops, reduces queuing times by up to 6.4X, enforces tight chain-level fairness, and improves run-time performance up to 25X.Keywords
Funding Information
- Division of Computer and Network Systems (1908910)
This publication has 43 references indexed in Scilit:
- Improving Resource Efficiency at Scale with HeraclesACM Transactions on Computer Systems, 2016
- Large-scale cluster management at Google with Borg2015
- Sparrow2013
- Apache Hadoop YARN2013
- The tail at scaleCommunications of the ACM, 2013
- Data center TCP (DCTCP)ACM SIGCOMM Computer Communication Review, 2010
- Size-based scheduling to improve web performanceACM Transactions on Computer Systems, 2003
- A framework for call graph construction algorithmsACM Transactions on Programming Languages and Systems, 2001
- Call graph construction in object-oriented languages1997
- Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time DisciplineOperations Research, 1968