1 Sizing the Streaming Media Cluster Solution for a Given Workload Lucy Cherkasova and Wenting Tang HPLabs.

Slides:



Advertisements
Similar presentations
TWO STEP EQUATIONS 1. SOLVE FOR X 2. DO THE ADDITION STEP FIRST
Advertisements

EE:450 – Computer Networks
Chapter 13: Query Processing
1 Senn, Information Technology, 3 rd Edition © 2004 Pearson Prentice Hall James A. Senns Information Technology, 3 rd Edition Chapter 7 Enterprise Databases.
Analysis of Computer Algorithms
1 SIMGRID_Scheduler A Simulated Scheduling System for GRID Environment Marcello CASTELLANO, Giacomo PISCITELLI and Nicola SIMEONE Department of Electrical.
Pricing for Utility-driven Resource Management and Allocation in Clusters Chee Shin Yeo and Rajkumar Buyya Grid Computing and Distributed Systems (GRIDS)
Effective Change Detection Using Sampling Junghoo John Cho Alexandros Ntoulas UCLA.
Usage-Based DHCP Lease- Time Optmization Manas Khadilkar, Nick Feamster, Russ Clark, Matt Sanders Georgia Tech.
Towards Automating the Configuration of a Distributed Storage System Lauro B. Costa Matei Ripeanu {lauroc, NetSysLab University of British.
On Scheduling Vehicle-Roadside Data Access Yang Zhang Jing Zhao and Guohong Cao The Pennsylvania State University.
Workload Characterization of SPECweb2005 Presentation at SPECworkshop by Rema Hariharan Ning Sun Sun Microsystems.
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
0 - 0.
FACTORING ax2 + bx + c Think “unfoil” Work down, Show all steps.
Addition Facts
Year 6 mental test 5 second questions
So far Binary numbers Logic gates Digital circuits process data using gates – Half and full adder Data storage – Electronic memory – Magnetic memory –
Chapter 6 File Systems 6.1 Files 6.2 Directories
1 Chapter 12 File Management Patricia Roy Manatee Community College, Venice, FL ©2008, Prentice Hall Operating Systems: Internals and Design Principles,
The Impact of Soft Resource Allocation on n-tier Application Scalability Qingyang Wang, Simon Malkowski, Yasuhiko Kanemasa, Deepal Jayasinghe, Pengcheng.
Demand Resource Operable Capacity Analysis – Assumptions for FCA 5.
Database Systems: Design, Implementation, and Management
SE-292 High Performance Computing
Copyright © 2009 EMC Corporation. Do not Copy - All Rights Reserved.
Hierarchical Caching and Prefetching for Continuous Media Servers with Smart Disks By:Amandeep Singh Parth Kushwaha.
4.1 © 2004 Pearson Education, Inc. Exam Managing and Maintaining a Microsoft® Windows® Server 2003 Environment Lesson 4: Organizing a Disk for Data.
HyLog: A High Performance Approach to Managing Disk Layout Wenguang Wang Yanping Zhao Rick Bunt Department of Computer Science University of Saskatchewan.
Managing Web server performance with AutoTune agents by Y. Diao, J. L. Hellerstein, S. Parekh, J. P. Bigu Jangwon Han Seongwon Park
An Application of Linear Programming Lesson 12 The Transportation Model.
A Survey of Web Cache Replacement Strategies Stefan Podlipnig, Laszlo Boszormenyl University Klagenfurt ACM Computing Surveys, December 2003 Presenter:
1 CS533 Modeling and Performance Evaluation of Network and Computer Systems Capacity Planning and Benchmarking (Chapter 9)
PRODUCTION AND OPERATIONS MANAGEMENT
MINERVA: an automated resource provisioning tool for large-scale storage systems G. Alvarez, E. Borowsky, S. Go, T. Romer, R. Becker-Szendy, R. Golding,
Chapter 6 File Systems 6.1 Files 6.2 Directories
Page 1 October 31, 2000 An Introduction to Large-Scale Software Development Steve Varnau Core HP-UX Operation October 31, 2000.
Sample Service Screenshots Enterprise Cloud Service 11.3.
Scheduling in Web Server Clusters CS 260 LECTURE 3 From: IBM Technical Report.
1 Developing a Predictive Model for Internet Video Quality-of-Experience Athula Balachandran, Vyas Sekar, Aditya Akella, Srinivasan Seshan, Ion Stoica,
Database System Concepts and Architecture
Routing and Congestion Problems in General Networks Presented by Jun Zou CAS 744.
Lets play bingo!!. Calculate: MEAN Calculate: MEDIAN
Addition 1’s to 20.
25 seconds left…...
Purple Market Research at INSIGHT 2006 November 2006 OLD MEETS NEW : using the Delphi Method to research the latest technology.
Subtraction: Adding UP
Equal or Not. Equal or Not
Slippery Slope
Week 1.
Number bonds to 10,
We will resume in: 25 Minutes.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Addressing the Network – IPv4 Network Fundamentals – Chapter 6.
©Brooks/Cole, 2001 Chapter 12 Derived Types-- Enumerated, Structure and Union.
QoS Aware Scheduling in a Cluster-Based Web Server Jiani Guo Architecture Lab Department of Computer Science and Engineering University of California,
SE-292 High Performance Computing Memory Hierarchy R. Govindarajan
PSSA Preparation.
University of Minnesota Optimizing MapReduce Provisioning in the Cloud Michael Cardosa, Aameek Singh†, Himabindu Pucha†, Abhishek Chandra
9. Two Functions of Two Random Variables
New Opportunities for Load Balancing in Network-Wide Intrusion Detection Systems Victor Heorhiadi, Michael K. Reiter, Vyas Sekar UNC Chapel Hill UNC Chapel.
SLA-Oriented Resource Provisioning for Cloud Computing
Cloud Computing Resource provisioning Keke Chen. Outline  For Web applications statistical Learning and automatic control for datacenters  For data.
1 Routing and Scheduling in Web Server Clusters. 2 Reference The State of the Art in Locally Distributed Web-server Systems Valeria Cardellini, Emiliano.
Performance Evaluation of Peer-to-Peer Video Streaming Systems Wilson, W.F. Poon The Chinese University of Hong Kong.
Web Server Load Balancing/Scheduling Asima Silva Tim Sutherland.
1 An SLA-Oriented Capacity Planning Tool for Streaming Media Services Lucy Cherkasova, Wenting Tang, and Sharad Singhal HPLabs,USA.
Web Server Load Balancing/Scheduling
Web Server Load Balancing/Scheduling
Distributed System Structures 16: Distributed Structures
Presentation transcript:

1 Sizing the Streaming Media Cluster Solution for a Given Workload Lucy Cherkasova and Wenting Tang HPLabs

2 Capacity Planning Scenarios Service provider needs to migrate his media site to a new infrastructure. While he has information about the site workload (the media the server logs reflecting the accesses to the media site in the past), it is a problem to map workload requirements in the resource requirements Can we design a tool helping to accomplish the capacity planning tasks? The goal of the proposed capacity planning tool is to provide the best cost/performance configuration for support of a known media service workload.

3 Capacity Planning Framework

4 Main Components Two main components: –A media workload profiler MediaProf that extracts a set of quantitative and qualitative parameters characterizing the service demand –The capacity measurements of h/w and s/w solutions using a specially designed set of media benchmarks; The capacity planning tool matches the requirements of the media service workload profile, SLAs and configuration constraints to produce the best available cost/performance solution.

5 Basic Benchmarks: Single File Benchmark: all clients are accessing the same file (encoded at different bit rates) Unique Files Benchmark: all clients are accessing different (unique) files(encoded at different bit rates) In our tests, we use the sets of files encoded at different bit rates: 28 Kb/s (analog modem users) 56 Kb/s (analog modem and ISDN users) 112Kb/s (dual ISDN users) 256Kb/s (cable modem users) 350Kb/s (DSL/cable users) 500Kb/s (high-bandwidth users)

6 Workload-Aware Performance Model of Streaming Media Server Capacity How to compute the expected media server capacity for realistic workload if the measured capacities under the basic benchmarks are given. We introduce cost function which defines a fraction of system resources needed to support a particular stream depending on –file encoding bit rate and –file access type (streamed from memory or disk). Introduced cost function uses a single value to reflect the combined resource requirements such as CPU, disk, memory and server bandwidth necessary to support a particular media request.

7 Computing Required System Capacity Example: Computed Load of 4.5 indicates that considered media workload requires 5 nodes for its support. Capacity equation:

8 Workload Profiler MediaProf MediaProf reflects the access traffic profile for capacity planning goals: –Evaluates the number of simultaneous (concurrent) connections over time; –Classifies the simultaneous connections into the encoding bit rate bins; –Classifies the simultaneous connections by the file access type: disk vs memory

9 Segment-based Memory Model To stream the file from memory, it is not necessary to have the whole file in memory!

10 Media Workload Characterization Example: analysis of the HP Corporate Media Site over a period of 1 year duration: Number of concurrent connections Peak Bandwidth requirements Number of requests served from memoryNumber of requests served from disk

11 Overall Capacity Planning Process There are several logical steps in the capacity planning procedure: –Computing the media site workload profiles for different memory sizes of interest. During the initial step, we assume a single node cluster: N=1 –Computing the service demand profile. The service demand profile is the ordered list of pairs: (time duration, service demand). For example: (300, 4.5 ) (600, 4 ) (2000, 3.8) (1000, 3.5) …

12 Overall Capacity Planning Process (cont.) –Combining the service demand requirements, the SLAs, and the configuration constraints: SLAs: Based on the past workload history, find the configuration that 99% of the time is capable of processing the load; Constraints: Based on the past workload history, find the configuration that 90% of the time is utilized under 70% of its capacity.

13 Overall Capacity Planning Additionally, we need to do a cluster sizing with an appropriate load balancing strategy

14 Evaluating Load Balancing Solutions For an accurate cluster sizing we need to take into account both: increased processing power (N nodes) and increased memory size (N times M) In our capacity planning tool, we implemented 2 strategies: –Round Robin –LARD (locality-aware ): first access goes to random node in the cluster, but subsequest requests to the same file are send to the same node. If the outcome of the first iteration is k nodes then –Partition original workload in k sub-trace W 1, W 2, …, W k where Dispatcher employs the corresponding load balancing strategy; –Compute media workload profile for each W 1, W 2, …, W k using MediaProf –Merging the computed sub-workload profiles and computing overall service demand profile

15 Performance Results For workload generation, we used MediSyn: publicly available synthetic workload generator. W SYN (with parameters that are typical for enterprise media workloads) 20% of videos are 0-2 min long 10% of videos are 2-5 min long 13% of videos are 5-10 min long Video Duration 23% of videos are min long 21% of videos are min long 13% of videos are longer than 60 min 5% of videos encoded at 56 Kb/s 20% of videos encoded at 112Kb/s 50% of videos encoded at 256Kb/s File Encoding Bit Rate 25% of videos encoded at 500Kb/s

16 Simulation Environment (cont.) The file popularity in W SYN is defined by Zipf-like distribution with alpha = Overall, W SYN has 800 files (with 41GB storage footprint), and 90% of requests target 10% of the files (with 3.8GB storage footprint) Media server capacity : Let the server memory size of interest is: 0.5GB and 1Gb, and the cost of disk access is 5 times the cost of memory access.

17 Capacity Planning (first iteration) Considered workload requires 5nodes with memory of 1GB, or 6 nodes with memory of 0.5GB

18 Round Robin Strategy Since the RR strategy distributes the requests uniformly to all the machines, this prohibits efficient memory usage increased cluster memory does not provide additional performance benefits

19 LARD Load Balancing Locality aware load balancing strategy provides significant performance benefits due to efficient memory usage.

20 Cluster sizing Cluster sizing results for a given synthetic workload are summarized in the following Table: Locality aware load balancing strategy utilizes the increased cluster memory more efficiently, and requires less nodes to Support the same traffic.

21 Conclusion We proposed a new unified benchmarking and capacity planning framework: –Measure media server via a set of basic benchmarks; –Derives the resource requirements using a single value cost function; –Estimate the service capacity requirements from the proposed media workload profile. In future work, we would like to incorporate the availability requirements into the proposed capacity planning framework.