The University of Adelaide, School of Computer Science

Slides:



Advertisements
Similar presentations
Lecture 12: MapReduce: Simplified Data Processing on Large Clusters Xiaowei Yang (Duke University)
Advertisements

1 Copyright © 2012, Elsevier Inc. All rights reserved. Chapter 6 Warehouse-Scale Computers to Exploit Request-Level and Data-Level Parallelism: Computer.
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.
 Need for a new processing platform (BigData)  Origin of Hadoop  What is Hadoop & what it is not ?  Hadoop architecture  Hadoop components (Common/HDFS/MapReduce)
Datacenter Power State-of-the-Art Randy H. Katz University of California, Berkeley LoCal 0 th Retreat “Energy permits things to exist; information, to.
1 Copyright © 2012, Elsevier Inc. All rights reserved. Chapter 6 Warehouse-Scale Computers to Exploit Request-Level and Data-Level Parallelism: Computer.
L22: SC Report, Map Reduce November 23, Map Reduce What is MapReduce? Example computing environment How it works Fault Tolerance Debugging Performance.
Lecture 2 – MapReduce CPE 458 – Parallel Programming, Spring 2009 Except as otherwise noted, the content of this presentation is licensed under the Creative.
MapReduce : Simplified Data Processing on Large Clusters Hongwei Wang & Sihuizi Jin & Yajing Zhang
Gordon: Using Flash Memory to Build Fast, Power-efficient Clusters for Data-intensive Applications A. Caulfield, L. Grupp, S. Swanson, UCSD, ASPLOS’09.
Advanced Topics: MapReduce ECE 454 Computer Systems Programming Topics: Reductions Implemented in Distributed Frameworks Distributed Key-Value Stores Hadoop.
SIDDHARTH MEHTA PURSUING MASTERS IN COMPUTER SCIENCE (FALL 2008) INTERESTS: SYSTEMS, WEB.
Data Mining on the Web via Cloud Computing COMS E6125 Web Enhanced Information Management Presented By Hemanth Murthy.
MapReduce.
Introduction to Parallel Programming MapReduce Except where otherwise noted all portions of this work are Copyright (c) 2007 Google and are licensed under.
By: Jeffrey Dean & Sanjay Ghemawat Presented by: Warunika Ranaweera Supervised by: Dr. Nalin Ranasinghe.
Cloud MapReduce : a MapReduce Implementation on top of a Cloud Operating System Speaker : 童耀民 MA1G Authors: Huan Liu, Dan Orban Accenture.
1 Copyright © 2011, Elsevier Inc. All rights Reserved. Chapter 6 Authors: John Hennessy & David Patterson.
1 Lecture 20: WSC, Datacenters Topics: warehouse-scale computing and datacenters (Sections ) – the basics followed by a look at the future.
Take a Close Look at MapReduce Xuanhua Shi. Acknowledgement  Most of the slides are from Dr. Bing Chen,
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
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: Hadoop Implementation. Outline MapReduce overview Applications of MapReduce Hadoop overview.
Hadoop/MapReduce Computing Paradigm 1 Shirish Agale.
Introduction to Hadoop and HDFS
Cloud Computing & Amazon Web Services – EC2 Arpita Patel Software Engineer.
Hadoop Hardware Infrastructure considerations ©2013 OpalSoft Big Data.
MAP REDUCE : SIMPLIFIED DATA PROCESSING ON LARGE CLUSTERS Presented by: Simarpreet Gill.
MapReduce How to painlessly process terabytes of data.
MapReduce Kristof Bamps Wouter Deroey. Outline Problem overview MapReduce o overview o implementation o refinements o conclusion.
18/01/2012 CS 61C: Great Ideas in Computer Architecture Warehouse-Scale Computers and Map Reduce Guest Lecturer: Raphael Townshend Summer Lecture.
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.
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.
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 )
Cloud Computing Shannon McManus Michael Weihert. What is Cloud Computing?
1 Lecture 24: WSC, Datacenters Topics: network-on-chip wrap-up, warehouse-scale computing and datacenters (Sections )
KAASHIV INFOTECH – A SOFTWARE CUM RESEARCH COMPANY IN ELECTRONICS, ELECTRICAL, CIVIL AND MECHANICAL AREAS
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
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING CLOUD COMPUTING
The University of Adelaide, School of Computer Science
Hadoop Aakash Kag What Why How 1.
Lecture 20: WSC, Datacenters
Green cloud computing 2 Cs 595 Lecture 15.
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.
Instructors: Yuanqing Cheng
The University of Adelaide, School of Computer Science
The University of Adelaide, School of Computer Science
MapReduce Simplied Data Processing on Large Clusters
Cloud Computing Data Centers
湖南大学-信息科学与工程学院-计算机与科学系
Lecture 18 Warehouse Scale Computing
The University of Adelaide, School of Computer Science
Ch 4. The Evolution of Analytic Scalability
Distributed and Cloud Computing K. Hwang, G. Fox and J
Cloud Computing Data Centers
Lecture 18 Warehouse Scale Computing
Lecture 18 Warehouse Scale Computing
MapReduce: Simplified Data Processing on Large Clusters
Presentation transcript:

