Opening Digital Design and Computer Architecture: Problem Solving III (ETH Zürich, Lecture 28)
Digital Design and Computer Architecture: Problem Solving III (ETH Zürich, Lecture 28)
- Length
- 2 h 51 min
- Level
- Undergraduate
- Recorded
- ETH Zürich2025
Chapter 1 of 10: Branch prediction analysis
Traces branch predictors, systolic arrays, SIMD utilization, vector latencies, and cache associativity through problems.
Digital Design and Computer Architecture at ETH Zürich uses undergraduate problems to analyze branch prediction, SIMD execution, and caches. Mutlu compares local and global branch correlations, bounds SIMD utilization in divergent warps, and infers cache sizes from latency data.
Digital Design and Computer Architecture at ETH Zürich uses undergraduate problems to analyze branch prediction, SIMD execution, and caches. Mutlu compares local and global branch correlations, bounds SIMD utilization in divergent warps, and infers cache sizes from latency data.

This lecture
Lecture 32 of 35 of Digital Design and Computer Architecture.
Choose a node to see how it connects to this lecture. What comes before is on the leftat the top. What comes after is on the rightat the bottom. The ring is what it teaches. People and places are above. Other lectures and books are below.
Press a chosen node again to open it.
Your comment is kept while you sign up.Sign in