Algorithms + Data Structures = Programs

Episode 131: One Algorithm To Rule Them All!

May 26, 2023
Ask episode
Chapters
Transcript
Episode notes
1
Introduction
00:00 • 2min
2
How to Short Circuit a Sequence
02:02 • 3min
3
The Most Basic Work
04:58 • 2min
4
The Importance of Separating Predicates in the API
06:43 • 2min
5
The Trade-Offs Between Reduce and Scan
09:08 • 2min
6
How to Reduce Short-Circuiting Algorithms
11:09 • 2min
7
The Problems With Short-Circuiting in Parallel Computing
12:43 • 3min
8
The Importance of Parallelism in Engineering
16:05 • 2min
9
The Importance of Vectorization in Parallel Processing
17:46 • 2min
10
The Importance of Cash in Machine Sympathy
19:37 • 2min
11
The Spread of Memory Latency and Cash Latency
21:34 • 2min
12
C++ 20: The Future of Processing
23:27 • 2min
13
The Different Types of Scaffolds and Folds
25:26 • 2min
14
The Shape of a Scan and a Reduction
26:57 • 2min
15
The Different Sides of the Same Coin
28:40 • 2min
16
How to Express Scans and Reductions Mathematically
30:34 • 2min
17
Unfolds: A Generalized Data Structure Transformation
32:53 • 2min
18
Iota: A Bad Name?
34:41 • 1min
19
How to Fix a Guinea Pig
36:11 • 2min
20
How to Define a Linear Traversal
37:54 • 2min
21
Tristan Ben: The Best Meetup in North America
39:25 • 2min
22
The Future of Algorithms
41:04 • 2min