On Exploiting Dynamic Execution Patterns for Workload Offloading in Mobile Cloud Applications Wei Gao, Yong Li, and Haoyang Lu The University of Tennessee,

Slides:



Advertisements
Similar presentations
Supporting Cooperative Caching in Disruption Tolerant Networks
Advertisements

Energy-efficient Task Scheduling in Heterogeneous Environment 2013/10/25.
Hadi Goudarzi and Massoud Pedram
CLOUD COMPUTING FOR MOBILE USERS: CAN OFFLOADING COMPUTATION SAVE ENERGY? Purdue University.
A system Performance Model Instructor: Dr. Yanqing Zhang Presented by: Rajapaksage Jayampthi S.
CS 795 – Spring  “Software Systems are increasingly Situated in dynamic, mission critical settings ◦ Operational profile is dynamic, and depends.
Green Cloud Computing Hadi Salimi Distributed Systems Lab, School of Computer Engineering, Iran University of Science and Technology,
Wenye Wang Xinbing Wang Arne Nilsson Department of Electrical and Computer Engineering, NC State University March 2005 A New Admission Control Scheme under.
Page 1 Hidden Markov Models for Automatic Speech Recognition Dr. Mike Johnson Marquette University, EECE Dept.
Forwarding Redundancy in Opportunistic Mobile Networks: Investigation and Elimination Wei Gao 1, Qinghua Li 2 and Guohong Cao 3 1 The University of Tennessee,
Autonomous Agents-based Mobile-Cloud Computing. Mobile-Cloud Computing (MCC) MCC refers to an infrastructure where the data storage and data processing.
HMM-BASED PATTERN DETECTION. Outline  Markov Process  Hidden Markov Models Elements Basic Problems Evaluation Optimization Training Implementation 2-D.
System design-related Optimization problems Michela Milano Joint work DEIS Università di Bologna Dip. Ingegneria Università di Ferrara STI Università di.
COMS E Cloud Computing and Data Center Networking Sambit Sahu
Maximum Network lifetime in Wireless Sensor Networks with Adjustable Sensing Ranges Mihaela Cardei, Jie Wu, Mingming Lu, and Mohammad O. Pervaiz Department.
Distributed Structural Health Monitoring A Cyber-Physical System Approach Chenyang Lu Department of Computer Science and Engineering.
Kick-off meeting 3 October 2012 Patras. Research Team B Communication Networks Laboratory (CNL), Computer Engineering & Informatics Department (CEID),
ThinkAir: Dynamic Resource Allocation and Parallel Execution in Cloud for Mobile Code Offloading Sokol Kosta, Pan Hui Deutsche Telekom Labs, Berlin, Germany.
Ekrem Kocaguneli 11/29/2010. Introduction CLISSPE and its background Application to be Modeled Steps of the Model Assessment of Performance Interpretation.
MOBILE CLOUD COMPUTING
Computation Offloading
Resource Allocation for E-healthcare Applications
VOLTAGE SCHEDULING HEURISTIC for REAL-TIME TASK GRAPHS D. Roychowdhury, I. Koren, C. M. Krishna University of Massachusetts, Amherst Y.-H. Lee Arizona.
Network Aware Resource Allocation in Distributed Clouds.
Wei Gao1 and Qinghua Li2 1The University of Tennessee, Knoxville
Profile Driven Component Placement for Cluster-based Online Services Christopher Stewart (University of Rochester) Kai Shen (University of Rochester) Sandhya.
SoftCOM 2005: 13 th International Conference on Software, Telecommunications and Computer Networks September 15-17, 2005, Marina Frapa - Split, Croatia.
Wireless Networks Breakout Session Summary September 21, 2012.
Clone-Cloud. Motivation With the increasing use of mobile devices, mobile applications with richer functionalities are becoming ubiquitous But mobile.
© 2009 IBM Corporation 1 Improving Consolidation of Virtual Machines with Risk-aware Bandwidth Oversubscription in Compute Clouds Amir Epstein Joint work.
20 October 2006Workflow Optimization in Distributed Environments Dynamic Workflow Management Using Performance Data David W. Walker, Yan Huang, Omer F.
Prediction Assisted Single-copy Routing in Underwater Delay Tolerant Networks Zheng Guo, Bing Wang and Jun-Hong Cui Computer Science & Engineering Department,
Maximum Network Lifetime in Wireless Sensor Networks with Adjustable Sensing Ranges Cardei, M.; Jie Wu; Mingming Lu; Pervaiz, M.O.; Wireless And Mobile.
1 Distributed Energy-Efficient Scheduling for Data-Intensive Applications with Deadline Constraints on Data Grids Cong Liu and Xiao Qin Auburn University.
Stochastic DAG Scheduling using Monte Carlo Approach Heterogeneous Computing Workshop (at IPDPS) 2012 Extended version: Elsevier JPDC (accepted July 2013,
On Distinguishing the Multiple Radio Paths in RSS-based Ranging Dian Zhang, Yunhuai Liu, Xiaonan Guo, Min Gao and Lionel M. Ni College of Software, Shenzhen.
Distributed Maintenance of Cache Freshness in Opportunistic Mobile Networks Wei Gao and Guohong Cao Dept. of Computer Science and Engineering Pennsylvania.
Job scheduling algorithm based on Berger model in cloud environment Advances in Engineering Software (2011) Baomin Xu,Chunyan Zhao,Enzhao Hua,Bin Hu 2013/1/251.
Resource Mapping and Scheduling for Heterogeneous Network Processor Systems Liang Yang, Tushar Gohad, Pavel Ghosh, Devesh Sinha, Arunabha Sen and Andrea.
User-Centric Data Dissemination in Disruption Tolerant Networks Wei Gao and Guohong Cao Dept. of Computer Science and Engineering Pennsylvania State University.
ECE 8443 – Pattern Recognition ECE 8423 – Adaptive Signal Processing Objectives: ML and Simple Regression Bias of the ML Estimate Variance of the ML Estimate.
VGreen: A System for Energy Efficient Manager in Virtualized Environments G. Dhiman, G Marchetti, T Rosing ISLPED 2009.
Dual-Region Location Management for Mobile Ad Hoc Networks Yinan Li, Ing-ray Chen, Ding-chau Wang Presented by Youyou Cao.
Dr. Sudharman K. Jayaweera and Amila Kariyapperuma ECE Department University of New Mexico Ankur Sharma Department of ECE Indian Institute of Technology,
CUHK Learning-Based Power Management for Multi-Core Processors YE Rong Nov 15, 2011.
Modeling Mobile-Agent-based Collaborative Processing in Sensor Networks Using Generalized Stochastic Petri Nets Hongtao Du, Hairong Qi, Gregory Peterson.
1 Iterative Integer Programming Formulation for Robust Resource Allocation in Dynamic Real-Time Systems Sethavidh Gertphol and Viktor K. Prasanna University.
Eduardo Cuervo – Duke University Aruna Balasubramanian - University of Massachusetts Amherst Dae-ki Cho - UCLA Alec Wolman, Stefan Saroiu, Ranveer Chandra,
Static Process Scheduling
Efficient Resource Allocation for Wireless Multicast De-Nian Yang, Member, IEEE Ming-Syan Chen, Fellow, IEEE IEEE Transactions on Mobile Computing, April.
Service Reliability Engineering The Chinese University of Hong Kong
A stochastic scheduling algorithm for precedence constrained tasks on Grid Future Generation Computer Systems (2011) Xiaoyong Tang, Kenli Li, Guiping Liao,
Accurate WiFi Packet Delivery Rate Estimation and Applications Owais Khan and Lili Qiu. The University of Texas at Austin 1 Infocom 2016, San Francisco.
Efficient Opportunistic Sensing using Mobile Collaborative Platform MOSDEN.
Nguyen Thi Thanh Nha HMCL by Ying Zhang, Gang Huang, Xuanzhe Liu, Wei Zhang, Hong Mei, and Shunxiang Yang Refactoring Android Java Code for On-Demand Computation.
A method for using cloud computing for Android By: Collin Molnar.
Application-Aware Traffic Scheduling for Workload Offloading in Mobile Clouds Liang Tong, Wei Gao University of Tennessee – Knoxville IEEE INFOCOM
Introduction to Mobile-Cloud Computing. What is Mobile Cloud Computing? an infrastructure where both the data storage and processing happen outside of.
Dynamic Mobile Cloud Computing: Ad Hoc and Opportunistic Job Sharing.
A Hierarchical Edge Cloud Architecture for Mobile Computing IEEE INFOCOM 2016 Liang Tong, Yong Li and Wei Gao University of Tennessee – Knoxville 1.
Auburn University
Auburn University COMP7330/7336 Advanced Parallel and Distributed Computing Mapping Techniques Dr. Xiao Qin Auburn University.
Collaborative Offloading for Distributed Mobile-Cloud Apps
First Hop Offloading of Mobile DAG Computations
Kyoungwoo Lee, Minyoung Kim, Nikil Dutt, and Nalini Venkatasubramanian
Adaptive Offloading for Pervasive Computing
A Better Approximation for Minimum Total Routing Path Clustering Problem in 2-D Underwater Sensor Networks Wei Wang, Donghyun Kim, and Weili Wu, A Better.
Progress Report 2012/11/28.
Distributed Edge Computing
Presentation transcript:

On Exploiting Dynamic Execution Patterns for Workload Offloading in Mobile Cloud Applications Wei Gao, Yong Li, and Haoyang Lu The University of Tennessee, Knoxville Ting Wang IBM T. J. Watson Research Center Cong Liu University of Texas at Dallas Wei Gao, Yong Li, and Haoyang Lu The University of Tennessee, Knoxville Ting Wang IBM T. J. Watson Research Center Cong Liu University of Texas at Dallas

Cloud Computing for Mobile Devices  Contradiction between limited battery and complex mobile applications  Mobile Cloud Computing (MCC)  Offloading local computations to remote execution  Virtual Machine (VM) synthesis and migration 2/24

Cloud Computing for Mobile Devices  Wireless communication is expensive!  Partitioning workloads at the method level 3/24 3G/4G, WiFi A B B Local execution > wireless data transmission Application process

Existing Work  Assuming stationary and fixed program execution paths  Fixed partitioning decisions based on  Online/offline profiling data  Empirical heuristics  Deterministic optimization problems 4/24

Should the Partitioning Be Fixed?  Dynamics of execution patterns at run-time  Different input datasets, user operations, and system contexts  We explore such run-time dynamics via real-world experiments  Run-time execution patterns of mobile applications Open-source Android apps: Firefox, Chess game, Barcode scanner  Multiple application runs with different data and user inputs Online profiling every time 5/24

Run-time Dynamics of Execution Patterns  Dynamics of application execution paths  Method execution times and energy consumption 6/24 More than 40% difference Execution times of a method could vary up to 50% Energy consumption of a method is application- specific

Insights  Ignorance of run-time execution dynamics  Inaccurate estimation of application execution cost  Inappropriate partitioning decisions  Incorporation of run-time execution dynamics  Formulating method transitions as a continuous-time stochastic process  An ordinary Markov model is insufficient Complicated invocation interdependency Heterogeneous system and network conditions 7/24

Our Solution  A stochastic workload offloading framework  Formulating method transitions as an order-k semi-Markov model Semi-Markov: arbitrary sojourn times between method transitions – Heterogeneous method execution times Order-k: precise prediction of method invocation – k-step interdependency  Incorporation of system dynamics  Method execution times  Energy consumption of computation and data transmission 8/24 Method execution times

System Model  Decisions among remoteable app methods  Non-remoteable: User display, sensor access, etc  Programmer’s annotations  Transmission of program states  Only when the working location is changed  Assumption  Independence among multiple mobile apps 9/24

Semi-Markov-Based Formulation  A Markov renewal process {(M n, T n ), n=1,…N}  M n : the n-th app method being executed  T n : the time when M n is invoked T n+1 -T n : the execution time of M n  Invocation interdependency  Invocation of is M n determined by its previous k methods  Composite state  Extended state transition probability matrix T= { p ij }  Sojourn time distribution: the holding time of a state 10/24

Workload Offloading Decisions  Criteria: whether M n ’s remote execution could save local energy  What methods are executed before and after M n  Affecting M n ’s execution time and energy consumption  Approach: Local Invocation Graph (LIG) of M n  Not predicting too far into the future  Aim to avoid the “ping-pong” phenomenon 11/24

Workload Offloading Decisions  G Mn : amount of energy saved by M n ’s remote execution  E Mn (t): energy consumed by M n ’s local execution  C Mn (t): energy consumed by transmitting M n ’s program states 12/24 Prob to invoke m j M n ’s execution time If j is executed locally Prob for m j to be Executed locally

Exploiting Execution Dynamics  G Mn highly depends on the characteristics of E Mn (t) and C Mn (t)  Sojourn time distributions indicating method execution times  Characteristics of energy consumption  Exploiting execution dynamics  Run-time parameter estimation with profiled information  Quantified operations of workload offloading 13/24

Sojourn Time Distribution  Formulated as a Gaussian mixture  Parameter re-estimation  EM algorithm over the profiled information about past method executions  Maximum A Posteriori (MAP) method for the limited training data 14/24 Local executionRemote execution

Addressing the Energy Consumption  Energy consumed by method execution depends on method execution time  Formulate the relationship as a m-order polynomial  Coefficients a i j : real-time linear regression analysis  E j (t): chi-square distribution with m degrees of freedom t: normally distributed random variable as the method execution time 15/24

Quantified Operations of Offloading  Formulations of these system dynamics allow further quantification of offloading decisions: 16/24

Performance Evaluations  Comparisons  MAUI: offloading by solving integer optimizations  AlfredO: offloading by finding the optimal graph cut  FuzzyLogic: offloading with a fuzzy logic engine  Evaluation metrics:  Method execution time  Amount of energy saved  Computational overhead Energy consumed by making decisions of workload offloading 17/24

Evaluation Setup  Evaluation against open-source Android mobile apps  Firefox, Chess game, Barcode scanner  Implementing the offloading framework into app codes  Offloading operations  Adopt the approach of CloneCloud  A clone VM is maintained at the cloud server for each app A Dalvik VM instance compiled for the x86 architecture  Experiments  10-min app session with different human inputs and operations 18/24

Offloading Effectiveness 19/24  An order-3 semi-Markov model is used 25% shorter execution time 40% more energy savedLess than 5% overhead

Impact of System Workload 20/24  System workload is simulated by articulated dumb computations  Better performance with higher system workload Slower increase of execution time 30% of energy saving Similar overhead

Parameter Estimation of Sojourn Time Distribution 21/24  MAP performs better only when the system workload is high  Higher overhead is incurred

The Order of Semi-Markov Model 22/24  Using higher value of k  Smaller performance improvement when k increases  Significant overhead increase Carefully choose k according to the application scenario!

Summary  Mobile cloud computing (MCC) is critical to  Augment mobile devices’ local capabilities  Energy saving  MCC efficiency is determined by application partitioning  Our insight: exploiting the dynamic execution patterns of mobile apps is the key  A stochastic offloading framework based on order-k semi- Markov model  Exploiting the system dynamics of application executions 23/24

Thank you!  Questions?  The paper and slides are also available at: 24/24