Smita Vijayakumar Qian Zhu Gagan Agrawal

Slides:



Advertisements
Similar presentations
Analysis of : Operator Scheduling in a Data Stream Manager CS561 – Advanced Database Systems By Eric Bloom.
Advertisements

VSMC MIMO: A Spectral Efficient Scheme for Cooperative Relay in Cognitive Radio Networks 1.
SLA-Oriented Resource Provisioning for Cloud Computing
Jaringan Komputer Lanjut Packet Switching Network.
Adaptive Frequency Counting over Bursty Data Streams Bill Lin, Wai-Shing Ho, Ben Kao and Chun-Kit Chui Form CIDM07.
Doc.: IEEE /0604r1 Submission May 2014 Slide 1 Modeling and Evaluating Variable Bit rate Video Steaming for ax Date: Authors:
Esma Yildirim Department of Computer Engineering Fatih University Istanbul, Turkey DATACLOUD 2013.
Cloud Computing Resource provisioning Keke Chen. Outline  For Web applications statistical Learning and automatic control for datacenters  For data.
Adaptive Sampling for Sensor Networks Ankur Jain ٭ and Edward Y. Chang University of California, Santa Barbara DMSN 2004.
AQM for Congestion Control1 A Study of Active Queue Management for Congestion Control Victor Firoiu Marty Borden.
Adaptive Ordering of Pipelined Stream Filters S. Babu, R. Motwani, K. Munagala, I. Nishizawa, and J. Widom In Proc. of SIGMOD 2004, June 2004.
Adaptive Sampling in Distributed Streaming Environment Ankur Jain 2/4/03.
An Adaptive Multi-Objective Scheduling Selection Framework For Continuous Query Processing Timothy M. Sutherland Bradford Pielech Yali Zhu Luping Ding.
Bandwidth Allocation in a Self-Managing Multimedia File Server Vijay Sundaram and Prashant Shenoy Department of Computer Science University of Massachusetts.
Receiver-Driven Bandwidth Sharing for TCP and its Application to Video Streaming Puneet Mehra, Christophe De Vleeschouwer, and Avideh Zakhor IEEE Transactions.
Secure Embedded Processing through Hardware-assisted Run-time Monitoring Zubin Kumar.
Research on cloud computing application in the peer-to-peer based video-on-demand systems Speaker : 吳靖緯 MA0G rd International Workshop.
Dynamic and Decentralized Approaches for Optimal Allocation of Multiple Resources in Virtualized Data Centers Wei Chen, Samuel Hargrove, Heh Miao, Liang.
Self Adaptivity in Grid Computing Reporter : Po - Jen Lo Sathish S. Vadhiyar and Jack J. Dongarra.
An Autonomic Framework in Cloud Environment Jiedan Zhu Advisor: Prof. Gagan Agrawal.
A Framework for Elastic Execution of Existing MPI Programs Aarthi Raveendran Tekin Bicer Gagan Agrawal 1.
20 October 2006Workflow Optimization in Distributed Environments Dynamic Workflow Management Using Performance Data David W. Walker, Yan Huang, Omer F.
Budget-based Control for Interactive Services with Partial Execution 1 Yuxiong He, Zihao Ye, Qiang Fu, Sameh Elnikety Microsoft Research.
Dynamic Resource Monitoring and Allocation in a virtualized environment.
Euro-Par, A Resource Allocation Approach for Supporting Time-Critical Applications in Grid Environments Qian Zhu and Gagan Agrawal Department of.
Smita Vijayakumar Qian Zhu Gagan Agrawal 1.  Background  Data Streams  Virtualization  Dynamic Resource Allocation  Accuracy Adaptation  Research.
Performance Prediction for Random Write Reductions: A Case Study in Modelling Shared Memory Programs Ruoming Jin Gagan Agrawal Department of Computer and.
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.
1 A Grid-Based Middleware for Processing Distributed Data Streams Liang Chen Advisor: Gagan Agrawal Computer Science & Engineering.
Zibin Zheng DR 2 : Dynamic Request Routing for Tolerating Latency Variability in Cloud Applications CLOUD 2013 Jieming Zhu, Zibin.
1 Supporting Dynamic Migration in Tightly Coupled Grid Applications Liang Chen Qian Zhu Gagan Agrawal Computer Science & Engineering The Ohio State University.
Project Presentation By: Dean Morrison 12/6/2006 Dynamically Adaptive Prepaging for Effective Virtual Memory Management.
Adaptive Sleep Scheduling for Energy-efficient Movement-predicted Wireless Communication David K. Y. Yau Purdue University Department of Computer Science.
Analysis and Design of an Adaptive Virtual Queue (AVQ) Algorithm for AQM By Srisankar Kunniyur & R. Srikant Presented by Hareesh Pattipati.
Euro-Par, HASTE: An Adaptive Middleware for Supporting Time-Critical Event Handling in Distributed Environments ICAC 2008 Conference June 2 nd,
IEEE Rate Control Algorithms: Experimentation and Performance Evaluation in Infrastructure Mode Sourav Pal, Sumantra R. Kundu, Kalyan Basu and Sajal.
1 A Grid-Based Middleware’s Support for Processing Distributed Data Streams Liang Chen Advisor: Gagan Agrawal Computer Science & Engineering.
18 May 2006CCGrid2006 Dynamic Workflow Management Using Performance Data Lican Huang, David W. Walker, Yan Huang, and Omer F. Rana Cardiff School of Computer.
1 Supporting a Volume Rendering Application on a Grid-Middleware For Streaming Data Liang Chen Gagan Agrawal Computer Science & Engineering Ohio State.
A Hierarchical Edge Cloud Architecture for Mobile Computing IEEE INFOCOM 2016 Liang Tong, Yong Li and Wei Gao University of Tennessee – Knoxville 1.
MAC Protocols for Sensor Networks
Optimizing Distributed Actor Systems for Dynamic Interactive Services
A Dynamic Scheduling Framework for Emerging Heterogeneous Systems
Introduction to Load Balancing:
Outline Introduction Related Work
Edinburgh Napier University
QianZhu, Liang Chen and Gagan Agrawal
Distributed Multimedia Systems
Cloud Computing By P.Mahesh
Accelerating MapReduce on a Coupled CPU-GPU Architecture
Liang Chen Advisor: Gagan Agrawal Computer Science & Engineering
A Framework for Automatic Resource and Accuracy Management in A Cloud Environment Smita Vijayakumar.
Supporting Fault-Tolerance in Streaming Grid Applications
Linchuan Chen, Xin Huo and Gagan Agrawal
Lottery Scheduling Ish Baid.
Transport Layer Unit 5.
Lecture 19 – TCP Performance
Jason Neih and Monica.S.Lam
An Adaptive Middleware for Supporting Time-Critical Event Response
Virtual-Time Round-Robin: An O(1) Proportional Share Scheduler
Yiannis Andreopoulos et al. IEEE JSAC’06 November 2006
GATES: A Grid-Based Middleware for Processing Distributed Data Streams
Resource Allocation in a Middleware for Streaming Data
Operating System Introduction.
Resource Allocation for Distributed Streaming Applications
M. Kezunovic (P.I.) S. S. Luo D. Ristanovic Texas A&M University
Computer Networks Protocols
Modeling and Evaluating Variable Bit rate Video Steaming for ax
Supporting Online Analytics with User-Defined Estimation and Early Termination in a MapReduce-Like Framework Yi Wang, Linchuan Chen, Gagan Agrawal The.
Towards Predictable Datacenter Networks
Presentation transcript:

