Rui's Blog
  • Rui's Blog/Paper Reading Notes - Introduction
  • Personal Blog
    • Personal Blog - Index
      • How to Create Picture-in-Picture Effect / Video Overlay for a Presentation Video
      • How to Do Your Part to Protect the Environment in Wisconsin
      • How to Get a Driver's License in Wisconsin
      • How to Travel from the U.S. to China onboard AA127 in June 2021
      • How to Transfer Credits Back to UW-Madison
      • Resources on Learning Academic Writing (for Computer Science)
    • Towards applying to CS Ph.D. programs
  • Machine Learning Systems
    • Machine Learning Systems - Index
      • MLSys Papers - Short Notes
      • [2011 NSDI] Dominant Resource Fairness: Fair Allocation of Multiple Resource Types
      • [2014 OSDI] Scaling Distributed Machine Learning with the Parameter Server
      • [2018 OSDI] Gandiva: Introspective Cluster Scheduling for Deep Learning
      • [2018 SIGCOMM] Chameleon: Scalable Adaptation of Video Analytics via Temporal and Cross-camera ...
      • [2018 NIPS] Dynamic Space-Time Scheduling for GPU Inference
      • [2019 ATC] Analysis of Large-Scale Multi-Tenant GPU Clusters for DNN Training Workloads
      • [2019 NSDI] Tiresias: A GPU Cluster Manager for Distributed Deep Learning
      • [2019 SOSP] ByteScheduler: A Generic Communication Scheduler for Distributed DNN Training ...
      • [2019 SOSP] PipeDream: Generalized Pipeline Parallelism for DNN Training
      • [2019 SOSP] Parity Models: Erasure-Coded Resilience for Prediction Serving Systems
      • [2019 NIPS] GPipe: Efficient Training of Giant Neural Networks using Pipeline Parallelism
      • [2019 SC] ZeRO: memory optimizations toward training trillion parameter models
      • [2020 OSDI] Gavel: Heterogeneity-Aware Cluster Scheduling Policies for Deep Learning Workloads
      • [2020 OSDI] AntMan: Dynamic Scaling on GPU Clusters for Deep Learning
      • [2020 OSDI] BytePS: A High Performance and Generic Framework for Distributed DNN Training
      • [2020 SIGCOMM] Reducto: On-Camera Filtering for Resource-Efficient Real-Time Video Analytics
        • [2020 MLSys] Salus: Fine-Grained GPU Sharing Primitives for Deep Learning Applications
      • [2020 EuroSys] AlloX: Compute Allocation in Hybrid Clusters
      • [2020 VLDB] PyTorch Distributed: Experiences on Accelerating Data Parallel Training
      • [2020 NetAI] Is Network the Bottleneck of Distributed Training?
      • [2020 NSDI] Themis: Fair and Efficient GPU Cluster Scheduling
      • [2021 MLSys] Accordion: Adaptive Gradient Communication via Critical Learning Regime Identification
      • [2021 VLDB] Analyzing and Mitigating Data Stalls in DNN Training
      • [2021 FAST] CheckFreq: Frequent, Fine-Grained DNN Checkpointing
      • [2021 EuroMLSys] Interference-Aware Scheduling for Inference Serving
      • [2021 OSDI] Pollux: Co-adaptive Cluster Scheduling for Goodput-Optimized Deep Learning
      • [2021 MLSys] Wavelet: Efficient DNN Training with Tick-Tock Scheduling
      • [2021 NSDI] SwitchML: Scaling Distributed Machine Learning with In-Network Aggregation
    • Big Data Systems - Index
      • Big Data Systems Papers - Short Notes
      • [2003 SOSP] The Google File System
      • [2004 OSDI] MapReduce: Simplified Data Processing on Large Clusters
      • [2010 SIGMOD] Pregel: A System for Large-Scale Graph Processing
      • [2011 NSDI] Mesos: A Platform for Fine-Grained Resource Sharing in the Data Center
      • [2012 NSDI] Resilient Distributed Datasets: A Fault-Tolerant Abstraction for In-Memory Cluster ...
      • [2012 OSDI] PowerGraph: Distributed Graph-Parallel Computation on Natural Graphs
      • [2019 FAST] DistCache: Provable Load Balancing for Large-Scale Storage Systems with Distributed...
      • [2021 HotOS] From Cloud Computing to Sky Computing
      • [2021 EuroSys] NextDoor: Accelerating graph sampling for graph machine learning using GPUs
  • Earlier Readings & Notes
    • High Performance Computing Course Notes
      • Lecture 1: Course Overview
      • Lecture 2: From Code to Instructions. The FDX Cycle. Instruction Level Parallelism.
      • Lecture 3: Superscalar architectures. Measuring Computer Performance. Memory Aspects.
      • Lecture 4: The memory hierarchy. Caches.
      • Lecture 5: Caches, wrap up. Virtual Memory.
      • Lecture 6: The Walls to Sequential Computing. Moore’s Law.
      • Lecture 7: Parallel Computing. Flynn's Taxonomy. Amdahl's Law.
      • Lecture 8: GPU Computing Intro. The CUDA Programming Model. CUDA Execution Configuration.
      • Lecture 9: GPU Memory Spaces
      • Lecture 10: GPU Scheduling Issues.
      • Lecture 11: Execution Divergence. Control Flow in CUDA. CUDA Shared Memory Issues.
      • Lecture 12: Global Memory Access Patterns and Implications.
      • Lecture 13: Atomic operations in CUDA. GPU ode optimization rules of thumb.
      • Lecture 14: CUDA Case Studies. (1) 1D Stencil Operation. (2) Vector Reduction in CUDA.
      • Lecture 15: CUDA Case Studies. (3) Parallel Prefix Scan on the GPU. Using Multiple Streams in CUDA.
      • Lecture 16: Streams, and overlapping data copy with execution.
      • Lecture 17: GPU Computing: Advanced Features.
      • Lecture 18: GPU Computing with thrust and cub.
      • Lecture 19: Hardware aspects relevant in multi-core, shared memory parallel computing.
      • Lecture 20: Multi-core Parallel Computing with OpenMP. Parallel Regions.
      • Lecture 21: OpenMP Work Sharing.
      • Lecture 22: OpenMP Work Sharing
      • Lecture 23: OpenMP NUMA Aspects. Caching and OpenMP.
      • Lecture 24: Critical Thinking. Code Optimization Aspects.
      • Lecture 25: Computing with Supercomputers.
      • Lecture 26: MPI Parallel Programming General Introduction. Point-to-Point Communication.
      • Lecture 27: MPI Parallel Programming Point-to-Point communication: Blocking vs. Non-blocking sends.
      • Lecture 28: MPI Parallel Programming: MPI Collectives. Overview of topics covered in the class.
    • Cloud Computing Course Notes
      • 1.1 Introduction to Clouds, MapReduce
      • 1.2 Gossip, Membership, and Grids
      • 1.3 P2P Systems
      • 1.4 Key-Value Stores, Time, and Ordering
      • 1.5 Classical Distributed Algorithms
      • 4.1 Spark, Hortonworks, HDFS, CAP
      • 4.2 Large Scale Data Storage
    • Operating Systems Papers - Index
      • CS 736 @ UW-Madison Fall 2020 Reading List
      • All File Systems Are Not Created Equal: On the Complexity of Crafting Crash-Consistent Applications
      • ARC: A Self-Tuning, Low Overhead Replacement Cache
      • A File is Not a File: Understanding the I/O Behavior of Apple Desktop Applications
      • Biscuit: The benefits and costs of writing a POSIX kernel in a high-level language
      • Data Domain: Avoiding the Disk Bottleneck in the Data Domain Deduplication File System
      • Disco: Running Commodity Operating Systems on Scalable Multiprocessors
      • FFS: A Fast File System for UNIX
      • From WiscKey to Bourbon: A Learned Index for Log-Structured Merge Trees
      • LegoOS: A Disseminated, Distributed OS for Hardware Resource Disaggregation
      • LFS: The Design and Implementation of a Log-Structured File System
      • Lottery Scheduling: Flexible Proportional-Share Resource Management
      • Memory Resource Management in VMware ESX Server
      • Monotasks: Architecting for Performance Clarity in Data Analytics Frameworks
      • NFS: Sun's Network File System
      • OptFS: Optimistic Crash Consistency
      • RAID: A Case for Redundant Arrays of Inexpensive Disks
      • RDP: Row-Diagonal Parity for Double Disk Failure Correction
      • Resource Containers: A New Facility for Resource Management in Server Systems
      • ReVirt: Enabling Intrusion Analysis through Virtual-Machine Logging and Replay
      • Scheduler Activations: Effective Kernel Support for the User-Level Management of Parallelism
      • SnapMirror: File-System-Based Asynchronous Mirroring for Disaster Recovery
      • The Linux Scheduler: a Decade of Wasted Cores
      • The Unwritten Contract of Solid State Drives
      • Venti: A New Approach to Archival Storage
    • Earlier Notes
      • How to read a paper
  • FIXME
    • Template for Paper Reading Notes
