Preemption

As explained in Elixir in Action, Third Edition

Preemptive scheduling is a scheduling method that interrupts running processes to switch execution to other runnable processes.

Preemption gives each runnable Erlang process a small execution window, then pauses it so a scheduler can run another process. Frequent context switches prevent one long-running process from blocking the rest of the system and favor predictable responsiveness. section 1.1.2 section 1.3.1

In a BEAM system, preemption supports several production behaviors:

• Long-running processes cannot significantly block other processes. section 1.1.2
• As load rises, requests may take longer, but the system can degrade gracefully instead of becoming paralyzed. section 1.3.1
• Preemption improves responsiveness but does not make intensive CPU computation as performant as equivalent C or C++ code. section 1.3.1

Figure 1.1 Concurrency in the Erlang virtual machine

Use the virtual-machine diagram to connect schedulers, concurrent processes, and system responsiveness. section 1.1.2

How Elixir in Action, Third Edition covers it

How deep it goes

Explains execution windows, pauses, context switches, and load behavior without detailing scheduler implementation internals.

Examples

Illustrates long-running processes, waiting I/O operations, rising request load, and the Erlang virtual machine.

What you can do after

Evaluate/understand how BEAM scheduling limits blocking and shapes performance under increasing load.

How it connects

Connects concurrency with schedulers, responsiveness, fault tolerance, distribution, I/O operations, and graceful degradation.

liveBookmanning.com

Read Elixir in Action, Third Edition on liveBook Get the book at manning.com

Also explained in

• 

  liveBookmanning.com
  Grokking ConcurrencyPreemptive multitasking is an operating-system technique in which the system can suspend a running task without requiring its cooperation and schedule another task.
• 

  liveBookmanning.com
  Kubernetes for DevelopersPreemption is the proactive removal of lower-priority Pods to make resources available for higher-priority Pods.
• 

  liveBookmanning.com
  100 Go Mistakes and How to Avoid ThemPreemptive scheduling is a scheduling model in which the scheduler can interrupt an executing task and replace it with another task.
• 

  liveBookmanning.com
  Python Concurrency with asyncioPreemptive multitasking is a scheduling technique in which the system forcibly pauses running tasks according to its scheduling policy.

Compare how 5 books explain preemption →

Related concepts

• cooperative multitaskingcontrasts with · Cooperative multitasking is a scheduling technique in which executing tasks voluntarily yield control at defined points so other tasks can run.
• scheduleruses · A scheduler is a system component that selects, orders, dispatches, or assigns execution resources to tasks according to timing, dependency, placement, or other scheduling criteria.
• multitaskingkind of · Multitasking is the concurrent or apparently concurrent management of multiple tasks by sharing, interleaving, or switching among execution resources.
• priority-based schedulingused by · Priority-based scheduling is a policy that selects or orders eligible work for execution according to assigned relative priorities.

This explainer was generated by Manning's knowledge graph from the text of Elixir in Action, Third Edition. The section links point to the parts of the book it draws on.