Главная
Study mode:
on
1
Intro
2
Mind Amdahl's Law
3
Optimizing Rare Cases
4
Today's Computing Architectures
5
Reliable Heuristics
6
Benchmarking Speed
7
Replace Branches with Arithmetic
8
Sense & Sensibility
9
Reduce Dependencies
10
One Induction Variable
11
Get rid of multiplication by 3
12
Enter optional
13
Replace branches with optional
Description:
Explore optimization techniques for modern computing in this conference talk. Delve into two contrasting examples: a silicon-oriented approach replacing branches with arithmetic, and an adjusted classic algorithm considering data distribution statistics and locality. Learn about Amdahl's Law, optimizing rare cases, reliable heuristics, benchmarking speed, and reducing dependencies. Discover how to replace branches with arithmetic, implement one induction variable, and eliminate multiplication by 3. Gain insights into the challenges of increasing computer speed and the importance of optimization in advancing technologies like speech recognition, self-driving cars, and artificial intelligence.

Fastware

NDC Conferences
Add to list
0:00 / 0:00