Smita Vijayakumar Qian Zhu Gagan Agrawal Automatic and Dynamic Accuracy Management and Resource Provisioning in A Cloud Environment Smita Vijayakumar Qian Zhu Gagan Agrawal

Outline Research Goals Accuracy Management Experimental Evaluation Background Data Streams Virtualization Dynamic Resource Allocation Accuracy Adaptation Research Goals CPU Resource Allocation Accuracy Management Experimental Evaluation Conclusion

Data Streams Sequence of data packets in transmission Example Live Camera Captures, Stock Markets, Video Streaming Applications, etc Require Real-Time Analysis 3

Data Stream Processing on Clouds and VMs Why Clouds for Streaming Apps Pay-as-you model Meet dynamically varying demand Clouds are based on Virtual Machines Software implementation of a machine that executes programs Hides hardware and software heterogeneity CPU can be shared between VMs Modes of Operation Capped Mode Non-Capped Mode

Resource Allocation: Guiding Principles Pay-as-you-go Automatic Resource Allocation Dynamic Resource Allocation Both varying Data Rates and Characteristics affect resource requirement Amount of Data and its Complexity determine CPU requirement

Research Goals Framework for providing Accuracy and Resource Management in Cloud Environment Accuracy Management Convergence to application-specific accuracy goal Maintain user-specified accuracy requirement for the entire duration of run CPU Management Converge to near -optimal resource allocation by constant monitoring of load characteristics