Powered by GitBook
On this page
  • Spark
  • Apache Spark
  • Example Spark Applications
  • RDD Fault Tolerance
  • Big Data Distros (Distributions)
  • Hortonworks
  • Cloudera
  • MapR
  • HDFS
  • HDFS
  • YARN and Mesos

Was this helpful?

  1. Earlier Readings & Notes
  2. Cloud Computing Course Notes

4.1 Spark, Hortonworks, HDFS, CAP

Spark

Apache Spark

  • Motivation: Traditional MapReduce & classical parallel runtimes cannot solve iterative algorithms efficiently

    • Hadoop: Repeated data access to HDFS, no optimizations to data caching & data transfers

    • MPI: No natural support for fault tolerance; programming interface is complicated

  • Apache Spark: Extend the MapReduce model to better support two common classes of analytics apps:

    • Iterative algorithms (ML, graphs)

    • Interactive data mining

  • Why are current frameworks not working?

    • Most cluster programming models use acyclic data flow (from stable storage to stable storage)

    • Acyclic data flow is inefficient for apps that repeatedly reuse a working set of data

  • Solution: Resilient Distributed Datasets (RDDs)

    • Advantages

      • Allow apps to keep working sets in memory for efficient reuse

      • Retains the attractive properties of MapReduce (fault tolerance, data locality, scalability)

      • Supports a wide range of applications

    • Properties

      • Immutable, partitioned collections of objects

      • Created through parallel transformations (map, filter, groupBy, join) on data in stable storage

      • Can be cached for efficient reuse

