Graph Algorithms in the Massively Parallel Computation Model

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.