Big Compute, Big Net & Big Data: How to be big

Similar documents
Distributed File Systems II

Overview Computer Networking Lecture 16: Delivering Content: Peer to Peer and CDNs Peter Steenkiste

CISC 7610 Lecture 2b The beginnings of NoSQL

IBM Spectrum NAS, IBM Spectrum Scale and IBM Cloud Object Storage

Unit 8 Peer-to-Peer Networking

Next-Generation NVMe-Native Parallel Filesystem for Accelerating HPC Workloads

Peer-to-Peer Architectures and Signaling. Agenda

CSE6331: Cloud Computing

Distributed Systems. 15. Distributed File Systems. Paul Krzyzanowski. Rutgers University. Fall 2016

DDN About Us Solving Large Enterprise and Web Scale Challenges

Let s Make Parallel File System More Parallel

D1HT: A Distributed One Hop Hash Table

Distributed Systems. 15. Distributed File Systems. Paul Krzyzanowski. Rutgers University. Fall 2017

CS /30/17. Paul Krzyzanowski 1. Google Chubby ( Apache Zookeeper) Distributed Systems. Chubby. Chubby Deployment.

Telematics Chapter 9: Peer-to-Peer Networks

An effective single-hop distributed hash table with high lookup performance and low traffic overhead

CPSC 426/526. P2P Lookup Service. Ennan Zhai. Computer Science Department Yale University

HPC Storage Use Cases & Future Trends

Pervasive DataRush TM

NetApp: Solving I/O Challenges. Jeff Baxter February 2013

CS 640 Introduction to Computer Networks. Today s lecture. What is P2P? Lecture30. Peer to peer applications

CS 3516: Advanced Computer Networks

Embedded Technosolutions

HADP Talk BlueDBM: An appliance for Big Data Analytics

Peer-to-Peer Networks

Distributed Systems 16. Distributed File Systems II

Peer-to-peer computing research a fad?

P2P Applications. Reti di Elaboratori Corso di Laurea in Informatica Università degli Studi di Roma La Sapienza Canale A-L Prof.ssa Chiara Petrioli

HPC Architectures. Types of resource currently in use

Last Time. CSE 486/586 Distributed Systems Distributed Hash Tables. What We Want. Today s Question. What We Want. What We Don t Want C 1

ABySS Performance Benchmark and Profiling. May 2010

Analytics in the cloud

C 1. Last Time. CSE 486/586 Distributed Systems Distributed Hash Tables. Today s Question. What We Want. What We Want. What We Don t Want

P2P Computing. Nobuo Kawaguchi. Graduate School of Engineering Nagoya University. In this lecture series. Wireless Location Technologies

Peer to Peer Systems and Probabilistic Protocols

Decentralized Distributed Storage System for Big Data

Quobyte The Data Center File System QUOBYTE INC.

Data Clustering on the Parallel Hadoop MapReduce Model. Dimitrios Verraros

Topics. Big Data Analytics What is and Why Hadoop? Comparison to other technologies Hadoop architecture Hadoop ecosystem Hadoop usage examples

Last Lecture SMTP. SUNY at Buffalo; CSE 489/589 Modern Networking Concepts; Fall 2010; Instructor: Hung Q. Ngo 1

Intel Enterprise Edition Lustre (IEEL-2.3) [DNE-1 enabled] on Dell MD Storage

Computing over the Internet: Beyond Embarrassingly Parallel Applications. BOINC Workshop 09. Fernando Costa

Peer-to-Peer Applications Reading: 9.4

GFS: The Google File System. Dr. Yingwu Zhu

TITLE: PRE-REQUISITE THEORY. 1. Introduction to Hadoop. 2. Cluster. Implement sort algorithm and run it using HADOOP

The Analysis Research of Hierarchical Storage System Based on Hadoop Framework Yan LIU 1, a, Tianjian ZHENG 1, Mingjiang LI 1, Jinpeng YUAN 1

Advanced Computer Networks

Cloud Computing CS

BlueDBM: An Appliance for Big Data Analytics*

Isilon: Raising The Bar On Performance & Archive Use Cases. John Har Solutions Product Manager Unstructured Data Storage Team

Massively Scalable File Storage. Philippe Nicolas, KerStor

Peer-to-peer. T Applications and Services in Internet, Fall Jukka K. Nurminen. 1 V1-Filename.ppt / / Jukka K.

Hadoop/MapReduce Computing Paradigm

Write a technical report Present your results Write a workshop/conference paper (optional) Could be a real system, simulation and/or theoretical

LS-DYNA Best-Practices: Networking, MPI and Parallel File System Effect on LS-DYNA Performance

