.png){kind=icon}
返回
DAG Scheduling in Mobile Edge Computing
.png){kind=icon}
OA
AI
DOI：10.1145/3616374.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In Mobile Edge Computing, edge servers have limited storage and computing resources that can only support a small number of functions. Meanwhile, mobile applications are becoming more complex, consisting of multiple dependent tasks, modeled as a Directed Acyclic Graph (DAG). When a request arrives, typically in an online manner with a deadline specified, we need to configure the servers and assign the dependent tasks for efficient processing. This work jointly considers the problem of dependent task placement and scheduling with on-demand function configuration on edge servers, aiming to meet as many deadlines as possible. For a single request, when the configuration on each edge server is fixed, we derive FixDoc to find the optimal task placement and scheduling. When the on-demand function configuration is allowed, we propose GenDoc, a novel approximation algorithm, and analyze its additive error from the optimal theoretically. For multiple requests, we derive OnDoc, an online algorithm easy to deploy in practice. Our extensive experiments show that GenDoc outperforms state-of-the-art baselines in processing 86.14% of these unique applications, and reduces their average completion time by at least 24%. The number of deadlines that OnDoc can satisfy is at least 1.9x that of the baselines.
Keyword:
DAG scheduling
function configuration
edge computing
online algorithm
期刊
IF:
4.7
论文数:
1.0K
被引数:
2.0K
机构
引用论文
分享收藏Highly Efficient and Recyclable g-C3N4/CuO Hybrid Nanocomposite Towards Enhanced Visible-Light Photocatalytic Performance.png)
Nano
NanoIF0
PREAI
分享收藏Energy-Latency Tradeoff for Energy-Aware Offloading in Mobile Edge Computing Networks移动边缘计算网络中能量感知卸载的能量-延迟权衡
PREAI
分享收藏分享收藏
查看更多内容