Application Partitioning for Offloading in Mobile Pervasive Environments

被引:0
作者
Jungum, Nevin Vunka [1 ]
Mohamudally, Nawaz [1 ]
Nissanke, Nimal [2 ]
机构
[1] Univ Technol Mauritius, Sch Innovat Technol & Engn, La Tour Koenig, Mauritius
[2] London South Bank Univ, Sch Comp Informat Syst & Math, London, England
来源
10TH INT CONF ON EMERGING UBIQUITOUS SYST AND PERVAS NETWORKS (EUSPN-2019) / THE 9TH INT CONF ON CURRENT AND FUTURE TRENDS OF INFORMAT AND COMMUN TECHNOLOGIES IN HEALTHCARE (ICTH-2019) / AFFILIATED WORKOPS | 2019年 / 160卷
关键词
application partitioning; graph minimum weight cut; code offloading; pervasive systems;
D O I
10.1016/j.procs.2019.09.472
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
In this work, we proposed an algorithm to partition an application for offloading into exactly two clusters. One for local execution on the resource constraint mobile device and other one for remote execution on another device such as smartphone, laptop, desktop and so on. The aim is to reduce energy usage on the source mobile device and improve response time. The evaluation results show an overall application performance improvement, in terms of response time and energy consumption, of the proposed algorithm compared to a no offloading and full offloading strategy. We note that high bandwidth and remote devices with higher computational speed benefits offloading while in low connectivity, a no offloading approach is better. (C) 2019 The Authors. Published by Elsevier B.V.
引用
收藏
页码:206 / 213
页数:8
相关论文
共 6 条
  • [1] [Anonymous], 2019, BIOGENESIS V0 9
  • [2] ej-technologies GmbH, 2019, JPROFILER VERS 11 0
  • [3] Graph partitioning models for parallel computing
    Hendrickson, B
    Kolda, TG
    [J]. PARALLEL COMPUTING, 2000, 26 (12) : 1519 - 1534
  • [4] CLOUD COMPUTING FOR MOBILE USERS: CAN OFFLOADING COMPUTATION SAVE ENERGY?
    Kumar, Karthik
    Lu, Yung-Hsiang
    [J]. COMPUTER, 2010, 43 (04) : 51 - 56
  • [5] Ou Shumao., 2006, PERVASIVE COMPUTING, P10
  • [6] A simple min-cut algorithm
    Stoer, M
    Wagner, F
    [J]. JOURNAL OF THE ACM, 1997, 44 (04) : 585 - 591