Which of the following is a dynamic priority scheduler?*Earliest deadline firstRate monotonicNone of theseRound robin

Identifying the Dynamic Priority Scheduler

1. Understanding Scheduling Algorithms:

   • Scheduling algorithms manage the execution order of processes in an operating system.
   • They can be categorized into static (fixed priority) and dynamic (priority can change) types.

2. Analyzing Each Option:

   • Earliest Deadline First (EDF): A dynamic priority scheduling algorithm where the task with the nearest deadline gets the highest priority.
   • Rate Monotonic (RM): A static priority scheduling algorithm where priority is assigned based on the periodic task’s frequency; higher frequency results in higher priority.
   • None of these: Implies that none of the given options is a dynamic scheduler.
   • Round Robin (RR): A pre-emptive scheduling method that is not based on task priorities.

3. Determining the Answer:

   • Among the listed options, Earliest Deadline First (EDF) stands out as a dynamic priority scheduler since it adjusts priorities based on the deadlines of the tasks.

Final Answer

Earliest Deadline First is a dynamic priority scheduler.