Imperial College London
Alternate

ProfessorWilliamKnottenbelt

Faculty of Engineering, Department of Computing

Professor of Applied Quantitative Analysis
 
 
 
//

Contact

 

+44 (0)20 7594 8331w.knottenbelt Website

 
 
//

Location

 

E363ACE ExtensionSouth Kensington Campus

//

Summary

 

Publications

Citation

BibTex format

@article{Wu:2019:10.1109/TPDS.2019.2891695,
author = {Wu, H and Knottenbelt, W and Wolter, K},
doi = {10.1109/TPDS.2019.2891695},
journal = {IEEE Transactions on Parallel and Distributed Systems},
pages = {1464--1480},
title = {An efficient application partitioning algorithm in mobile environments},
url = {http://dx.doi.org/10.1109/TPDS.2019.2891695},
volume = {30},
year = {2019}
}
Download

RIS format (EndNote, RefMan)

TY  - JOUR
AB  - Application partitioning that splits the executions into local and remote parts, plays a critical role in high-performance mobile offloading systems. Mobile devices can obtain the most benefit from Mobile Cloud Computing (MCC) or Mobile Edge Computing (MEC) through optimal partitioning. Due to unstable resources at 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 into local and remote parts effectively, while keeping the total cost as small as possible. For general tasks (i.e., arbitrary topological consumption graphs), we propose a Min-Cost Offloading Partitioning (MCOP) algorithm that aims at finding the optimal partitioning plan (determine which portions of the application to run on mobile devices 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 well adapts to mobile environmental changes.
AU  - Wu,H
AU  - Knottenbelt,W
AU  - Wolter,K
DO  - 10.1109/TPDS.2019.2891695
EP  - 1480
PY  - 2019///
SN  - 1045-9219
SP  - 1464
TI  - An efficient application partitioning algorithm in mobile environments
T2  - IEEE Transactions on Parallel and Distributed Systems
UR  - http://dx.doi.org/10.1109/TPDS.2019.2891695
UR  - http://hdl.handle.net/10044/1/66339
VL  - 30
ER  -
Download