liveBook · Manning

Scheduler

As explained in Robotics for Programmers

A scheduler is software that determines which tasks execute and when they execute.

A scheduler determines which tasks execute and when. In embedded real-time systems, it works with task priorities and preemption to help computations finish before their deadlines. section 3.5

Priority-based preemption

A higher-priority real-time task can pause a running lower-priority task, execute temporarily, and allow both tasks to meet their deadlines. section 3.5

Figure 3.14 Preemptive scheduling ensures temporal correctness by allowing a higher-priority real-time task to pause and temporarily replace a running lower-priority task, ensuring both tasks meet their execution deadlines.
CH03 Fxx bihlmaier task scheduling

Visualizes how preemptive scheduling replaces a lower-priority task with a higher-priority task to preserve temporal correctness. section 3.5

How Robotics for Programmers covers it

How deep it goes
Explains priorities and preemption, while deferring detailed scheduler implementation and timing analysis.
Examples
Uses a higher-priority task interrupting a lower-priority task as its concrete scheduling example.
What you can do after
Evaluate how task priorities and preemption support temporal correctness in embedded real-time systems.
How it connects
Connects scheduling with worst-case execution time, task priorities, preemption, synchronization, inter-process communication, interrupts, and timers.

Also explained in

Compare how 13 books explain scheduler →

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Robotics for Programmers. The section links point to the parts of the book it draws on.