Hermes: Latency optimal task assignment for resource-constrained mobile computing
The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
With mobile devices increasingly able to connect to cloud servers from anywhere, resource-constrained devices can potentially perform offloading of computational tasks to either improve resource usage or improve performance. It is of interest to find optimal assignments of tasks to local and remote devices that can take into account the application-specific profile, availability of computational resources, and link connectivity, and find a balance between energy consumption costs of mobile devices and latency for delay-sensitive applications. Given an application described by a task dependency graph, we formulate an optimization problem to minimize the latency while meeting prescribed resource utilization constraints. Different from most of existing works that either rely on an integer linear programming formulation, which is NP-hard and not applicable to general task dependency graph for latency metrics, or on intuitively derived heuristics that offer no theoretical performance guarantees, we propose Hermes, a novel fully polynomial time problem approximation scheme (FPTAS) algorithm to solve this problem. Hermes pros vides a solution with latency no more than (1 + ε) times of the minimum while incurring complexity that is an polynomial in problem size and //ε We evaluate the performance by using real data set collected from several benchmarks, and show that Hermes improves the latency by 16% (36% for larger scale application) compared to a previously published heuristic and increases CPU computing time by only 0.4% of overall latency.
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
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 · cited 12×
“The authors of Odessa [11] present a heuristic approach to task partitioning for improving latency and throughput metrics, involving iterative improvement of bottlenecks in task execution and data transmission.”
BackgroundMethodInfluential(2011) · doi:10.1145/1966445.1966473 · Cited by 1,870
To offload or not to offload? The bandwidth and energy costs of mobile cloud computing
Barbera, M. V., Kosta, S., Mei, A., & Stefa, J. (2013) · 2013 Proceedings IEEE INFOCOM · doi:10.1109/infcom.2013.6566921 · Cited by 398
Cited by
A Survey on Mobile Edge Computing: The Communication Perspective
Mao, Y., You, C., Zhang, J., Huang, K., & Letaief, K. B. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2745201 · Cited by 5,607
Collaborative Cloud and Edge Computing for Latency Minimization
Ren, J., Yu, G., He, Y., & Li, G. Y. (2019) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2019.2904244 · Cited by 685
Latency Optimization for Resource Allocation in Mobile-Edge Computation Offloading
Ren, J., Yu, G., Cai, Y., & He, Y. (2018) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2018.2845360 · Cited by 450
Optimal Computational Power Allocation in Multi-Access Mobile Edge Computing for Blockchain
Wu, Y., Chen, X., Shi, J., Ni, K., Qian, L., Huang, L., & Zhang, K. (2018) · Sensors · doi:10.3390/s18103472 · Cited by 20
Metadata
- Authors
- Kao, Y.-H., Krishnamachari, B., Ra, M.-R., & Bai, F.
- Venue
- 2015 IEEE Conference on Computer Communications (INFOCOM)
- Publisher
- IEEE
- Published
- 2015-04
- Pages
- 1894-1902
- OpenAlex
- W1508380032
- Cited by
- 87
- References
- 3
- FWCI
- 10.49
- 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
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.