The University of Adelaide, School of Computer Science Computer Architecture A Quantitative Approach, Fifth Edition The University of Adelaide, School of Computer Science 16 April 2017 Chapter 6 Warehouse-Scale Computers to Exploit Request-Level and Data-Level Parallelism: Copyright © 2012, Elsevier Inc. All rights reserved. Chapter 2 — Instructions: Language of the Computer

The University of Adelaide, School of Computer Science 16 April 2017 Introduction Introduction Warehouse-scale computer (WSC) Provide Internet services Search, social networking, online maps, video sharing, online shopping, email, cloud computing, etc. Provide Software as a Service (SaaS) Millions of users, millions of independent requests Threads rarely need to synchronize Request-level parallelism (RLP) Differences with HPC “clusters”: Clusters have higher performance processors and network Clusters emphasize thread-level parallelism, WSCs emphasize request-level parallelism Copyright © 2012, Elsevier Inc. All rights reserved. Chapter 2 — Instructions: Language of the Computer

The University of Adelaide, School of Computer Science 16 April 2017 Introduction 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 Copyright © 2012, Elsevier Inc. All rights reserved. Chapter 2 — Instructions: Language of the Computer

Prgrm’g Models and Workloads The University of Adelaide, School of Computer Science 16 April 2017 Prgrm’g Models and Workloads Batch processing framework: MapReduce 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 Copyright © 2012, Elsevier Inc. All rights reserved. Chapter 2 — Instructions: Language of the Computer

Prgrm’g Models and Workloads The University of Adelaide, School of Computer Science 16 April 2017 Prgrm’g Models and Workloads Example: map (String key, String value): // key: document name // value: document contents for each word w in value EmitIntermediate(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(AsString(result)); Programming Models and Workloads for WSCs Copyright © 2012, Elsevier Inc. All rights reserved. Chapter 2 — Instructions: Language of the Computer

Prgrm’g Models and Workloads The University of Adelaide, School of Computer Science 16 April 2017 Prgrm’g Models and Workloads MapReduce runtime environment schedules map and reduce task to WSC nodes Apache Hadoop is an open-source alternative Supports availability Use replicas of data across different servers Scales with workload demands Often vary considerably Programming Models and Workloads for WSCs Copyright © 2012, Elsevier Inc. All rights reserved. Chapter 2 — Instructions: Language of the Computer

Prgrm’g Models and Workloads Programming Models and Workloads for WSCs Copyright © 2012, Elsevier Inc. All rights reserved.

Computer Architecture of WSC The University of Adelaide, School of Computer Science 16 April 2017 Computer Architecture of WSC WSC often use a hierarchy of networks for interconnection Each rack holds servers connected to a rack switch Rack switches are uplinked to switch higher in hierarchy Goal is to maximize locality of communication relative to the rack Array switch connects an array of racks Array switch should have at least 10X the bandwidth of rack switch Cost of n-port switch grows as n2 Computer Ar4chitecture of WSC Copyright © 2012, Elsevier Inc. All rights reserved. Chapter 2 — Instructions: Language of the Computer

Computer Architecture of WSC The University of Adelaide, School of Computer Science 16 April 2017 Computer Architecture of WSC Computer Ar4chitecture of WSC Copyright © 2012, Elsevier Inc. All rights reserved. Chapter 2 — Instructions: Language of the Computer

Computer Architecture of WSC The University of Adelaide, School of Computer Science 16 April 2017 Computer Architecture of WSC Computer Ar4chitecture of WSC Copyright © 2012, Elsevier Inc. All rights reserved. Chapter 2 — Instructions: Language of the Computer

