SLA for Sequential Serverless Chains: A Machine Learning Approach

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

Abstract

Despite its vast potential, a challenge facing serverless computing's wide-scale adoption is the lack of Service Level Agreements (SLAs) for serverless platforms. This challenge is compounded when composition technologies are employed to construct large applications using chains of functions. Due to the dependency of a chain's performance on each function forming it, a single function's sub-optimal performance can result in performance degradations of the entire chain. This paper sheds light on this problem and provides a categorical classification of the factors that impact a serverless function execution performance. We discuss the challenge of serverless chains' SLA and present the results of leveraging FaaS2F, our proposed serverless SLA framework, to define SLAs for fixed-size and variable-size sequential serverless chains. The validation results demonstrate high accuracy in detecting sub-optimal executions exceeding 79%.

Cite

CITATION STYLE

APA

Elsakhawy, M., & Bauer, M. (2021). SLA for Sequential Serverless Chains: A Machine Learning Approach. In Proceedings of the 7th International Workshop on Serverless Computing, WoSC 2021 (pp. 36–41). Association for Computing Machinery, Inc. https://doi.org/10.1145/3493651.3493671

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