Deadline monotonic scheduling
• Another well known fixed-priority algorithm is deadline monotonic
scheduling
• The deadline monotonic algorithm assigns task priority according
to relative deadlines – the shorter the relative deadline, the higher
the priority
• When relative deadline of every task matches its period, then rate
monotonic and deadline monotonic give identical results
• When the relative deadlines are arbitrary:
– Deadline monotonic can sometimes produce a feasible schedule in cases
where rate monotonic cannot
– But, rate monotonic always fails when deadline monotonic fails
• Deadline monotonic preferred to rate monotonic
– If deadline ≠ period
0 comments:
Feel free to contact the admin for any suggestions and help.