Chapter 2 Parallel Hardware

Distributed Filesystem

CA485 Ray Walshe Google File System

Cray XC Scalability and the Aries Network Tony Ford

The Google File System. Alexandru Costan

Architectures for Distributed Systems

No Tradeoff Low Latency + High Efficiency

Motivation for peer-to-peer

Handling Churn in a DHT

DISTRIBUTED COMPUTER SYSTEMS ARCHITECTURES

Venugopal Ramasubramanian Emin Gün Sirer SIGCOMM 04

SSDs that Think. Noam Mizrahi Vice President, Technology and Architecture CTO Office, Marvell

Advanced Data Management Technologies

New Fresh Storage Approach for New IT Challenges Laurent Denel Philippe Nicolas OpenIO

Integrated hardware-software solution developed on ARM architecture. CS3 Conference Krakow, January 30th 2018

The Fusion Distributed File System

Highly Scalable, Non-RDMA NVMe Fabric. Bob Hansen,, VP System Architecture

Overlay networks. To do. Overlay networks. P2P evolution DHTs in general, Chord and Kademlia. Turtles all the way down. q q q

Modeling and Optimization of Resource Allocation in Cloud

Evolving To The Big Data Warehouse

CS60021: Scalable Data Mining. Sourangshu Bhattacharya

Lustre overview and roadmap to Exascale computing

Peer-to-Peer Systems. Chapter General Characteristics

Big Data and Object Storage

the Edge. Vinod Eswaraprasad Wipro Technologies Storage Developer Conference. Insert Your Company Name. All Rights Reserved.

Introduction to Distributed Data Systems

Today. Why might P2P be a win? What is a Peer-to-Peer (P2P) system? Peer-to-Peer Systems and Distributed Hash Tables

MOHA: Many-Task Computing Framework on Hadoop

CPSC 426/526. P2P Lookup Service. Ennan Zhai. Computer Science Department Yale University

Fusion iomemory PCIe Solutions from SanDisk and Sqrll make Accumulo Hypersonic

ENERGY-EFFICIENT VISUALIZATION PIPELINES A CASE STUDY IN CLIMATE SIMULATION

CSE 486/586 Distributed Systems Peer-to-Peer Architectures

Store Process Analyze Collaborate Archive Cloud The HPC Storage Leader Invent Discover Compete

Filtering of Peer-to-peer traffic. Martin Gejke

6. Peer-to-peer (P2P) networks I.

Peer-to-Peer Protocols and Systems. TA: David Murray Spring /19/2006

CLOUD-SCALE FILE SYSTEMS

Adapted from: TRENDS AND ATTRIBUTES OF HORIZONTAL AND VERTICAL COMPUTING ARCHITECTURES

Slides for Chapter 10: Peer-to-Peer Systems

1(11) Peer to peer networking

An Overview of Fujitsu s Lustre Based File System

IME (Infinite Memory Engine) Extreme Application Acceleration & Highly Efficient I/O Provisioning

GFS: The Google File System

BitTorrent and CoolStreaming

Peer-to-Peer Internet Applications: A Review

Transcription:

> 2014 HPC Advisory Council Brazil Conference Big Compute, Big Net & Big Data: How to be big Luiz Monnerat PETROBRAS 26/05/2014

> Agenda Big Compute (HPC) Commodity HW, free software, parallel processing, scalability, etc. Big Net (Internet) What can we learn? How to be big???? Big Data How to be even bigger?

> Big Compute High Performance Computing (HPC) or Supercomputing... powerful machines to solve very complex numerical problems. Complex numerical problems examples Seismic processing, climate, research, etc. Powerful machines examples Tianhe-2 (China): The biggest supercomputer in the world grifo04 (Petrobras): The biggest supercomputer in Latin America

> grifo04 (2010) - 17 racks - 544 nodes - 1088 GPUs - 40TB RAM Biggest supercomputer in Latin America

> bwr1: 1300 CPUs (2004)

> How to be Big Compute... Commodity Hardware & Free Software Inside the Data Center!!!! Parallel Processing Many computing units. Heterogeneous/Accelerated Processing Many more computing units. Scalability Ability to provide more performance as you add more resources

> bw1 (1999) bw1: the second Petrobras Linux commodity cluster example of early use of commodity hardware & software in DC

> How to be Big Compute... Commodity Hardware & Free Software Inside the Data Center!!!! Parallel Processing Many computing units. Heterogeneous/Accelerated Processing Many more computing units. Scalability Ability to provide more performance as you add more resources

> Scalability For decades the HPC community has been working in several scalability issues Load balancing Communication Synchronization etc. but it has been quite tied to the Client/Server (& master/slave) models Client/server architectures have intrinsic scalability issues

