A Framework for Automatic Resource and Accuracy Management in A Cloud Environment Smita Vijayakumar.

Slides:



Advertisements
Similar presentations
Congestion Control and Fairness Models Nick Feamster CS 4251 Computer Networking II Spring 2008.
Advertisements

Feedback Control Real-Time Scheduling: Framework, Modeling, and Algorithms Chenyang Lu, John A. Stankovic, Gang Tao, Sang H. Son Presented by Josh Carl.
Analysis of : Operator Scheduling in a Data Stream Manager CS561 – Advanced Database Systems By Eric Bloom.
Decomposition Method.
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.
Resource-oriented Approximation for Frequent Itemset Mining from Bursty Data Streams SIGMOD’14 Toshitaka Yamamoto, Koji Iwanuma, Shoshi Fukuda.
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.
Strider : Automatic Rate Adaptation & Collision Handling Aditya Gudipati & Sachin Katti Stanford University 1.
SKELETON BASED PERFORMANCE PREDICTION ON SHARED NETWORKS Sukhdeep Sodhi Microsoft Corp Jaspal Subhlok University of Houston.
Adaptive Data Collection Strategies for Lifetime-Constrained Wireless Sensor Networks Xueyan Tang Jianliang Xu Sch. of Comput. Eng., Nanyang Technol. Univ.,
1 Learning to Detect Objects in Images via a Sparse, Part-Based Representation S. Agarwal, A. Awan and D. Roth IEEE Transactions on Pattern Analysis and.
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.
An Adaptive Multi-Objective Scheduling Selection Framework For Continuous Query Processing Timothy M. Sutherland Bradford Pielech Yali Zhu Luping Ding.
1 K. Salah Module 6.1: TCP Flow and Congestion Control Connection establishment & Termination Flow Control Congestion Control QoS.
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.
Research on cloud computing application in the peer-to-peer based video-on-demand systems Speaker : 吳靖緯 MA0G rd International Workshop.
Naixue GSU Slide 1 ICVCI’09 Oct. 22, 2009 A Multi-Cloud Computing Scheme for Sharing Computing Resources to Satisfy Local Cloud User Requirements.
Dynamic and Decentralized Approaches for Optimal Allocation of Multiple Resources in Virtualized Data Centers Wei Chen, Samuel Hargrove, Heh Miao, Liang.
Physical Layer Informed Adaptive Video Streaming Over LTE Xiufeng Xie, Xinyu Zhang Unviersity of Winscosin-Madison Swarun KumarLi Erran Li MIT Bell Labs.
Preference-Aware Query and Update Scheduling in Web-databases Huiming Qu Department of Computer Science University of Pittsburgh Joint work with Prof.
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.
Xiao Liu, Jinjun Chen, Ke Liu, Yun Yang CS3: Centre for Complex Software Systems and Services Swinburne University of Technology, Melbourne, Australia.
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.
On Optimizing the Backoff Interval for Random Access Scheme Zygmunt J. Hass and Jing Deng IEEE Transactions on Communications, Dec 2003.
Virtual-Time Round-Robin: An O(1) Proportional Share Scheduler By Jason Nieh, etc Xiaojun Wang 10/07/2005.
1 Supporting Dynamic Migration in Tightly Coupled Grid Applications Liang Chen Qian Zhu Gagan Agrawal Computer Science & Engineering The Ohio State University.
Adaptive Sleep Scheduling for Energy-efficient Movement-predicted Wireless Communication David K. Y. Yau Purdue University Department of Computer Science.
Sporadic model building for efficiency enhancement of the hierarchical BOA Genetic Programming and Evolvable Machines (2008) 9: Martin Pelikan, Kumara.
Analysis and Design of an Adaptive Virtual Queue (AVQ) Algorithm for AQM By Srisankar Kunniyur & R. Srikant Presented by Hareesh Pattipati.
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.
Towards Optimal Sleep Scheduling in Sensor Networks for Rare-Event Detection Qing Cao, Tarek Abdelzaher, Tian He, John Stankovic Department of Computer.
SketchVisor: Robust Network Measurement for Software Packet Processing
R-Storm: Resource Aware Scheduling in Storm
Optimizing Distributed Actor Systems for Dynamic Interactive Services
Neha Jain Shashwat Yadav
Outline Introduction Related Work
MCTS Guide to Microsoft Windows 7
Presented by Kristen Carlson Accardi
Distributed Multimedia Systems
Manufacturing system design (MSD)
Performance Evaluation of Adaptive MPI
Liang Chen Advisor: Gagan Agrawal Computer Science & Engineering
Supporting Fault-Tolerance in Streaming Grid Applications
Transport Layer Unit 5.
Lecture 19 – TCP Performance
FAST TCP : From Theory to Experiments
Jason Neih and Monica.S.Lam
Smita Vijayakumar Qian Zhu Gagan Agrawal
COMP/ELEC 429/556 Introduction to Computer Networks
Virtual-Time Round-Robin: An O(1) Proportional Share Scheduler
Congestion Control, Internet Transport Protocols: UDP
Yiannis Andreopoulos et al. IEEE JSAC’06 November 2006
GATES: A Grid-Based Middleware for Processing Distributed Data Streams
Class 4: Repetition Pretest Posttest Counting Flowchart these!
M. Kezunovic (P.I.) S. S. Luo D. Ristanovic Texas A&M University
Department of Computer Science University of California, Santa Barbara
Computer Networks Protocols
Modeling and Evaluating Variable Bit rate Video Steaming for ax
Presentation transcript:

