search
Log In
0 votes
145 views
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?
in Operating System 145 views
1
at that time it is implementation defined !

So, it will be specified in the question.

Please log in or register to answer this question.

Related questions

3 votes
2 answers
1
1k views
Consider a System using Round Robin scheduling with 10 Processes all arriving at the time 0. Each Process is associated with 20 identical Request. Each Process request consumes 20 ms of CPU time after which it spends 10 ms of time on I/O,thereafter intiates subsequent ... Process. ii. Response time of the 1st Request of the last Process. iii. Response time of the subsequent request of any process.
asked Aug 22, 2018 in Operating System Karan Dodwani 1 1k views
5 votes
3 answers
2
1.6k views
If we have only one process in ready queue with burst time "m", then how many context switching will happen using round robing scheduling with time quantum q ,where q<m.Assume that dispatching the process first time is not counted as a context switch.
asked Aug 26, 2017 in Operating System rahul sharma 5 1.6k views
0 votes
1 answer
3
590 views
Choose correct answer from the below options: If the following jobs are to be executed on a single processor system The jobs are arrived at time 0 and in the order a, b, c, d, e. Calculate the departure time (completion time) for job ‘a’ if scheduling is round robin with time slice 1 15 5 9 11
asked Dec 10, 2017 in Operating System Parshu gate 590 views
2 votes
1 answer
4
314 views
Find each of the following cases with detailed explanation by an example schedule.d
asked Nov 1, 2016 in Operating System Prabhanjan_1 314 views
...