CoChat

An Efficient Application Partitioning Algorithm in Mobile Environments

Wu, Huaming, Knottenbelt, William J., Wolter, Katinka · 2019 · IEEE Transactions on Parallel and Distributed Systems

The DOI matches its Crossref record; 53 of the 53 references it cites were found in a registry or an index.

Abstract

Application partitioning that splits the executions into local and remote parts, plays a critical role in high-performance mobile offloading systems. Optimal partitioning will allow mobile devices to obtain the highest benefit from Mobile Cloud Computing (MCC) or Mobile Edge Computing (MEC). Due to unstable resources in the wireless network (network disconnection, bandwidth fluctuation, network latency, etc.) and at the service nodes (different speeds of mobile devices and cloud/edge servers, memory, etc.), static partitioning solutions with fixed bandwidth and speed assumptions are unsuitable for offloading systems. In this paper, we study how to dynamically partition a given application effectively into local and remote parts while reducing the total cost to the degree possible. For general tasks (represented in arbitrary topological consumption graphs), we propose a Min-Cost Offloading Partitioning (MCOP) algorithm that aims at finding the optimal partitioning plan (i.e., to determine which portions of the application must run on the mobile device and which portions on cloud/edge servers) under different cost models and mobile environments. Simulation results show that the MCOP algorithm provides a stable method with low time complexity which significantly reduces execution time and energy consumption by optimally distributing tasks between mobile devices and servers, besides it adapts well to mobile environmental changes.

Overview

Integrity signals

Registry

Crossref · 10.1109/tpds.2019.2891695

Cites

53 of 53 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

Show all 53 references

Research works printed but not linked: 1

  1. yang, 2012, PowerTutor: A power monitor for android-based mobile platforms, EECS University of Michigan

Cited by

See all 125

Metadata

Authors
Wu, H., Knottenbelt, W. J., & Wolter, K.
Affiliations
  • Tianjin University (CN)
  • Imperial College London (GB)
  • Freie Universität Berlin (DE)
Venue
IEEE Transactions on Parallel and Distributed Systems
Published
2019-07-01
Volume
30
Issue
7
Pages
1464-1480
ISSN
  • 1045-9219 (ISSN-L)
  • 1558-2183
  • 2161-9883
OpenAlex
W2909046140
Cited by
125
References
53
Citations by year
2025: 15 · 2024: 18 · 2023: 22 · 2022: 19 · 2021: 26 · 2020: 22 · 2019: 3
FWCI
9.58
Type
journal article
Language
en
Open access
closed
Locations
  • IEEE Transactions on Parallel and Distributed Systems (publishedVersion)
  • Spiral (Imperial College London) (submittedVersion)
Funders
  • National Natural Science Foundation of China (61801325)
  • Natural Science Foundation of Tianjin City (18JCQNJC00600)
  • Huawei Innovation Research Program (HIRPO2017050307)
Topics
  • Physical Sciences › Computer Science › Computer Networks and Communications › IoT and Edge/Fog Computing
  • Physical Sciences › Computer Science › Information Systems › Cloud Computing and Resource Management
  • Physical Sciences › Computer Science › Hardware and Architecture › Cloud Computing and Remote Desktop Technologies
Keywords
application partitioning, mobile offloading, mobile cloud computing, mobile edge computing, cost model, energy consumption, execution time reduction, task graphs

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: An Efficient Application Partitioning Algorithm in Mobile Environments. https://app.cochat.ai/papers/10.1109/tpds.2019.2891695
The paper
Wu, H., Knottenbelt, W. J., & Wolter, K. (2019). An Efficient Application Partitioning Algorithm in Mobile Environments. IEEE Transactions on Parallel and Distributed Systems. https://doi.org/10.1109/tpds.2019.2891695

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.