Hermes: Latency Optimal Task Assignment for Resource-constrained Mobile Computing

With mobile devices increasingly able to connect to cloud servers from anywhere, resource-constrained devices can potentially perform offloading of computational tasks to either save local 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. We formulate an NP-hard problem to minimize the application latency while meeting prescribed resource utilization constraints. Different from most of existing works that either rely on the integer programming solver, or on heuristics that offer no theoretical performance guarantees, we propose Hermes, a novel fully polynomial time approximation scheme (FPTAS). We identify for a subset of problem instances, where the application task graphs can be described as serial trees, Hermes provides a solution with latency no more than <inline-formula><tex-math notation="LaTeX">$(1+\epsilon)$ </tex-math><alternatives><inline-graphic xlink:href="kao-ieq1-2679712.gif"/></alternatives></inline-formula> times of the minimum while incurring complexity that is polynomial in problem size and <inline-formula> <tex-math notation="LaTeX">$\frac{1}{\epsilon}$</tex-math><alternatives> <inline-graphic xlink:href="kao-ieq2-2679712.gif"/></alternatives></inline-formula>. We further propose an online algorithm to learn the unknown dynamic environment and guarantee that the performance gap compared to the optimal strategy is bounded by a logarithmic function with time. Evaluation is done by using real data set collected from several benchmarks, and is shown that Hermes improves the latency by <inline-formula><tex-math notation="LaTeX">$16$ </tex-math><alternatives><inline-graphic xlink:href="kao-ieq3-2679712.gif"/></alternatives></inline-formula> percent compared to a previously published heuristic and increases CPU computing time by only <inline-formula> <tex-math notation="LaTeX">$0.4$</tex-math><alternatives><inline-graphic xlink:href="kao-ieq4-2679712.gif"/> </alternatives></inline-formula> percent of overall latency.

[1]  Bhaskar Krishnamachari,et al.  Optimizing mobile computational offloading with delay constraints , 2014, 2014 IEEE Global Communications Conference.

[2]  Lu Luo,et al.  Predicting task execution time on handheld devices using the keystroke-level model , 2005, CHI Extended Abstracts.

[3]  Mathias Kölsch,et al.  Vision based hand gesture interfaces for wearable computing and virtual environments , 2004 .

[4]  Byung-Gon Chun,et al.  CloneCloud: elastic execution between mobile device and cloud , 2011, EuroSys '11.

[5]  Bhaskar Krishnamachari,et al.  Hermes: Latency optimal task assignment for resource-constrained mobile computing , 2015, 2015 IEEE Conference on Computer Communications (INFOCOM).

[6]  Khaled A. Harras,et al.  Femto Clouds: Leveraging Mobile Devices to Provide Cloud Service at the Edge , 2015, 2015 IEEE 8th International Conference on Cloud Computing.

[7]  Emiliano Miluzzo,et al.  EyePhone: activating mobile phones with your eyes , 2010, MobiHeld '10.

[8]  Ellen W. Zegura,et al.  Serendipity: enabling remote computing among intermittently connected mobile devices , 2012, MobiHoc '12.

[9]  Dorit S. Hochbaum,et al.  A Polynomial Algorithm for the k-cut Problem for Fixed k , 1994, Math. Oper. Res..

[10]  Cheng Wang,et al.  Parametric analysis for adaptive computation offloading , 2004, PLDI '04.

[11]  Bharat K. Bhargava,et al.  A Survey of Computation Offloading for Mobile Systems , 2012, Mobile Networks and Applications.

[12]  Ted K. Ralphs,et al.  Integer and Combinatorial Optimization , 2013 .

[13]  Alec Wolman,et al.  MAUI: making smartphones last longer with code offload , 2010, MobiSys '10.

[14]  Hamidreza Bagheri,et al.  Mobile clouds: Comparative study of architectures and formation mechanisms , 2012, 2012 IEEE 8th International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob).

[15]  Wenzhong Li,et al.  Mechanisms and challenges on mobility-augmented service provisioning for mobile cloud computing , 2015, IEEE Communications Magazine.

[16]  Giorgio Gambosi,et al.  Complexity and approximation: combinatorial optimization problems and their approximability properties , 1999 .

[17]  Pan Hui,et al.  ThinkAir: Dynamic resource allocation and parallel execution in the cloud for mobile code offloading , 2012, 2012 Proceedings IEEE INFOCOM.

[18]  Karim Habak,et al.  COSMOS: computation offloading as a service for mobile devices , 2014, MobiHoc '14.

[19]  Ramesh Govindan,et al.  Odessa: enabling interactive perception applications on mobile devices , 2011, MobiSys '11.

[20]  Feng Qian,et al.  A close examination of performance and power characteristics of 4G LTE networks , 2012, MobiSys '12.

[21]  Sébastien Bubeck,et al.  Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems , 2012, Found. Trends Mach. Learn..

[22]  Yijie Han.  Tight bound for matching , 2012, J. Comb. Optim..

[23]  Ronald L. Graham,et al.  Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.

[24]  Athanasios V. Vasilakos,et al.  MAPCloud: Mobile Applications on an Elastic and Scalable 2-Tier Cloud Architecture , 2012, 2012 IEEE Fifth International Conference on Utility and Cloud Computing.

[25]  Manfred Kunde,et al.  Nonpreemptive LP-Scheduling on Homogeneous Multiprocessor Systems , 1981, SIAM J. Comput..

[26]  David S. Johnson,et al.  `` Strong '' NP-Completeness Results: Motivation, Examples, and Implications , 1978, JACM.

[27]  Sattar Vakili,et al.  Deterministic Sequencing of Exploration and Exploitation for Multi-Armed Bandit Problems , 2011, IEEE Journal of Selected Topics in Signal Processing.

[28]  Gerhard J. Woeginger,et al.  Polynomial time approximation algorithms for machine scheduling: ten open problems , 1999 .

[29]  Joseph Y.-T. Leung,et al.  Scheduling Chain-Structured Tasks to Minimize Makespan and Mean Flow Time , 1991, Inf. Comput..

[30]  Klaus Jansen,et al.  Approximation Algorithms for Scheduling Jobs with Chain Precedence Constraints , 2003, PPAM.

[31]  Sokol Kosta,et al.  To offload or not to offload? The bandwidth and energy costs of mobile cloud computing , 2013, 2013 Proceedings IEEE INFOCOM.

[32]  Vincenzo Grassi,et al.  A game-theoretic approach to computation offloading in mobile cloud computing , 2015, Mathematical Programming.

[33]  Srikanth V. Krishnamurthy,et al.  CWC: A Distributed Computing Infrastructure Using Smartphones , 2015, IEEE Transactions on Mobile Computing.

[34]  Harold N. Gabow,et al.  An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs , 1976, JACM.

[35]  Rajkumar Buyya,et al.  A Context Sensitive Offloading Scheme for Mobile Cloud Computing Service , 2015, 2015 IEEE 8th International Conference on Cloud Computing.