> Agenda Big Compute (HPC) Commodity HW+free SW in the DC, parallel proc., scalability, etc. Big Net (Internet) P2P Big Data How to be even bigger?

> Big Net Internet World wide network of computers... and things! Systems with millions of users and devices Client/Server model: Tens of thousands servers Systems with unpredictable demands Client/Server model: How to size the server farm? Systems with fluctuations in demand Client/Server model: Server farm must address peak demand. Client/server model: Very very high cost Difficult to size Difficult to address fluctuations in demands (e.g., flash crowds) Scalability is critical

> How to be Big Net... P2P!!!! peer-to-peer Skype, Napster, KaZaA, emule, BitTorrent, etc. Distributed systems architecture in which all participants perform the same functions (peers) and freely communicate among themselves Each peer acts both as client and server No dedicated server. All clients act also as servers. Highly and intrinsically scalable!!!!!! If you add one more client, you are also adding one more server If you add one million clients, you are also adding one millions servers Allow the system to stay balanced as it grows But distributing the server load may not be easy. Able to automatically adjust to fluctuations in demand. Much more scalable than client/server solutions

> P2P Scalability Phone network

> Agenda Big Compute (HPC) Commodity HW+free software in the DC, parallel proc., scalability, etc. Big Net (Internet) P2P Big Data P2P in the DC How to be even bigger?

> Big Data En vogue... several definitions... Big volumes of unstructured data Data Mining Analytics 3 V s : Volume, Velocity, Variety 5 V s : Volume, Velocity, Variety, Value, Veracity 6 V s, 7 V s... The Volume and Velocity demands of Big Data environments challenge the traditional and client/server filesystems (including scalable parallel filesystems such as Lustre).

> How to be Big Data... P2P inside de Data Center! P2P filesystem Google FS Hadoop FS (HDFS) Based on Google FS Hybrid P2P There are already other interesting P2P applications e.g, SystemImager

> Pure and Hybrid P2P systems Several P2P systems use Client/Server solutions to store and manage metadata Metadata is harder to manage in a P2P way Metadata volume & performance demands are usually much smaller Hybrid P2P systems e.g., Napster, Hadoop FS, etc. Pure P2P systems e.g., KAD/eMule, BitTorrent More scalable Typically use Distributed Hash Tables (DHTs) to store metadata

> Agenda Big Compute (HPC) Commodity HW+free software in the DC, parallel proc., scalability, etc. Big Net (Internet) P2P Big Data P2P inside the DC How to be even bigger? DHT : Distributed Hash Tables

> DHTs Distributed (& P2P) data structures Like normal hash tables, DHTs are typically used to store metadata The (meta)data is distributed among the peers according to a hash function (e.g., SHA1) DHTs are typically used as P2P directories Metadata stored in a DHT is located through lookup requests But locating metadata (solving lookups) in a highly distributed DHT is not an easy task... and it is a key issue in DHTs.

> Solving Lookups in DHTs First DHTs solved lookups recursively Introduced in the beginning of this century (e.g. Kademlia/Kad) Each lookup generates several smaller lookups (or hops) Multi-hop DHTs In a Multi-hop DHT, each lookup may require dozens of hops Very high latency, but ok for many Internet applications Not OK for Big Compute, Big Data and other Data Center apps More recently, Single-hop DHTs were introduced Low latency P2P directories

> Single Hop DHTs OneHop (MIT, Gupta et al, 2004) High levels of load imbalance High bandwidth overheads 1h-Calot (IBM+Rochester, Tang et al, 2005) Good load balance Higher bandwidth overheads D1HT (Petrobras+UFRJ, Monnerat e Amorim, 2005) Distributed One Hop Hash Table Good load balance Low bandwidth overheads

> D1HT Low latency: As required by HPC & Big Data applications Low bandwidth overhead: As required by Internet applications D1HT: A general purpose DHT Source code available for download (GPLv2) Best HPC Brazilian PhD Thesis (2010)

> Conclusions Knowledge and experience acquired in HPC, Internet and Big Data environments are important in designing and building big systems Hybrid P2P systems are more scalable than Client/Server solutions, and allow low cost implementation of large scale systems Even bigger systems may require pure P2P implementations with the use of DHTs Most DHTs have high latency and/or high load imbalance and/or high bandwidth overhead D1HT is able to combine high scalability with low bandwidth overheads, good load balance and low latency, and so it can be used both in Internet and Data Center applications

> Thank you! http://br.linkedin.com/in/luizmonnerat You may get D1HT! http://www.cos.ufrj.br/~monnerat