Question: 3: We considered several priority-driven scheduling algorithms. It was noted that these algorithms make locally optimal decisions about which job to run, but the resulting
3: We considered several priority-driven scheduling algorithms. It was noted that these algorithms make locally optimal decisions about which job to run, but the resulting schedules are often not globally optimal. Explain the difference between locally and globally optimal, and discuss why priority-driven scheduling algorithms typically do not produce globally optimal schedules.
4. It was noted that priority-driven scheduling is difficult to validate, since scheduling anoma- lies can occur. Explain what is a scheduling anomaly, and outline a situation when one might occur
5: : Briefly describe what is a real time system, and outline the difference between hard and soft real time systems. With the aid of an example, discuss whether the distinction between hard and soft real time systems is always clear cut
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
