Optimal Accuracy-Time Trade-off for Deep Learning Services in Edge Computing Systems
| Autor: | Hana Khamfroush, Andrew Wachal, Daniel E. Lucani, Minoo Hosseinzadeh |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2020 |
| Předmět: |
Networking and Internet Architecture (cs.NI)
FOS: Computer and information sciences task offloading Linear programming Computer science business.industry Deep learning deep learning quality of experience raspberry pi Scheduling (computing) Reduction (complexity) Computer Science - Networking and Internet Architecture Computer engineering Computer Science - Distributed Parallel and Cluster Computing Server user satisfaction Mobile edge computing resource management Artificial intelligence Distributed Parallel and Cluster Computing (cs.DC) Heuristics business Greedy algorithm Edge computing |
| Zdroj: | ICC Hosseinzadeh, M, Wachal, A, Khamfroush, H & Lucani Rötter, D E 2021, Optimal Accuracy-Time Trade-off For Deep Learning Services in Edge Computing Systems . in ICC 2021-IEEE International Conference on Communications, Proceedings . IEEE, IEEE International Conference on Communications, 14/06/2021 . https://doi.org/10.1109/ICC42927.2021.9500744 |
| DOI: | 10.1109/ICC42927.2021.9500744 |
| Popis: | With the increasing demand for computationally intensive services like deep learning tasks, emerging distributed computing platforms such as edge computing (EC) systems are becoming more popular. Edge computing systems have shown promising results in terms of latency reduction compared to the traditional cloud systems. However, their limited processing capacity imposes a trade-off between the potential latency reduction and the achieved accuracy in computationally-intensive services such as deep learning-based services. In this paper, we focus on finding the optimal accuracy-time trade-off for running deep learning services in a three-tier EC platform where several deep learning models with different accuracy levels are available. Specifically, we cast the problem as an Integer Linear Program, where optimal task scheduling decisions are made to maximize overall user satisfaction in terms of accuracy-time trade-off. We prove that our problem is NP-hard and then provide a polynomial constant-time greedy algorithm, called GUS, that is shown to attain near-optimal results. Finally, upon vetting our algorithmic solution through numerical experiments and comparison with a set of heuristics, we deploy it on a test-bed implemented to measure for real-world results. The results of both numerical analysis and real-world implementation show that GUS can outperform the baseline heuristics in terms of the average percentage of satisfied users by a factor of at least 50%. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|