How to calculate slack time in scheduling algorithms?
Answers
Answered by
0
This scheduling algorithm first selects those processes that have the smallest "slack time". Slack time is defined as the temporal difference between the deadline, the ready time and the run time.
More formally, the slack time {\displaystyle s} for a process is defined as:
{\displaystyle s=(d-t)-c'}
where {\displaystyle d} is the process deadline, {\displaystyle t} is the real time since the cycle start, and {\displaystyle c'} is the remaining computation time.
Similar questions