Learning Driven Computation Offloading for Asymmetrically Informed Edge Computing
The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Abstract
Edge computing emerges as a promising paradigm to decentralize computation power to the edge of the network and thus improve user experience by task offloading. A user can perfectly schedule his tasks to be executed on edge servers if the execution time of all tasks can be known beforehand. However, it is difficult to know the task execution time (TET) before performing actual offloading, which normally varies on edge servers with different software and hardware configurations. Moreover, such configuration information is not always available to end users due to security concerns. In this paper, we first propose a learning-driven algorithm to accurately predict TETs of all tasks in such an asymmetrically informed edge computing environment. The basic idea is to predict unknown TETs using only a small sampled set of TETs by exploiting the underlying correlation between TETs and edge server configurations. Next, we formulate the problem of task offloading into a constrained optimization problem, which is unfortunately proved to be NP-hard. To address the above challenge, we design a task offloading algorithm, called Maximum Efficiency First Ordered (MEFO), to achieve near-optimal efficiency. Field measurements and experiments have been conducted to demonstrate that our proposed learning-driven algorithm can predict TETs more accurately than other algorithms as long as the fraction of sampled TETs is larger than a small predefined threshold, and our proposed MEFO algorithm achieves a much higher success rate of task offloading and a shorter processing delay with very limited information of edge servers.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Efficient multi-user computation offloading for mobile-edge cloud computing
Chen, X., Jiao, L., Li, W., & Fu, X. (2016) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2015.2487344 · Cited by 2,675
Self-citationMAUI: making smartphones last longer with code offload
Cuervo, E., Balasubramanian, A., Cho, D.-K., Wolman, A., Saroiu, S., Chandra, R., & Bahl, P. (2010) · Proceedings of the 8th international conference on Mobile systems, applications, and services · doi:10.1145/1814433.1814441 · Cited by 2,281 · cited 1×
“From the perspective of a task initiator, in case that there are multiple tasks to be offloaded, one major goal is to maximize the amount of completed tasks before the predefined deadline [1], [2], [3].”
BackgroundDynamic computation offloading for mobile-edge computing with energy harvesting devices
Mao, Y., Zhang, J., & Letaief, K. B. (2016) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2016.2611964 · Cited by 1,705 · cited 1×
“[35] investigate a green edge computing system with energy harvesting devices and develop a Lyapunov optimization based dynamic computation offloading strategy.”
Cloud computing for mobile users: can offloading computation save energy?
Kumar, K., & Lu, Y.-H. (2010) · Computer · doi:10.1109/mc.2010.98 · Cited by 1,493
Mobile-edge computing architecture: the role of mec in the internet of things
Sabella, D., Vaillant, A., Kuure, P., Rauschenbach, U., & Giust, F. (2016) · IEEE Consumer Electronics Magazine · doi:10.1109/mce.2016.2590118 · Cited by 413
Optimal Schedule of Mobile Edge Computing for Internet of Things Using Partial Information
Lyu, X., Ni, W., Tian, H., Liu, R. P., Wang, X., Giannakis, G. B., & Paulraj, A. (2017) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2017.2760186 · Cited by 251 · cited 1×
“[34] designed a perturbed Lyapunov function to stochastically maximize a network utility balancing throughput and fairness, which is also able to dramatically reduce feedbacks at no cost of optimality.”
Method
Cited by
Xu, W., Yang, Z., Ng, D. W. K., Levorato, M., Eldar, Y. C., & Debbah, M. (2023) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2023.3239189 · Cited by 660
Resource Scheduling in Edge Computing: A Survey
Luo, Q., Hu, S., Li, C., Li, G., & Shi, W. (2021) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2021.3106401 · Cited by 588
“nodes [102]–[106], which refers to the determination of the offloading of a specific task to a destination node, among various tasks and destination nodes.”
BackgroundAccelerating Federated Learning via Momentum Gradient Descent
Liu, W., Chen, L., Chen, Y., & Zhang, W. (2020) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2020.2975189 · Cited by 374
“Using machine learning for the prediction of uploaded task execution time achieves a shorter processing delay [10], and dynamic resource scheduling was studied to optimize resources allocation of MEC system in [11].”
MethodBi, S., Huang, L., & Zhang, Y.-J. A. (2020) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2020.2988386 · Cited by 340
Yuan, L., He, Q., Tan, S., Li, B., Yu, J., Chen, F., & Yang, Y. (2023) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2022.3231296 · Cited by 33
Metadata
- Authors
- Hu, M., Zhuang, L., Wu, D., Zhou, Y., Chen, X., & Xiao, L.
- Venue
- IEEE Transactions on Parallel and Distributed Systems
- Published
- 2019-08-01
- Volume
- 30
- Issue
- 8
- Pages
- 1802-1815
- ISSN
- 1045-9219 (ISSN-L)
- 1558-2183
- 2161-9883
- OpenAlex
- W2910439483
- Cited by
- 70
- References
- 6
- FWCI
- 6.75
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Learning Driven Computation Offloading for Asymmetrically Informed Edge Computing. https://app.cochat.ai/papers/10.1109/tpds.2019.2893925
- The paper
- Hu, M., Zhuang, L., Wu, D., Zhou, Y., Chen, X., & Xiao, L. (2019). Learning Driven Computation Offloading for Asymmetrically Informed Edge Computing. IEEE Transactions on Parallel and Distributed Systems. https://doi.org/10.1109/tpds.2019.2893925
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.