Adaptive Offloading for Pervasive Computing

Slides:



Advertisements
Similar presentations
Agents & Mobile Agents.
Advertisements

Resource Management §A resource can be a logical, such as a shared file, or physical, such as a CPU (a node of the distributed system). One of the functions.
1 Advancing Supercomputer Performance Through Interconnection Topology Synthesis Yi Zhu, Michael Taylor, Scott B. Baden and Chung-Kuan Cheng Department.
Ad-Hoc Networking Course Instructor: Carlos Pomalaza-Ráez D. D. Perkins, H. D. Hughes, and C. B. Owen: ”Factors Affecting the Performance of Ad Hoc Networks”,
Dept. of Computer Science & Engineering, CUHK1 Trust- and Clustering-Based Authentication Services in Mobile Ad Hoc Networks Edith Ngai and Michael R.
Quality of Service in IN-home digital networks Alina Albu 23 October 2003.
ICNP'061 Benefit-based Data Caching in Ad Hoc Networks Bin Tang, Himanshu Gupta and Samir Das Department of Computer Science Stony Brook University.
1 Introduction to Load Balancing: l Definition of Distributed systems. Collection of independent loosely coupled computing resources. l Load Balancing.
On Exploiting Dynamic Execution Patterns for Workload Offloading in Mobile Cloud Applications Wei Gao, Yong Li, and Haoyang Lu The University of Tennessee,
Community Manager A Dynamic Collaboration Solution on Heterogeneous Environment Hyeonsook Kim  2006 CUS. All rights reserved.
Copyright Arshi Khan1 System Programming Instructor Arshi Khan.
COGNITIVE RADIO FOR NEXT-GENERATION WIRELESS NETWORKS: AN APPROACH TO OPPORTUNISTIC CHANNEL SELECTION IN IEEE BASED WIRELESS MESH Dusit Niyato,
Chapter 3 Memory Management: Virtual Memory
Load Balancing in Distributed Computing Systems Using Fuzzy Expert Systems Author Dept. Comput. Eng., Alexandria Inst. of Technol. Content Type Conferences.
Network Aware Resource Allocation in Distributed Clouds.
Placement of WiFi Access Points for Efficient WiFi Offloading in an Overlay Network Adviser : Frank, Yeong-Sung Lin Presented by Shin-Yao Chen.
College of Engineering WiFi and WCDMA Network Design Robert Akl, D.Sc. Department of Computer Science and Engineering Robert Akl, D.Sc. Department of Computer.
1 Distributed Process Scheduling: A System Performance Model Vijay Jain CSc 8320, Spring 2007.
De-Nian Young Ming-Syan Chen IEEE Transactions on Mobile Computing Slide content thanks in part to Yu-Hsun Chen, University of Taiwan.
1 Mobile-Assisted Localization in Wireless Sensor Networks Nissanka B.Priyantha, Hari Balakrishnan, Eric D. Demaine, Seth Teller IEEE INFOCOM 2005 March.
Autonomic scheduling of tasks from data parallel patterns to CPU/GPU core mixes Published in: High Performance Computing and Simulation (HPCS), 2013 International.
Cerberus: A Context-Aware Security Scheme for Smart Spaces presented by L.X.Hung u-Security Research Group The First IEEE International Conference.
1 Service Charge and Energy- Aware Vertical Handoff in Integrated IEEE e/ Networks Youngkyu Choi and Sunghyun Choi School of Electrical Engineering.
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.
Incremental Run-time Application Mapping for Heterogeneous Network on Chip 2012 IEEE 14th International Conference on High Performance Computing and Communications.
Metrics for Performance Evaluation of Distributed Application Execution in Ubiquitous Computing Environments Prithwish Basu ECE Department, Boston University.
Chance Constrained Robust Energy Efficiency in Cognitive Radio Networks with Channel Uncertainty Yongjun Xu and Xiaohui Zhao College of Communication Engineering,
Jamie Unger-Fink John David Eriksen.  Allocation and Scheduling Problem  Better MPSoC optimization tool needed  IP and CP alone not good enough  Communication.
SERENA: SchEduling RoutEr Nodes Activity in wireless ad hoc and sensor networks Pascale Minet and Saoucene Mahfoudh INRIA, Rocquencourt Le Chesnay.
KAIS T Location-Aided Flooding: An Energy-Efficient Data Dissemination Protocol for Wireless Sensor Networks Harshavardhan Sabbineni and Krishnendu Chakrabarty.
Nguyen Thi Thanh Nha HMCL by Roelof Kemp, Nicholas Palmer, Thilo Kielmann, and Henri Bal MOBICASE 2010, LNICST 2012 Cuckoo: A Computation Offloading Framework.
Application-Aware Traffic Scheduling for Workload Offloading in Mobile Clouds Liang Tong, Wei Gao University of Tennessee – Knoxville IEEE INFOCOM
Ashish Rauniyar, Soo Young Shin IT Convergence Engineering
-1/16- Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks C.-K. Toh, Georgia Institute of Technology IEEE.
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.
Towards a High Performance Extensible Grid Architecture Klaus Krauter Muthucumaru Maheswaran {krauter,
Personal Home Healthcare System for the Cardiac Patient of Smart City Using Fuzzy Logic Shijia Liu.
Seminar Announcement December 24, Saturday, 15:00-17:00, Room: A302, WNLO Title: Quality-of-Experience (QoE) and Power Efficiency Tradeoff for Fog Computing.
Optimizing Distributed Actor Systems for Dynamic Interactive Services
OPERATING SYSTEMS CS 3502 Fall 2017
Presented by: Saurav Kumar Bengani
Dynamo: A Runtime Codesign Environment
Introduction to Load Balancing:
International Conference on Data Engineering (ICDE 2016)
Introduction | Model | Solution | Evaluation
Spark Presentation.
A Study of Group-Tree Matching in Large Scale Group Communications
ABSTRACT   Recent work has shown that sink mobility along a constrained path can improve the energy efficiency in wireless sensor networks. Due to the.
Data Dissemination and Management (2) Lecture 10
PERFORMANCE ANALYSIS OF SPECTRUM SENSING USING COGNITIVE RADIO
#01 Client/Server Computing
Supporting Fault-Tolerance in Streaming Grid Applications
Collaborative Offloading for Distributed Mobile-Cloud Apps
Anne Pratoomtong ECE734, Spring2002
Parallel and Multiprocessor Architectures – Shared Memory
A Framework for Semantic-based Model Base in Decision Support Systems
First Hop Offloading of Mobile DAG Computations
Intelligent Contextual Data Stream Monitoring
Resource Allocation for Distributed Streaming Applications
Kostas Kolomvatsos, Christos Anagnostopoulos
Survey on Coverage Problems in Wireless Sensor Networks
Hongchao Zhou, Fei Liu, Xiaohong Guan
#01 Client/Server Computing
Data Dissemination and Management (2) Lecture 10
Presentation transcript:

Adaptive Offloading for Pervasive Computing AmiN Saremi 7/6/2005

Introduction Pervasive Computing Challenge: run complex applications on resource-constrained mobile device such as PDA. Solutions rewrite applications according to the resource capacity of each mobile device application-based or system-based adaptations Adaptive Offloading

Decision Making Problems for Adaptive Offloading The offloading inference engine should trigger offloading at the right time and offload the right program objects to achieve low offloading overhead and efficient program execution. adaptive offloading triggering efficient application partitioning

Solution Overview Our assumptions the application is written in an object-oriented languages the user’s environment contains powerful surrogates and plentiful wireless bandwidth

Offloading inference engine does not require any prior knowledge about an application’s execution pattern or the runtime environment’s resource status offloading inference engine employs the Fuzzy Control model as the basis for the offloading triggering inference module selects an effective application partitioning from many possible partition plans Memory constraint or CPU speed

Distributed Offloading Platform application execution monitoring Application execution graph Each graph node represents a Java class memory size, AccessFreq, Location, IsNative Each graph edge represents the interactions between the objects of two classes InteractionFreq, BandwidthRequirement

Candidate Partition Plan Generation Resource Monitoring mobile device, the surrogate, and the wireless network available memory in the Java heap, wireless bandwidth and delay Candidate Partition Plan Generation

Surrogate Discovery Transparent RPC Platform

Adaptive Offloading Inference Engine Overhead of offloading transferring objects between the mobile device and the surrogate performing remote data accesses and function invocations over a wireless network Offloading Triggering Inference examines the current resource and the available resources Decides whether offloading should be triggered decides what level of resource utilization

simple threshold-based approach “if the current amount of free memory on the mobile device is less than 20% of its total memory, then trigger offloading and offload enough program objects to free up at least 40% of the mobile device’s memory.” Fuzzy Control model linguistic decision-making rules provided by system or application developers membership functions generic fuzzy inference engine based on fuzzy logic theory

offloading memory size Offloading rules if (AvailMem is low) and (AvailBW is high) then NewMemSize := low; if (AvailMem is low) and (AvailBW is moderate) then NewMemSize := average; if (AvailMem is high) and (AvailBW is low) then NewMemSize := high; If any of these rules is matched by the current system conditions, the offloading inference engine triggers offloading offloading memory size current memory consumption - new memory utilization

Mappings between numerical and linguistic values for each linguistic variable

Application Partition Selection considering the target memory utilization on the mobile device multiple offloading requirements minimizing wireless bandwidth overhead minimizing average response time minimizing total execution time For each neighbor node Vk of Vi B i,k to denote the total amount of data traffic transferred between Vi and Vk, F i,k to define a total interaction number, MS k to represent the memory size of Vk.

For cost metrics Ck and Cl : Ck >=Cl if and only if Splitting Large Classes

Trace-Driven Simulation Experiments For comparison algorithm least recently used (LRU) Split Class Fuzzy Trigger our approach

References Xiaohui Gu, Alan Messer, Ira Greenberg, Dejan Milojicic, Klara Nahrstedt, “Adaptive Offloading for Pervasive Computing”, IEEE Pervasive Computing Magazine 2004. X. Gu, K. Nahrstedt, A. Messer, I. Greenberg, and D. Milojicic, “Adaptive Offloading Inference for Delivering Applications in Pervasive Computing Environment”, Proc. of IEEE International Conference on Pervasive Computing and Communications (PerCom 2003), Dallas-Fort Worth, Texas, March 2003.