Priority Based Scheduling of Soft Real Time Systems

Q1. Explain Priority Based Scheduling of Soft Real Time Systems.

Ans. The most important feature of a real-time operating system is to respond immediately to a real time process as soon as that process requires the CPU. As a result, the scheduler for a result, the scheduler for a real time operating system must support a priority based algorithm with preemption. Priority based scheduling algorithms assign each process a priority based on its importance; more important tasks are assigned higher priorities than those deemed less important. If the scheduler also supports preemption, a process currently running on the CPU will be preempted if a higher priority process becomes available to run.

So there should be code for priority scheduling algorithm and particular process should not process continue.

Leave a Reply

Your email address will not be published. Required fields are marked *

%d bloggers like this: