The Runtime Theory
medium · 3h · 9 steps

Computer Architecture: Pipelines and Memory

Connect instruction dependencies, branch behavior, and cache locality to the performance of real algorithms.

Curriculum (9 steps)

1

A processor pipeline overlaps stages of multiple instructions, much like an assembly line.

Start→
2

Follow the key state changes and boundary checks involved in instruction pipelines and dependency hazards.

Start→
3

Branches make program control depend on data.

Start→
4

An interactive concept flow for branch prediction and exposing parallel work, from its assumptions through the main operation and boundary checks.

Start→
5

Processors use a hierarchy of storage because small, nearby storage can be accessed faster than large, distant storage.

Start→
6

Follow the key state changes and boundary checks involved in why memory locality matters.

Start→
7

An interactive concept flow for why memory locality matters, from its assumptions through the main operation and boundary checks.

Start→
8

Compare row-wise and column-wise matrix traversal and connect address order to cache-line reuse and measured misses.

Start→
9

Explain the model, execution steps, complexity, and limits of why memory locality matters.

Start→