Theoremadvanced
Optimality of earliest deadline first
Also called EDF optimal on uniprocessors.
On one processor, EDF schedules any feasible preemptive task set.
On one processor, EDF schedules any feasible preemptive task set.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag GWSMKM Edit this page History Report an error