recategorized by
13,052 views
39 votes
39 votes

Which scheduling policy is most suitable for a time shared operating system?

  1. Shortest Job First
  2. Round Robin
  3. First Come First Serve
  4. Elevator
recategorized by

4 Answers

Best answer
58 votes
58 votes

Answer is Round Robin (RR), option (B).

Now question is Why RR is most suitable for time shared OS?

First of all we are discussing about Time shared OS, so obviously We need to consider pre-emption .

So, FCFS and Elevator these $2$ options removed first , remain SJF and RR from two remaining options.

Now in case of pre-emptive SJF which is also known as shortest remaining time first or SRTF  (where we can predict the next burst time using exponential averaging ), SRTF would NOT be optimal than RR. 

  • There is no starvation in case of RR, since every process shares a time slice.
  • But In case of SRTF, there can be a starvation , in worse case you may have the highest priority process, with a huge burst time have to wait.That means long process may have to wait indefinite time in case of SRTF. 

That's why RR can be chosen over SRTF in case of time shared OS.

edited by
12 votes
12 votes

B. Round Robin

Reason: Generally in time shared systems we need to have a best response time. So if we use Round Robin among the given algorithms we will achieve the best response time.

9 votes
9 votes
B. Round Robin.
0 votes
0 votes
Refer below link.

Time sharing systems requires min response time which is given by Round Robin.RR consist of Time Quantum which helps in executing process for given time and then context is switched.Hence the  processes need not wait for long to be executed resulting in less response time.

https://www.tutorialspoint.com/time-sharing-operating-system#:~:text=The%20main%20difference%20between%20Time-Sharing%20Systems%20and%20Multiprogrammed%20Batch%20Systems%20is%20that%20in%20case%20of%20Multiprogrammed%20batch%20systems%2C%20the%20objective%20is%20to%20maximize%20processor%20use%2C%20whereas%20in%20Time-Sharing%20Systems%2C%20the%20objective%20is%20to%20minimize%20response%20time.
Answer:

Related questions

47 votes
47 votes
5 answers
1
Kathleen asked Oct 8, 2014
16,085 views
The sequence __________ is an optimal non-preemptive scheduling sequence for the following jobs which leaves the CPU idle for ________ unit(s) of time.$$\small \begin{arr...
33 votes
33 votes
5 answers
2
Kathleen asked Oct 8, 2014
21,019 views
The minimum number of edges in a connected cyclic graph on $n$ vertices is:$n-1$$n$$n+1$None of the above
15 votes
15 votes
3 answers
3
Kathleen asked Oct 8, 2014
4,564 views
What are $x$ and $y$ in the following macro definition?macro Add x, y Load y Mul x Store y end macroVariablesIdentifiersActual parametersFormal parameters