Exploring Function Granularity for Serverless Machine Learning Application with GPU Sharing
Recent years have witnessed increasing interest in machine learning (ML) inferences on serverless computing due to its auto-scaling and cost-effective properties. However, one critical aspect, function granularity, has been largely overlooked, limiting the potential of serverless ML. This paper explores the impact of function granularity on serverless ML, revealing its important effects on the SLO hit rates and resource costs of serverless applications. It further proposes adaptive granularity as an approach to addressing the phenomenon that no single granularity fits all applications and situations. It explores three predictive models and presents programming tools and runtime extensions to facilitate the integration of adaptive granularity into existing serverless platforms. Experiments show adaptive granularity produces up to a 29.2% improvement in SLO hit rates and up to a 24.6% reduction in resource costs over the state-of-the-art serverless ML which uses fixed granularity.
Authors
- Xinning Hui (ORCID: https://orcid.org/0000-0001-7078-5454)
- Yuanchao Xu (ORCID: https://orcid.org/0000-0003-4165-9138)
- Xipeng Shen (ORCID: https://orcid.org/0000-0003-3599-8010)
Institutions
- North Carolina State University (US)
- University of California, Santa Cruz (US)
Publication Details
- Journal
- ACM SIGMETRICS Performance Evaluation Review
- Published
- 2025-06-16
- DOI
- https://doi.org/10.1145/3744970.3727285
- Primary Topic
- Cloud Computing and Resource Management
- Type
- article
- Field-Weighted Citation Impact
- 0.00