MENTAL MODEL · M10328

Earliest Deadline First

SystemsHigh supportSystems Theory

Included

Updated 2026-08-13

Loading revision record…

INTRODUCTION

English translation pending.

CORE DEFINITION

Earliest Deadline First (EDF) is a real-time scheduling strategy that dynamically assigns the highest priority to the ready task with the closest deadline. For single-processor systems, when tasks are schedulable, EDF is the optimal dynamic scheduling algorithm. Related ideas include the earliest due date rule, a synonym, longest processing time first, the opposite policy, and minimum slack time, which factors in remaining execution time.

SCAFFOLDING EFFECT

psychology

Reduce cognitive load

- Let urgency set priority: rank ready tasks by deadline so the most urgent one runs first. - Re-rank dynamically: re-check the full deadline list whenever a new task arrives. - Survive overload: when capacity is exceeded, protect near-deadline tasks and defer low-priority ones.

anchor

Anchor fast decisions

EDF dynamically gives the highest priority to whichever ready task has the nearest deadline. Because urgency, not static importance, drives sequencing, the processor always works on whatever is closest to missing its target, which is provably optimal for schedulable single-processor task sets.

MINIMUM ACTION

In progress 0/1

Practice this model in one real situation:

List every task with its deadline and remaining work. 2. Sort tasks by earliest deadline and execute the first one. 3. Re-sort whenever a new task arrives or finishes. 4. Under overload, keep near-deadline tasks and defer the low-priority ones.

Check to track your progress (stored locally)

Learning progress0%

account_treeGenealogyexpand_more

menu_bookReferencesexpand_more

Source support: Explicit

link
en.wikipedia.orghttps://en.wikipedia.org/wiki/Earliest_deadline_first_schedulingZH · Explicit
verified

RELATED MODELS