Popularity-Aware Layer-Wise Caching and Function Scheduling for Dynamic Workflow at the Edge
- 21 November 2025
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 25 (5) , 6277-6291
Abstract
Serverless Edge Computing (SEC) has emerged as a promising paradigm for delivering low-latency, resource-efficient services for edge-native applications, which are implemented as dependent functions, forming Directed Acyclic Graph (DAG) workflows. Unfortunately, the application’s performance is hindered by the notorious issue of cold startup, especially in resource-constrained SEC environments. Layer-wise container caching has been proven to be an effective startup acceleration solution in SEC, due to its fine granularity and flexibility. However, due to the dynamic nature of call graphs and the skewness in function popularity in DAG workflows, as well as the heterogeneity of container layer cold start time and edge computing environments, the performance of existing layer-wise caching mechanisms degrades significantly. To solve this problem, we propose an efficient DAG workflow deployment method in SEC to minimize the application completion time (ACT) in the long term. We model the problem as a joint optimization of container layer-wise caching and function scheduling, which is a Time-coupled Integer Nonlinear Programming (TINLP) problem. To solve it, we first convert it to an Integer Linear Programming (ILP) problem and propose an online algorithm with theoretical performance guarantees. Extensive experiments demonstrate that our method achieves up to $2.92\times$ speedup in ACT reduction.
Keywords
Funding Information
- National Natural Science Foundation of China
- National Natural Science Foundation of China (62232004)
- National Natural Science Foundation of China (62272101)
- Shenzhen Science and Technology Program (KJZD20240903100814018)
- Jiangsu Provincial Frontier Technology Research and Development Program (BF2024070)
- Jiangsu Provincial Key Laboratory of Network and Information Security (BM2003201)
- Key Laboratory of Computer Network and Information Integration of Ministry of Education of China (93K-9)
- Jiangsu Provincial Key Research and Development Program (BE2022065-4)
- Natural Science Foundation of Jiangsu Province (BK20230083)
- Collaborative Innovation Center of Novel Software Technology and Industrialization and Collaborative Innovation Center of Wireless Communications Technology
This publication has 39 references indexed in Scilit:
- On Efficient Zygote Container Planning and Task Scheduling for Edge Native Application Acceleration2024
- Learning Context-Aware Probabilistic Maximum Coverage Bandits: A Variance-Adaptive Approach2024
- Online Container Caching with Late-Warm for IoT Data Processing2024
- On Efficient Zygote Container Planning toward Fast Function Startup in Serverless Edge Cloud2023
- Variance-Adaptive Algorithm for Probabilistic Maximum Coverage Bandits with General Feedback2023
- Layered Structure Aware Dependent Microservice Placement Toward Cost Efficient Edge Clouds2023
- Reliable Transactions in Serverless-Edge Architecture2023
- Retention-Aware Container Caching for Serverless Edge Computing2022
- Enabling Low Latency Edge Intelligence based on Multi-exit DNNs in the Wild2021
- On the average number of steps of the simplex method of linear programmingMathematical Programming, 1983