Locality-aware Load-Balancing for Serverless Clusters

25Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.
Get full text

Abstract

While serverless computing provides more convenient abstractions for developing and deploying applications, the Function-as-a-Service (FaaS) programming model presents new resource management challenges for the FaaS provider. In this paper, we investigate load-balancing policies for serverless clusters. Locality, i.e., running repeated invocations of a function on the same server, is a key determinant of performance because it increases warm-starts and reduces cold-start overheads. We find that the locality vs. load tradeoff is crucial and presents a large design space. We enhance consistent hashing for FaaS, and develop CH-RLU: Consistent Hashing with Random Load Updates, a simple practical load-balancing policy which provides more than 2x reduction in function latency. Our policy deals with highly heterogeneous, skewed, and bursty function workloads, and is a drop-in replacement for OpenWhisk's existing load-balancer. We leverage techniques from caching such as SHARDS for popularity detection, and develop a new approach that places functions based on a tradeoff between locality, load, and randomness.

Cite

CITATION STYLE

APA

Fuerst, A., & Sharma, P. (2022). Locality-aware Load-Balancing for Serverless Clusters. In HPDC 2022 - Proceedings of the 31st International Symposium on High-Performance Parallel and Distributed Computing (pp. 227–239). Association for Computing Machinery, Inc. https://doi.org/10.1145/3502181.3531459

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free