The University of Adelaide, School of Computer Science 16 April 2017 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 replicas Apache Hadoop uses a similar approach Computer Ar4chitecture of WSC Copyright © 2012, Elsevier Inc. All rights reserved. Chapter 2 — Instructions: Language of the Computer

The University of Adelaide, School of Computer Science 16 April 2017 WSC Memory Hierarchy Servers can access DRAM and disks on other servers using a NUMA-style interface Computer Ar4chitecture of WSC Copyright © 2012, Elsevier Inc. All rights reserved. Chapter 2 — Instructions: Language of the Computer

Infrastructure and Costs of WSC The University of Adelaide, School of Computer Science 16 April 2017 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 Physcical Infrastrcuture and Costs of WSC Copyright © 2012, Elsevier Inc. All rights reserved. Chapter 2 — Instructions: Language of the Computer

Infrastructure and Costs of WSC The University of Adelaide, School of Computer Science 16 April 2017 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” Physcical Infrastrcuture and Costs of WSC Copyright © 2012, Elsevier Inc. All rights reserved. Chapter 2 — Instructions: Language of the Computer

Infrastructure and Costs of WSC The University of Adelaide, School of Computer Science 16 April 2017 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 Copyright © 2012, Elsevier Inc. All rights reserved. Chapter 2 — Instructions: Language of the Computer

Measuring Efficiency of a WSC The University of Adelaide, School of Computer Science 16 April 2017 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 Copyright © 2012, Elsevier Inc. All rights reserved. Chapter 2 — Instructions: Language of the Computer

Measuring Efficiency of a WSC The University of Adelaide, School of Computer Science 16 April 2017 Measuring Efficiency of a WSC Physcical Infrastrcuture and Costs of WSC Copyright © 2012, Elsevier Inc. All rights reserved. Chapter 2 — Instructions: Language of the Computer

The University of Adelaide, School of Computer Science 16 April 2017 Google Servers Containers holding two rows of 29 racks each (58 racks) Each rack holds 20 servers (1160 total servers) Commodity hardware such as Dual-core AMD Opteron processors (2.2 GHz) Downclocked FSB (666 MHz -> 533 Mhz) 8 GB DDR2 DRAM 1 or 2 SATA disk drives 160 watts peak, 85 watts idle Physcical Infrastrcuture and Costs of WSC Copyright © 2012, Elsevier Inc. All rights reserved. Chapter 2 — Instructions: Language of the Computer

The University of Adelaide, School of Computer Science 16 April 2017 Google Servers Physcical Infrastrcuture and Costs of WSC Copyright © 2012, Elsevier Inc. All rights reserved. Chapter 2 — Instructions: Language of the Computer

The University of Adelaide, School of Computer Science 16 April 2017 Google Servers Physcical Infrastrcuture and Costs of WSC Copyright © 2012, Elsevier Inc. All rights reserved. Chapter 2 — Instructions: Language of the Computer

The University of Adelaide, School of Computer Science 16 April 2017 Google Servers Physcical Infrastrcuture and Costs of WSC Copyright © 2012, Elsevier Inc. All rights reserved. Chapter 2 — Instructions: Language of the Computer

Copyright © 2012, Elsevier Inc. All rights reserved. Cloud Computing Cheaper to rent computing time than to maintain servers (e.g., $0.10 per machine/hour) Uses virtual machines Protects users from each other Simplifies software distribution Easily to control resource usage Limited access to physical resources Hide actual hardware details Amazon Web Services (AWS) Simple Storage Service (S3) Elastic Compute Cloud (EC2) Copyright © 2012, Elsevier Inc. All rights reserved.

Copyright © 2012, Elsevier Inc. All rights reserved. Fallacies Cloud computing providers are losing money Capital costs for WSC are higher than for the servers that it houses Given improvements in DRAM dependability and the fault tolerance of WSC systems software, you don’t need to spend extra for ECC memory in a WSC Turning off hardware during periods of low activity improves cost-performance of a WSC Replacing all disks with flash memory will improve cost-performance of a WSC Copyright © 2012, Elsevier Inc. All rights reserved.

Copyright © 2012, Elsevier Inc. All rights reserved. Pitfalls Trying to save power with inactive low-power modes versus active low-power modes Using too wimpy a processor when trying to improve WSC cost-performance Copyright © 2012, Elsevier Inc. All rights reserved.