1 Copyright © 2012, Elsevier Inc. All rights reserved. Chapter 6 Warehouse-Scale Computers to Exploit Request-Level and Data-Level Parallelism: Computer.

Slides:



Advertisements
Similar presentations
1 Copyright © 2012, Elsevier Inc. All rights reserved. Chapter 6 Warehouse-Scale Computers to Exploit Request-Level and Data-Level Parallelism: Computer.
Advertisements

MAP REDUCE PROGRAMMING Dr G Sudha Sadasivam. Map - reduce sort/merge based distributed processing Best for batch- oriented processing Sort/merge is primitive.
Cloud Computing Data Centers Dr. Sanjay P. Ahuja, Ph.D FIS Distinguished Professor of Computer Science School of Computing, UNF.
Empowering Business in Real Time. © Copyright 2009, OSIsoft Inc. All rights Reserved. Virtualization and HA PI Systems: Three strategies to keep your PI.
The University of Adelaide, School of Computer Science
Chapter 1 Introduction 1.1A Brief Overview - Parallel Databases and Grid Databases 1.2Parallel Query Processing: Motivations 1.3Parallel Query Processing:
Homework 2 In the docs folder of your Berkeley DB, have a careful look at documentation on how to configure BDB in main memory. In the docs folder of your.
Jennifer Rexford Princeton University MW 11:00am-12:20pm Data-Center Traffic Management COS 597E: Software Defined Networking.
Take An Internal Look at Hadoop Hairong Kuang Grid Team, Yahoo! Inc
Virtual Clusters Supporting MapReduce in the Cloud Jonathan Klinginsmith School of Informatics and Computing.
Advanced Topics: MapReduce ECE 454 Computer Systems Programming Topics: Reductions Implemented in Distributed Frameworks Distributed Key-Value Stores Hadoop.
Data Mining on the Web via Cloud Computing COMS E6125 Web Enhanced Information Management Presented By Hemanth Murthy.
Ch 4. The Evolution of Analytic Scalability
MapReduce.
Introduction to Parallel Programming MapReduce Except where otherwise noted all portions of this work are Copyright (c) 2007 Google and are licensed under.
1 Copyright © 2011, Elsevier Inc. All rights Reserved. Chapter 6 Authors: John Hennessy & David Patterson.
CHAPTER 2 OPERATING SYSTEM OVERVIEW 1. Operating System Operating System Definition A program that controls the execution of application programs and.
1 Lecture 20: WSC, Datacenters Topics: warehouse-scale computing and datacenters (Sections ) – the basics followed by a look at the future.
Map Reduce for data-intensive computing (Some of the content is adapted from the original authors’ talk at OSDI 04)
Lecture 13 Warehouse Computing Prof. Xiaoyao Liang 2015/6/10
Software Architecture
CS525: Special Topics in DBs Large-Scale Data Management Hadoop/MapReduce Computing Paradigm Spring 2013 WPI, Mohamed Eltabakh 1.
MapReduce: Simplified Data Processing on Large Clusters Jeffrey Dean and Sanjay Ghemawat.
MapReduce – An overview Medha Atre (May 7, 2008) Dept of Computer Science Rensselaer Polytechnic Institute.
MapReduce: Hadoop Implementation. Outline MapReduce overview Applications of MapReduce Hadoop overview.
Hadoop/MapReduce Computing Paradigm 1 Shirish Agale.
Introduction to Hadoop and HDFS
Hadoop Hardware Infrastructure considerations ©2013 OpalSoft Big Data.
MAP REDUCE : SIMPLIFIED DATA PROCESSING ON LARGE CLUSTERS Presented by: Simarpreet Gill.
Challenges towards Elastic Power Management in Internet Data Center.
Click to add text Introduction to the new mainframe: Large-Scale Commercial Computing © Copyright IBM Corp., All rights reserved. Chapter 2: Capacity.
MapReduce Kristof Bamps Wouter Deroey. Outline Problem overview MapReduce o overview o implementation o refinements o conclusion.
How AWS Pricing Works Jinesh Varia Technology Evangelist.
Computing Scientometrics in Large-Scale Academic Search Engines with MapReduce Leonidas Akritidis Panayiotis Bozanis Department of Computer & Communication.
11 CLUSTERING AND AVAILABILITY Chapter 11. Chapter 11: CLUSTERING AND AVAILABILITY2 OVERVIEW  Describe the clustering capabilities of Microsoft Windows.
By Jeff Dean & Sanjay Ghemawat Google Inc. OSDI 2004 Presented by : Mohit Deopujari.
Chapter 5 Ranking with Indexes 1. 2 More Indexing Techniques n Indexing techniques:  Inverted files - best choice for most applications  Suffix trees.
HADOOP DISTRIBUTED FILE SYSTEM HDFS Reliability Based on “The Hadoop Distributed File System” K. Shvachko et al., MSST 2010 Michael Tsitrin 26/05/13.
CS525: Big Data Analytics MapReduce Computing Paradigm & Apache Hadoop Open Source Fall 2013 Elke A. Rundensteiner 1.
C-Store: MapReduce Jianlin Feng School of Software SUN YAT-SEN UNIVERSITY May. 22, 2009.
Data Communications and Networks Chapter 9 – Distributed Systems ICT-BVF8.1- Data Communications and Network Trainer: Dr. Abbes Sebihi.
Hadoop/MapReduce Computing Paradigm 1 CS525: Special Topics in DBs Large-Scale Data Management Presented By Kelly Technologies
MapReduce: Simplified Data Processing on Large Clusters By Dinesh Dharme.
1 Lecture: WSC, Datacenters Topics: network-on-chip wrap-up, warehouse-scale computing and datacenters (Sections )
Background Computer System Architectures Computer System Software.
1 Lecture 24: WSC, Datacenters Topics: network-on-chip wrap-up, warehouse-scale computing and datacenters (Sections )
Data Centers and Cloud Computing 1. 2 Data Centers 3.
1 现代计算机体系结构 主讲教师:张钢 教授 天津大学计算机学院 通信邮箱: 提交作业邮箱: 2015 年.
CS203 – Advanced Computer Architecture Warehouse Scale Computing.
COMP7330/7336 Advanced Parallel and Distributed Computing MapReduce - Introduction Dr. Xiao Qin Auburn University
Prof. Jong-Moon Chung’s Lecture Notes at Yonsei University
Chapter 1 Characterization of Distributed Systems
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING CLOUD COMPUTING
The University of Adelaide, School of Computer Science
Lecture 20: WSC, Datacenters
Chapter 6 Warehouse-Scale Computers to Exploit Request-Level and Data-Level Parallelism Topic 7 Physical Infrastructure of WSC Prof. Zhang Gang
Chapter 6 Warehouse-Scale Computers to Exploit Request-Level and Data-Level Parallelism Topic 4 Storage Prof. Zhang Gang School of.
The University of Adelaide, School of Computer Science
The University of Adelaide, School of Computer Science
Cloud Computing Data Centers
湖南大学-信息科学与工程学院-计算机与科学系
Lecture 18 Warehouse Scale Computing
The University of Adelaide, School of Computer Science
Distributed and Cloud Computing K. Hwang, G. Fox and J
Cloud Computing Data Centers
Lecture 18 Warehouse Scale Computing
Lecture 18 Warehouse Scale Computing
Introduction To Distributed Systems
MapReduce: Simplified Data Processing on Large Clusters
Presentation transcript:

