An Efficient Application Partitioning Algorithm in Mobile Environments
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
Cites
Statistics
Verification
Claims the paper makes
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?
In the citing paper
“Wu et al. propose a dynamic partitioning approach that optimizes the distribution of tasks between mobile devices and cloud or edge servers under variable network conditions and hardware capabilities [121].”
From Confidential Computing Across Edge‐To‐Cloud for Machine Learning: A Survey Study (2025) · cites this paper as [121]
Citations
Cites
Fast approximate energy minimization via graph cuts
Boykov, Y., Veksler, O., & Zabih, R. (2001) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.969114 · Cited by 6,988
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
Mobile Edge Computing: A Survey on Architecture and Computation Offloading
Mach, P., & Becvar, Z. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2682318 · Cited by 3,258
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 11×
“Partitioning technologies were adopted to identify offloaded parts for energy saving [3], [20], [21].”
BackgroundMethodInfluential(2011) · doi:10.1145/1966445.1966473 · Cited by 1,870
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
A Branch and Bound Algorithm for Feature Subset Selection
Narendra, & Fukunaga (1977) · IEEE Transactions on Computers · doi:10.1109/tc.1977.1674939 · Cited by 1,245
ThinkAir: Dynamic resource allocation and parallel execution in the cloud for mobile code offloading
Kosta, S., Aucinas, A., Hui, P., Mortier, R., & Zhang, X. (2012) · 2012 Proceedings IEEE INFOCOM · doi:10.1109/infcom.2012.6195845 · Cited by 1,186
Zhang, L., Tiwana, B., Qian, Z., Wang, Z., Dick, R. P., Mao, Z. M., & Yang, L. (2010) · Proceedings of the eighth IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis · doi:10.1145/1878961.1878982 · Cited by 1,122
Decentralized Computation Offloading Game for Mobile Cloud Computing
Chen, X. (2015) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2014.2316834 · Cited by 872
Research works printed but not linked: 1
- yang, 2012, PowerTutor: A power monitor for android-based mobile platforms, EECS University of Michigan
Cited by
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
Fast Adaptive Task Offloading in Edge Computing Based on Meta Reinforcement Learning
Wang, J., Hu, J., Min, G., Zomaya, A. Y., & Georgalas, N. (2021) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2020.3014896 · Cited by 414
Joint Task Offloading and Resource Allocation for Energy-Constrained Mobile Edge Computing
Jiang, H., Dai, X., Xiao, Z., & Iyengar, A. (2023) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2022.3150432 · Cited by 411
Goudarzi, M., Wu, H., Palaniswami, M., & Buyya, R. (2021) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2020.2967041 · Cited by 351
Self-citationDMRO: A Deep Meta Reinforcement Learning-Based Task Offloading Framework for Edge-Cloud Computing
Qu, G., Wu, H., Li, R., & Jiao, P. (2021) · IEEE Transactions on Network and Service Management · doi:10.1109/tnsm.2021.3087258 · Cited by 300
Self-citation
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
- Licence
- 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.