Escolar Documentos
Profissional Documentos
Cultura Documentos
Periodic tasks
C: computing time
Arrival time
F: finishing/response time
time
T:period
D: deadline
Scheduled to run
Arrival time
Finishing/response time
computing
time
T:period
R: release time
D: deadline
CPU utilization
A task = (C, T)
U>1 (overload): some task will fail to meet its deadline no matter
what algorithms you use!
U<=1: it will depend on the scheduling algorithms
If U=1 and the CPU is kept busy (non idle algorithms e.g. EDF), all
deadlines will be met