Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2504.06512 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916680239677440 |
|---|---|
| author | Chen, Long Hua, Xinshuai Zhang, Jinquan Li, Wenshuai Li, Xiaoping Guo, Shijie |
| author_facet | Chen, Long Hua, Xinshuai Zhang, Jinquan Li, Wenshuai Li, Xiaoping Guo, Shijie |
| contents | Serverless computing, with its operational simplicity and on-demand scalability, has become a preferred paradigm for deploying workflow applications. However, resource allocation for workflows, particularly those with branching structures, is complicated by cold starts and network delays between dependent functions, significantly degrading execution efficiency and response times. In this paper, we propose the Invocation Concurrency Prediction-Based Scaling (ICPS) algorithm to address these challenges. ICPS employs Long Short-Term Memory (LSTM) networks to predict function concurrency, dynamically pre-warming function instances, and an affinity-based deployment strategy to co-locate dependent functions on the same worker node, minimizing network latency. The experimental results demonstrate that ICPS consistently outperforms existing approaches in diverse scenarios. The results confirm ICPS as a robust and scalable solution for optimizing serverless workflow execution. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_06512 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | ICPS: Real-Time Resource Configuration for Cloud Serverless Functions Considering Affinity Chen, Long Hua, Xinshuai Zhang, Jinquan Li, Wenshuai Li, Xiaoping Guo, Shijie Distributed, Parallel, and Cluster Computing Serverless computing, with its operational simplicity and on-demand scalability, has become a preferred paradigm for deploying workflow applications. However, resource allocation for workflows, particularly those with branching structures, is complicated by cold starts and network delays between dependent functions, significantly degrading execution efficiency and response times. In this paper, we propose the Invocation Concurrency Prediction-Based Scaling (ICPS) algorithm to address these challenges. ICPS employs Long Short-Term Memory (LSTM) networks to predict function concurrency, dynamically pre-warming function instances, and an affinity-based deployment strategy to co-locate dependent functions on the same worker node, minimizing network latency. The experimental results demonstrate that ICPS consistently outperforms existing approaches in diverse scenarios. The results confirm ICPS as a robust and scalable solution for optimizing serverless workflow execution. |
| title | ICPS: Real-Time Resource Configuration for Cloud Serverless Functions Considering Affinity |
| topic | Distributed, Parallel, and Cluster Computing |
| url | https://arxiv.org/abs/2504.06512 |