Register

Self doubt

399 views
0 votes
0 votes
In round robin scheduling, which process gets the chance first if a process comes to ready state from running(i.e time quantom getting over) and another from new to ready(i.e due to same arrival time) ? Is there a convention or will it be specified in the question?
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
1 answer
2
Syedarshadali asked Oct 22, 2017
430 views
Self doubt
If inefficiency of scheduling algorithm is $\frac{Burst Time wasted}{Total Burst Time} X 100$ Why do we have to multiply with 100?
If inefficiency of scheduling algorithm is $\frac{Burst Time wasted}{Total Burst Time} X 100$Why do we have to multiply with 100?
User Avatar
1 votes
1 votes
1 answer
3
jayadev asked Oct 10, 2021
1,286 views
#self doubt #round robin #cpu scheduling
in round robin algorithm if a process with burst time = 10 arrived at t=0 and time quantum is 2 units, context switch time is 2 units . Then completion time of the process will be?
in round robin algorithm if a process with burst time = 10 arrived at t=0 and time quantum is 2 units, context switch time is 2 units . Then completion time of the proces...
User Avatar
1 votes
1 votes
1 answer
4
sanyam53 asked Jan 7, 2017
1,684 views
Doubt OS - Round Robin- Context Switch
How many time context switch in Round Robin? ( if only one process remain in ready queue at end of scheduling does that count every time, when time slice over or only one time?)
How many time context switch in Round Robin? ( if only one process remain in ready queue at end of scheduling does that count every time, when time slice over or only one...
User Avatar
Link Copied!