Example Spark Applications

RDD Fault Tolerance

Big Data Distros (Distributions)

Hortonworks

  • Connected data strategy

    • HDP: Apache Hadoop is an open-source framework for distributed storage and processing of large sets of data on commodity hardware. Hadoop enables businesses to quickly gain insight from massive amounts of structured and unstructured data

    • HDF: Real-time data collection, curation, analysis, and delivery of data to and from any device, source or system, either on-premise and in the cloud

  • HDP tools

    • Apache Zeppelin: Open web-based notebook that enables interactive data analytics

    • Apache Ambari: Source management platform for provisioning, managing, monitoring, and securing Apache Hadoop clusters

  • HDP data access

    • YARN: Data Operating System

      • MapReduce: Batch application framework for structured and unstructured data

      • Pig: Script ETL data pipelines, research on raw data, and iterative data processing

      • Hive: Interactive SQL queries over petabytes of data in Hadoop

      • Hbase Accumulo: Non-relational/NoSQL database on top of HDFS

      • Storm (Stream): Distributed real-time large volumes of high-velocity data

      • Solr (Search): Full-text search and near real-time indexing

      • Spark: In-memory

    • Data management: HDFS

  • HDF

    • Apache NiFi, Kafka, and Storm: Provide real-time dataflow management and streaming analytics

Cloudera

MapR

  • Platforms for big data

    • MapReduce (Hadoop written in C/C++)

    • NFS

    • Interactive SQL (Drill, Hive Spark SQL, Impala)

    • MapR-DB

    • Search (Apache Solr)

    • Stream Processing (MapR Streams)

HDFS

HDFS

  • HDFS properties

    • Synergistic w/ Hadoop

    • Massive throughput

    • Throughput scales with attached HDs

    • Have seen very large production clusters (Facebook, Yahoo)

    • Doesn't even pretend to be POSIX compliant

    • Optimized for reads, sequential writes, and appends

  • How can we store data persistently? Ans: Distributed File System replicates files

  • Distributed File System

    • Datanode Servers

      • A file is split into contiguous chunks (16-64MB), each of which is replicated (usually 2x or 3x)

      • Sends heartbeat and BlockReport to namenode

    • Replicas are placed: one on a node in a local rack, one on a different node in the local rack, and one on a node in a different rack (lots of back-ups)

  • Master node (namenode in HDFS) stores metadata, and might be replicated

    • Client libraries for file accesses talk to master to find datanode chunk, and then connect directly to datanode servers to access data

  • Replication pipelining: Data is pipelined from datanode to the next in the background

  • Staging: A client request to create a file does not reach namenode immediately. Instead, HDFS client caches the data into a temporary file -> once the data size reaches a HDFS block size, the client contacts the namenode -> namenode inserts the filename into its hierarchy and allocates a data block for it -> namenode responds to the client with the identity of the datanode and the destinations of the replicas/datanodes for the block -> client flushes from local memory

YARN and Mesos

  • Mesos: Built to be a scalable global resource manager for the entire datacenter

  • YARN: Created out of the necessity to scale Hadoop

  • Project myriad: Composites Mesos and YARN

    • Mesos framework and a YARN scheduler that enables Mesos to manage YARN resource requests

Previous1.5 Classical Distributed AlgorithmsNext4.2 Large Scale Data Storage

Last updated 3 years ago

Was this helpful?

Log mining
Logistic regression
RDDs maintain lineage information that can be used to reconstruct lost partitions
Hortonworks Data Platform (HDP)
Cloudera Enterprise Data Hub (EDH)
HDFS architecture
Mesos architecture
Mesos resource offer mechanism
YARN ResourceManager
The insides of YARN