An Adaptive Application: Average of Input Stream Random stream of integers Application considers every third integer in the stream to compute average Adaptive Parameter, sample = 1/3 If higher accuracy is desired, sample can be set to ½ or 1 But then, that requires more CPU resources 1 2 7 4 2 5 8 2 6 8 0 4 3 4 8 2 2 6 7 3 4 3 1 3 6 8 3 2 5 9 9 3 4 6 8 .. 1 2 7 4 2 5 8 2 6 8 0 4 3 4 8 2 2 6 7 3 4 3 1 3 6 8 3 2 5 9 9 3 4 6 8 ..

Accuracy in Data Stream Processing Accuracy-specific processing: User- defined processing accuracy should be met Changes according to input Data Characteristics Require corresponding Resource Allocations Final cost determined by amount of resources allocated over time

Calculating Current Application Accuracy Application developer provides Accuracy Function Many methods of calculating accuracy: Method of direct comparison with input data Not always viable Method of correlation with more fine-grained processing Process data with current adaptive parameters Process same data set with adaptive parameter set to greater accuracy Compare results

Example of Accuracy in Adaptive Application Process batch with current value sample =1/3 For same data set Set sample = 1and find new average Accuracy = f(avg, higher_avg) If Accuracy < Accuracy Goal, set sample = 1/2 Repeat adapting sample 1 2 7 4 2 5 8 2 6 8 0 4 3 4 8 2 2 6 7 3 4 3 1 3 6 8 3 2 5 9 9 3 4 6 8 .. 1 2 7 4 2 5 8 2 6 8 0 4 3 4 8 2 2 6 7 3 4 3 1 3 6 8 3 2 5 9 9 3 4 6 8 ..

Outline Background Research Goals CPU Resource Allocation Accuracy Management Experimental Evaluation Conclusion

CPU Allocation Algorithm Monitor current load statistics Buffer Write Time Processing Time Time-Averaged rates Average data rate over a time window Update CPU allocation Time- Averaged pattern indicates decrease or increase in data flow Continuous Monitoring and Action Arrive at most optimal CPU Allocation

CPU Allocation Algorithm Resource Allocation Adjustments: Coarse Multiplicative Increase Fine Linear Increase Fine Linear Decrease Coarse Linear Decrease Inspired by TCP Congestion Control

CPU Allocation Algorithm Met Accuracy Goal? Sleep and awaken periodically Adjust CPU Allocation Met Allocation Needs? Yes No Yes No

Outline Background Research Goals CPU Resource Allocation Accuracy Management Experimental Evaluation Conclusion

Accuracy Management Checks periodically for accuracy level Re-computes application accuracy If less than specified value then Adjust adaptive parameters Repeat Once target accuracy is achieved, wakes up after every 500 rounds of processing

Accuracy Adaptation: Design Get Current Application Accuracy Met Accuracy Goal? Sleep and awaken periodically Yes No Adjust Adaptive Parameters

Interaction between Components Process Data Block If baseline accuracy not met Accuracy Module adapts till accuracy is met State: Accuracy Met Else, periodically monitor accuracy Periodically CPU Manager wakes up Checks if accuracy goal is met Checks CPU resource allocation

Outline Research Objectives Introduction to Cost Framework CPU Resource Allocation Accuracy Management Experimental Evaluation Static Experiments Dynamic Experiments Conclusion

Experimental Focus Experiments Process Static Experiments Constant Data Rate And Characteristics Dynamic Experiments Varying Data Rates and/or Characteristics Process Accuracy Adaptation to User-Specified Accuracy CPU Convergence to near-optimal Allocation

Streaming Applications Multi-staged pipelined processing Two streaming applications considered: CluStream Intermediate Microclustering of data Approx-Freq-Counts Mining most frequently seen itemset within permissible error

Experimental Setup Virtualization Technology: Xen Ideal CPU Usage: Xentop Applications initialized to values corresponding to least accuracy Communication between management node and processing nodes using UDP

CluStream Static Accuracy Adaptation Accuracy Adaptation for 1.2MBps and 6MBps data rates

CluStream Static Accuracy Adaptation Ideal CPU Load: 74% Average CPU Allocated: 76.0% Ideal CPU Load: 54% Average CPU Allocated: 55.4% Accuracy and CPU Allocation Adaptation for 1.2MBps and 6MBps data rates

Approx-Freq-Counts Dynamic Accuracy Adaptation Spread Distb Sharp Distb Spread Distb

Approx-Freq-Counts Dynamic Accuracy Adaptation Sharp Distb Slow Data Rate Spread Distb Fast Data Rate Sharp Distb Slow Data Rate

Conclusion A framework for automatically and dynamically managing resource allocations on cloud environments Eliminates manual intervention Ensures user-specified accuracy is maintained Converges to near-optimal resource allocation Adapts to varying data stream characteristics Low Overheads: Within 2% ideal resource allocation

Thank You!