YoVDO

Parallel Reachability in Almost Linear Work and Square Root Depth

Offered By: IEEE via YouTube

Tags

IEEE FOCS: Foundations of Computer Science Courses Distributed Systems Courses Algorithm Design Courses Algorithm Analysis Courses Parallel Computing Courses Recursion Courses Generalization Courses

Course Description

Overview

Explore a cutting-edge algorithm for parallel reachability in graph theory presented in this 22-minute IEEE conference talk. Delve into the intricacies of solving the reachability problem using parallel breadth-first search (BFS) techniques. Gain insights into distributed reachability and previous results in the field. Examine the proof and analysis of Fineman's algorithm, and discover how to improve its performance. Understand key observations, recursion methods, and generalizations that contribute to the algorithm's efficiency. Learn about an innovative approach that achieves almost linear work and square root depth, potentially revolutionizing graph traversal in parallel computing environments.

Syllabus

Introduction
Reachability Problem
Parallel BFS
Intuition
Algorithm
Distributed Reachability
Previous Results
Proof
Finemans Algorithm
Analysis
Improve Can Action
Analyzing the Algorithm
Observations
Recursion
Generalization
Conclusions


Taught by

IEEE FOCS: Foundations of Computer Science

Tags

Related Courses

An Improved Exponential-Time Approximation Algorithm for Fully-Alternating Games Against Nature
IEEE via YouTube Computation in the Brain Tutorial - Part 2
IEEE via YouTube Computation in the Brain - Part 1
IEEE via YouTube Spectral Independence in High-Dimensional Expanders and Applications to the Hardcore Model
IEEE via YouTube Cookbook Lower Bounds for Statistical Inference in Distributed and Constrained Settings - Part 1
IEEE via YouTube