The Gateway to Computer Science Excellence
+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 by (11 points) | 72 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.
by (123 points)
reshown by

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,741 questions
57,251 answers
104,685 users