Dependent Function Embedding for Distributed Serverless Edge Computing
- 29 December 2021
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 33 (10) , 2346-2357
Abstract
Edge computing is booming as a promising paradigm to extend service provisioning from the centralized cloud to the network edge. Benefit from the development of serverless computing, an edge server can be configured as a carrier of limited serverless functions, in the way of deploying Docker runtime and Kubernetes engine. Meanwhile, an application generally takes the form of directed acyclic graphs (DAGs), where vertices represent dependent functions and edges represent data traffic. The status quo of minimizing the completion time (a.k.a. makespan) of the application motivates the study on optimal function placement. However, current approaches lose sight of proactively splitting and mapping the traffic to the logical data paths between the heterogeneous edge servers, which could affect the makespan significantly. To remedy that, we propose an algorithm, termed as Dependent Function Embedding (DPE), to get the optimal edge server for each function to execute and the moment it starts executing. DPE finds the best segmentation of each data traffic by exquisitely solving several infinity norm minimization problems. DPE is theoretically verified to achieve the global optimality. Extensive experiments on Alibaba cluster trace show that DPE significantly outperforms two baseline algorithms in makespan by 43.19% and 40.71%, respectively.Keywords
Funding Information
- Key Research Project of Zhejiang Province (2022C01145)
- National Natural Science Foundation of China (U20A20173, 62125206)
- Zhejiang University De-qing Institute of Advanced technology and Industrilization
This publication has 31 references indexed in Scilit:
- Empowering Low-Latency Applications Through a Serverless Edge Computing Architecture2017
- A Survey on Mobile Edge Computing: The Communication PerspectiveIEEE Communications Surveys & Tutorials, 2017
- The Algorithmic Aspects of Network SlicingIEEE Communications Magazine, 2017
- Network Slicing in 5G: Survey and ChallengesIEEE Communications Magazine, 2017
- Hermes: Latency Optimal Task Assignment for Resource-constrained Mobile ComputingIEEE Transactions on Mobile Computing, 2017
- Virtual network functions placement and routing optimization2015
- The Complexity of the Simplex Method2015
- T-Storm: Traffic-Aware Online Scheduling in Storm2014
- Placement Strategies for Internet-Scale Data Stream SystemsIEEE Internet Computing, 2008
- Performance-effective and low-complexity task scheduling for heterogeneous computingIEEE Transactions on Parallel and Distributed Systems, 2002