YoVDO

Graph Algorithms in the Massively Parallel Computation Model

Offered By: Simons Institute via YouTube

Tags

Theoretical Computer Science Courses Algorithm Design Courses Graph Algorithms Courses MapReduce Courses Parallel Computing Courses Distributed Computing Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore graph algorithms in the Massively Parallel Computation (MPC) model through this 1-hour 5-minute lecture by Slobodan Mitrovic from UC Davis. Delve into the theoretical abstraction of popular large-scale computation frameworks like MapReduce, Flume, Hadoop, and Spark. Examine the relationship between MPC and other distributed/parallel models, and learn techniques for designing efficient MPC algorithms in the near-linear memory regime. Gain insights into addressing scientific questions prompted by the rapid increase in data size and volume, with a focus on leveraging MPC capabilities for fast algorithm design.

Syllabus

Graph Algorithms in the MPC Model


Taught by

Simons Institute

Related Courses

Intro to Algorithms
Udacity
Algorithmic Thinking (Part 1)
Rice University via Coursera
Design and Analysis of Algorithms
Chennai Mathematical Institute via Swayam
Capstone: Analyzing (Social) Network Data
University of California, San Diego via Coursera
Algorithms on Graphs
University of California, San Diego via Coursera