PRIORITY-CONTROLLED SCHEDULING ALGORITHM
In real-world applications, different tasks require different response times. For example, in an application that controls
a motor, a keyboard, and a display, the motor usually requires faster reaction time than the keyboard and display. While
the display is being updated, the motor needs to be controlled. This makes preemptive multitasking a must. Roundrobin might work, but because it cannot guarantee a specific reaction time, an improved algorithm should be used.
In priority-controlled scheduling, every task is assigned a priority. The order of execution depends on this priority. The
rule is very simple:
No comments:
Post a Comment