Which of the Following Algorithm Defines Time Quantum?
By BYJU'S Exam Prep
Updated on: September 13th, 2023
A) Shortest job scheduling algorithm
B) Round robin scheduling algorithm
C) Priority scheduling algorithm
D) Multilevel queue scheduling algorithm
A CPU scheduling mechanism known as a round robin scheduling algorithm defines the time quantum. It assigns each process cyclically through a predetermined time slot. It is the first come, first served CPU Scheduling method in the preemptive mode.
- Circle Robin CPU algorithms frequently emphasize the Time Sharing approach.
- The time frame within which a process can operate in a preventive manner is known as a quantum.
- The CPU is allocated to each job or process in the ready queue for that time quantum. If the process’s execution is finished during that period, the current process will end. Otherwise, it will return to the waiting area and wait for the next turn to finish the execution.
Table of content
Important Points of Round Robin Scheduling Algorithm
Here are a few characteristics of the Round Robin CPU Scheduling Algorithm-
- It is one of the most commonly used techniques for CPU scheduling as a core.
- It is simple to use, easy to implement, and starvation-free, as all processes get a fair share of CPU.
- It is proactive as processes are assigned CPU only for a fixed time slot.
Related Questions
