Log In
2 votes

Find each of the following cases with detailed explanation by an example schedule.d

in Operating System
retagged by

1 Answer

7 votes
Best answer

For case 1 and 2 , we can justify that the efficiency is T/T+S only since no context switch occurs because of timer interrupt which interrupts to preempt a process from running state to ready and then schedules another process.But the measured time for which the process runs given is T time units only.So we have to find efficiency keeping in mind this constraint of measurement.

Also for case 5 , we can justify the CPU efficiency will be 0 as time quantum approaches to 0.So useful time spent by any process on the CPU will also be 0 approximately.So this results in CPU efficiency of 0.

I hope this clears your query on different cases on round robin scheduling CPU efficiency based on varying time quanta.

selected by
@habib pic is not clear,edit the pic by just zoom in (expand it) before upload.
Is it clear now??
still not , just crop the image  by removing extra spaces left and right side and then upload.
@habib "time T before blocking input/output" what does this mean?
Means before the process goes into blocked state ,or in other words I/O wait state.
Nice explaination Habib :)

Related questions

0 votes
0 answers
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?
asked Jan 4, 2019 in Operating System subho16 121 views
3 votes
2 answers
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 878 views
0 votes
1 answer
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 545 views
5 votes
3 answers
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.4k views