1 Copyright © 2012, Elsevier Inc. All rights reserved. Chapter 6 Warehouse-Scale Computers to Exploit Request-Level and Data-Level Parallelism: Computer Architecture A Quantitative Approach, Fifth Edition

2 Copyright © 2012, Elsevier Inc. All rights reserved. Introduction Warehouse-scale computer (WSC) Provides Internet services Search, social networking, online maps, video sharing, online shopping, , cloud computing, etc. Differences with HPC “clusters”: Clusters have higher performance processors and network Clusters emphasize latency to complete a single task, WSCs emphasize request-level parallelism Differences with datacenters: Datacenters consolidate different machines and software into one location. Centrally provide HW&SW needs of an organization. Datacenters emphasize virtual machines and hardware heterogeneity in order to serve varied customers. WSCs tend to have homogeneous HW; support many less versatile tasks Introduction

3 Copyright © 2012, Elsevier Inc. All rights reserved. Introduction Important design factors for WSC: Cost-performance Small savings add up Energy efficiency Affects power distribution and cooling Work per joule Dependability via redundancy Network I/O Interactive and batch processing workloads Ample computational parallelism is not important Most jobs are totally independent “Request-level parallelism” Operational costs count Power consumption is a primary, not secondary, constraint when designing system Scale and its opportunities and problems Can afford to build customized systems since WSC require volume purchase Introduction

4 Copyright © 2012, Elsevier Inc. All rights reserved. Prgrm’g Models and Workloads In addition to “public-facing” internet services (search, video sharing, sorical networking) WSCs also run batch apps (convert videos into new format, create search indexes from Web crawlers) Lead batch processing framework: MapReduce (using open-source Hadoop) Map: applies a programmer-supplied function to each logical input record Runs on thousands of computers Provides new set of key-value pairs as intermediate values Reduce: collapses values using another programmer- supplied function Programming Models and Workloads for WSCs

