Log In
1 vote
Ques: Can Round Robin algorithm be non-preemptive ?

My answer: RR with largest Burst Time as Time Quantum is FCFS in nature and its non-preemptive

Am I right ? Please corret me if am wrong.
in Operating System 114 views
Seems valid to me too
Yes it will, we can say that RR will have preemptive nature
Its inherent nature will still be preemptive. Just the fact that no other process is longer than its quantum can not make it non-preemptive, though it won't get chance to preempt any process.

1 Answer

1 vote
If tq= q, where q is very large, but at the same time, first process happens to be of burst =q+1, then just for 1 unit time it would get preempted making the algorithm preemptive.

reshown by

Related questions

2 votes
0 answers
Consider a system having $10$ IO bound jobs and $1$ CPU bound job.. If IO bound job issue an IO request once for every ms of CPU computation and that each IO request takes $10$ ms. If context switch overhead is $0.1$ ms.Using round -robin scheduling with a time quantum of $10$ ms. , the CPU efficiency is __________________
asked Mar 11, 2019 in Operating System srestha 246 views
1 vote
2 answers
Jobs keep arriving at a processor. A job can have an associated time length as well as a priority tag. New jobs may arrive while some earlier jobs are running. Some jobs may keep running indefinitely. A ... the following job-scheduling policies is starvation free? Round - robin Shortest job first Priority queuing Latest job first None of the others
asked Feb 11 in Operating System Lakshman Patel RJIT 150 views