A Framework for Automatic Resource and Accuracy Management in A Cloud Environment Smita Vijayakumar

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

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 Time interval between successive packets never a perfect constant This leads to Jitter 4

Examples of Data Streams Live Camera Captures Telecommunication Networks Stock Markets Network Monitoring Video Streaming Applications Business Transaction Flows 5

Properties of Data Streams Require Real-Time Analysis Time-Varying Characteristics Time-Varying Resource Requirements 6

Resource Allocation: Guiding Principles Utility Computing Pay-as-you-go Two desirable features : Automatic Resource Allocation Eliminates User intervention Dynamic Resource Allocation Better Resource Management Lesser Overall Costs

Virtualization Software implementation of a machine that executes programs Resources can be allocated in a fine-grained way CPU cycles can be changed

Why Dynamic Resource Provisioning for Data Streams Sufficient Data to Process -> Max CPU Utilization Insufficient Data -> Wasted CPU Cycles and Unwanted Cost Varying Data Rates and Characteristics 9

CPU Allocation Algorithm Near-Optimal resource allocation at bottleneck stage by constant monitoring of processing load Design Principle: Match processing speed with data arrival rate

Accuracy Adaptation Consider Adaptive Streaming Applications Such application have Adaptive Parameters that determine accuracy of the application Parameter values can be set according to user-desired accuracy levels and resource budgets

Example of Adaptive Application Random stream of integers Application retains the average of every third integer in the stream 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 Requirement: User-defined processing accuracy should be met Require corresponding Resource Allocations Final cost determined by amount of resources allocated

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 ..

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

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 Static Experiments Constant Data Rate And Characteristics Dynamic Experiments Varying Data Rates and Characteristics Evaluate Accuracy Adaptation for User-Specified Accuracy Converge to near-optimal CPU 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

CPU Convergence Experiments Experimental Results CPU Convergence Experiments

CluStream Static Convergence 36.0% 35.6% Convergence to an ideal 36% CPU Allocation

Approx-Freq-Counts Static Convergence 71.3% 71.2% Convergence to an ideal 71% CPU Allocation

CluStream Dynamic Convergence Convergence to 18-53-18 CPU Allocation

Approx-Freq-Counts Dynamic Convergence Convergence to 32-76-32 CPU Allocation

Accuracy Convergence Experiments Experimental Results Accuracy Convergence Experiments

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

CluStream Static Accuracy Adaptation 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 maintained Converges to near-optimal resource allocation Adapts to varying data stream characteristics Low Overheads: Within 2% ideal resource allocation

Thank You!