In round-robin scheduling, a) the time quantum should be larger than the context switch time. b) the time quantum should be as smaller than the the context switch time. c) the time quantum should be equal to 200 ms divided by the number of precess waiting. d) the time quantum should be as small as possible

Question

Jingles

Computers & Technology

30 June, 10:07

In round-robin scheduling, a) the time quantum should be larger than the context switch time. b) the time quantum should be as smaller than the the context switch time. c) the time quantum should be equal to 200 ms divided by the number of precess waiting. d) the time quantum should be as small as possible

+4

Answers (1)

Know the Answer?

Babbles · Answer 1

Answer: d. the time quantum should be as small as possible.

Explanation: Round robin is a CPU scheduling algorithm. If the time quantum is extremely small, number of context switches is very high, round robin scheduling will be same as processor sharing algorithm. Then the algorithm is good. Very large time quantum will make response time of processes too much which may not be tolerated in interactive environment.