5 Copyright © 2012, Elsevier Inc. All rights reserved. Prgrm’g Models and Workloads Example: map (String key, String value): // key: document name // value: document contents for each word w in value Emit(w,”1”); // Produce list of all words reduce (String key, Iterator values): // key: a word // value: a list of counts int result = 0; for each v in values: result += ParseInt(v); // get integer from key-value pair Emit(word,result); Programming Models and Workloads for WSCs Each document is split into words, and each word is counted by the map function, using the word as the result key. The framework puts together all the pairs with the same key and feeds them to the same call to reduce, thus this function just needs to sum all of its input values to find the total appearances of that word

6 Copyright © 2012, Elsevier Inc. All rights reserved. Prgrm’g Models and Workloads MapReduce runtime environment schedules map and reduce task to WSC nodes Availability: Use replicas of data across different servers Use relaxed consistency: No need for all replicas to always agree. Only eventually. Makes storage system easier to scale – important for WSC. Workload demands Often vary considerably Programming Models and Workloads for WSCs

7 Copyright © 2012, Elsevier Inc. All rights reserved. Computer Architecture of WSC WSC often use a hierarchy of networks for interconnection Each 19” rack holds 48 1U (”rack units”)servers connected to a rack switch Rack switches are uplinked to switch higher in hierarchy Uplink has 48 / n times lower bandwidth, where n = # of uplink ports “Oversubscription” Goal is to maximize locality of communication relative to the rack (programmer needs to know relative bandwidths) Computer Ar4chitecture of WSC

8 Copyright © 2012, Elsevier Inc. All rights reserved. Storage Storage options: Use disks inside the servers, or Network attached storage through Infiniband WSCs generally rely on local disks Google File System (GFS) uses local disks and maintains at least three relicas Computer Ar4chitecture of WSC

9 Copyright © 2012, Elsevier Inc. All rights reserved. Array Switch Switch that connects an array of racks Array switch should have 10 X the bisection bandwidth of rack switch Cost of n-port switch grows as n 2 Often utilize content addressible memory chips and FPGAs Much more expensive than 48-port commodity internet switch Computer Ar4chitecture of WSC

10 Copyright © 2012, Elsevier Inc. All rights reserved. WSC Memory Hierarchy Servers can access DRAM and disks on other servers using a NUMA-style interface Computer Ar4chitecture of WSC

11 Copyright © 2012, Elsevier Inc. All rights reserved. Infrastructure and Costs of WSC Location of WSC Proximity to Internet backbones, electricity cost, property tax rates, low risk from earthquakes, floods, and hurricanes Power distribution and where losses occur Physcical Infrastrcuture and Costs of WSC

12 Copyright © 2012, Elsevier Inc. All rights reserved. Infrastructure and Costs of WSC Cooling Air conditioning used to cool server room 64 F – 71 F Keep temperature higher (closer to 71 F) Cooling towers can also be used Minimum temperature is “wet bulb temperature” Mechanical design for cooling systems Physcical Infrastrcuture and Costs of WSC

13 Copyright © 2012, Elsevier Inc. All rights reserved. Infrastructure and Costs of WSC Cooling system also uses water (evaporation and spills) E.g. 70,000 to 200,000 gallons per day for an 8 MW facility Power cost breakdown: Chillers: 30-50% of the power used by the IT equipment Air conditioning: 10-20% of the IT power, mostly due to fans How many servers can a WSC support? Each server: “Nameplate power rating” gives maximum power consumption To get actual, measure power under actual workloads Oversubscribe cumulative server power by 40%, but monitor power closely Physcical Infrastrcuture and Costs of WSC

14 Copyright © 2012, Elsevier Inc. All rights reserved. Measuring Efficiency of a WSC Power Utilization Effectiveness (PEU) = Total facility power / IT equipment power Median PUE on 2006 study was 1.69 Performance Latency is important metric because it is seen by users Bing study: users will use search less as response time increases Service Level Objectives (SLOs)/Service Level Agreements (SLAs) E.g. 99% of requests be below 100 ms Physcical Infrastrcuture and Costs of WSC

15 Copyright © 2012, Elsevier Inc. All rights reserved. Cost of a WSC Capital expenditures (CAPEX) Cost to build a WSC Operational expenditures (OPEX) Cost to operate a WSC Physcical Infrastrcuture and Costs of WSC

16 Copyright © 2012, Elsevier Inc. All rights reserved. Cloud Computing WSCs offer economies of scale that cannot be achieved with a datacenter: 5.7 times reduction in storage costs 7.1 times reduction in administrative costs 7.3 times reduction in networking costs This has given rise to cloud services such as Amazon Web Services “Utility Computing” Based on using open source virtual machine and operating system software Cloud Computing