Question

There are several different algorithms for scheduling periodic tasks on a uniprocessor system.
Those algorithms fall into two broad categories: clockdriven and priority-driven. Discuss the
relative advantages and disadvantages of the two categories of algorithm, explaining when it
is appropriate to use a clockdriven scheduler and when one would expect to use a priority-driven scheduler.