CoChat

Learning Driven Computation Offloading for Asymmetrically Informed Edge Computing

Hu, Miao, Zhuang, Lei, Wu, Di, Zhou, Yipeng, Chen, Xu, Xiao, Liang · 2019 · IEEE Transactions on Parallel and Distributed Systems
Cited by 70

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tpds.2019.2893925

Cites

6 of 6 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 6 references

Cited by

See all 70

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.