The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Offloading Dependent Tasks with Communication Delay and Deadline Constraint
Abstract
We study the scheduling decision for an application consisting of dependent tasks, in a generic cloud computing system comprising a network of heterogeneous local processors and a remote cloud server. We formulate an optimization problem to find the offloading decision that minimizes the overall application execution cost, subject to an application completion deadline. Since this problem is NP-hard, we propose a heuristic algorithm termed Individual Time Allocation with Greedy Scheduling (ITAGS) to obtain an efficient solution. ITAGS first uses a binary-relaxed version of the original problem to allocate a completion deadline to each individual task, and then greedily optimizes the scheduling of each task subject to its time allowance. Through trace-based simulation using real applications, as well as various randomly generated task trees, we study the performance of ITAGS, highlighting the effect of the application deadline, communication delay, number of processors, and number of tasks. We further demonstrate the substantial performance advantage of ITAGS over existing alternatives.
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
The case for vm-based cloudlets in mobile computing
Satyanarayanan, M., Bahl, P., Caceres, R., & Davies, N. (2009) · IEEE Pervasive Computing · doi:10.1109/mprv.2009.82 · Cited by 3,660
MAUI: 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
Resource efficient mobile computing using cloudlet infrastructure
Jararweh, Y., Tawalbeh, L., Ababneh, F., & Dosari, F. (2013) · 2013 IEEE 9th International Conference on Mobile Ad-hoc and Sensor Networks · doi:10.1109/msn.2013.75 · Cited by 132
Cited by
Efficient Computing Resource Sharing for Mobile Edge-Cloud Computing Networks
Zhang, Y., Lan, X., Ren, J., & Cai, L. (2020) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2020.2979807 · Cited by 261
On-edge multi-task transfer learning: model and practice with data-driven task allocation
Chen, Q., Zheng, Z., Hu, C., Wang, D., & Liu, F. (2020) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2019.2962435 · Cited by 88
Metadata
- Authors
- Sundar, S., & Liang, B.
- Venue
- IEEE INFOCOM 2018 - IEEE Conference on Computer Communications
- Publisher
- IEEE
- Published
- 2018-04
- Pages
- 37-45
- OpenAlex
- W2791353064
- Cited by
- 166
- References
- 3
- FWCI
- 12.96
- Type
- conference paper
- 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: Offloading Dependent Tasks with Communication Delay and Deadline Constraint. https://app.cochat.ai/papers/10.1109/infocom.2018.8486305
- The paper
- Sundar, S., & Liang, B. (2018). Offloading Dependent Tasks with Communication Delay and Deadline Constraint. IEEE INFOCOM 2018 - IEEE Conference on Computer Communications. https://doi.org/10.1109/infocom.2018.8486305
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.