Communication-Avoiding Algorithms and Fast Matrix Multiplication

About this video

Advanced · Hand-picked by a BrighterTube curator · found via round-3 back catalogue of a channel Lumen picks video by video · 82% confidence

Explains communication-avoiding algorithms for fast matrix multiplication in distributed computing. Teaches algorithm design with communication complexity.

A 61-minute video from Microsoft Research: “Communication-Avoiding Algorithms and Fast Matrix Multiplication”.

Video by Microsoft Research, played through YouTube's embedded player.