Sign inSign in
ConceptSystems & CS

Work-stealing scheduler

A scheduler where idle processors steal tasks from the queues of busy processors to maintain load balance.
as Charles Leiserson & Julian Shun defines itMITThe wording closest to all 3 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.

Deques1Greedy scheduling1Multiprocessing1Multithreading1Processor scheduling1Processors1Scheduling1Task parallelism1

Lecturers

2

Each in their own terms, from the easiest level.

  • Charles Leiserson & Julian Shun

    MIT · Undergraduate

  • Simon Peyton Jones

    UC Berkeley · Graduate

    A dynamic scheduling mechanism where idle processors steal tasks from busy processors.

Connections

5

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

Concepts2

Lectures3

2 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.