Distributed Computing with Spark (Tính toán phân tán với Spark) - Reza Zadeh
Tài liệu giới thiệu về tính toán phân tán sử dụng Apache Spark, so sánh mô hình luồng dữ liệu với lập trình mạng truyền thống, hạn chế của MapReduce và kiến trúc RDD của Spark.
Vorschau wird generiert...
Distributed Computing with Spark Reza Zadeh Thanks to Matei Zaharia Problem Data growing faster than processing speeds Only solution is to parallelize on large clusters » Wide use in both enterprises and web industry How do we program these things? Outline Data flow vs. traditional network programming Limitations of MapReduce Spark computing engine Machine Learning Example Current State of Spark Ecosystem Built-in Libraries Data flow vs. traditional network programming Traditional Network Programming Message-passing between nodes (e.g. MPI) Very difficult to do at scale: » How to split problem across nodes? Must consider network & data locality » How to deal with failures? (inevitable at scale) » Even worse: stragglers (node not failed, but slow) » Ethernet networking not fast » Have to write programs for each machine Rarely used in commodity datacenters Data Flow Models Restrict the programming interface so that the system can do more automatically Express jobs as graphs of high-level operators » System picks how to split each operator into tasks and where to run each task » Run parts twice fault recovery Map Biggest example: MapReduce Reduce Map Map Reduce Example MapReduce Algorithms Matrix-vector multiplication Power iteration (e.g. PageRank) Gradient descent methods Stochastic SVD Tall skinny QR Many others! Why Use a Data Flow Engine? Ease of programming » High-level functions instead of message passing Wide deployment » More common than MPI, especially “near” data Scalability to very largest clusters » Even HPC world is now concerned about resilience Examples: Pig, Hive, Scalding, Storm Limitations of MapReduce Limitations of MapReduce MapReduce is great at one-pass computation, but inefficient for multi-pass algorithms No efficient primitives for data sharing » State between steps goes to distributed file system » Slow due to replication & disk storage Example: Iterative Apps file system" read file system" write file system" re
… Laden Sie die Originaldatei herunter, um das vollständige Dokument zu lesen.
- Dokumentenname
- Distributed Computing with Spark (Tính toán phân tán với Spark) - Reza Zadeh
- Schule / Kurs
- Stanford University · Big Data
- Inhalt
- Tài liệu giới thiệu điện toán phân tán và Spark như một giải pháp cho vấn đề dữ liệu lớn. Nó phân tích hạn chế của MapReduce và trình bày kiến trúc Spark với RDDs, cách xử lý lỗi và các API hỗ trợ.
- Inhaltsverzeichnis
- Problem
- Outline
- Data flow vs. traditional network programming
- Traditional Network Programming
- Data Flow Models
- Example MapReduce Algorithms
- Why Use a Data Flow Engine?
- Limitations of MapReduce
- Example: Iterative Apps
- Example: PageRank
- Result
- Spark computing engine
- Spark Computing Engine
- Resilient Distributed Datasets (RDDs)
- Key Idea
- Python, Java, Scala, R
- Fault Tolerance
- Seiten
- 47 Seiten
- Hochgeladen von
- Uni24h
Häufig gestellte Fragen
Ist dieses Dokument kostenlos?
Ja. „Distributed Computing with Spark (Tính toán phân tán với Spark) - Reza Zadeh“ ist kostenlos — melden Sie sich einfach an und klicken Sie auf Herunterladen, um die Originaldatei zu erhalten.
Wie viele Seiten hat dieses Dokument?
Das Dokument hat 47 Seiten, für den Kurs Big Data. Sie können es vor dem Herunterladen online in der Vorschau ansehen.
Kann ich vor dem Herunterladen eine Vorschau ansehen?
Ja. Sie können sich dieses Dokument direkt auf dieser Seite im Online-Reader ansehen und dann entscheiden, ob Sie es herunterladen möchten.

Kommentare (0)
Noch keine Kommentare. Seien Sie der Erste!