Sign inSign in
ConceptSystems & CS

Speculative execution

A technique to improve the performance of CPUs where the CPU guesses a branch outcome and starts executing down that path before it knows whether it really should be executing it.
as Frans Kaashoek defines itMITThe wording closest to all 5 definitions
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Branch prediction2Branches2CPU pipelines2Conditional branches1Control hazard1Microprocessor1Parallel programming concepts1Processor pipeline1

Opens up

Concepts that name this one as a prerequisite.

Lecturers

4

Each in their own terms, from the easiest level.

  • Onur Mutlu

    ETH Zürich · Introductory

    An optimization technique where a processor executes instructions before it is certain whether they need to be executed.
    • 1:04:58Digital Design & Computer Architecture: Introduction and Basics
    • 1:04:16Digital Design and Computer Architecture - L1: Intro: Fundamentals, Transistors, Gates
  • Charles Leiserson & Julian Shun

    MIT · Undergraduate

    A technique where the processor guesses the outcome of a branch and executes past it, undoing the computation if the guess turns out to be wrong.
    • 1:15:59Assembly Language & Computer Architecture
  • Kayvon Fatahalian & Kunle Olukotun

    Stanford University · Undergraduate

    Running multiple strategies in parallel and seeing which one wins or completes first.
    • 25:35Parallel Computing: Why Parallelism? Why Efficiency?

Connections

12

The lectures that define it or assume it, and the concepts next to it.

4 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.