Scheduling policy is suited for a time shared operating system - Round robin

Q.  Operating System: Which of the following scheduling policy is well suited for a time shared operating system?
- Published on 19 Oct 15

a. First come first serve.
b. Shortest job first
c. Round robin
d. None of the above.

ANSWER: Round robin
 

    Discussion

  • Nirja Shah   -Posted on 23 Nov 15
    - A round-robin scheduler generally employs time-sharing, giving each job a time slot or quantum (its allowance of CPU time), and interrupting the job if it is not completed by them to run the schedule process fairly.

    - It is designed for time-sharing systems.

Post your comment / Share knowledge


Enter the code shown above:
 
(Note: If you cannot read the numbers in the above image, reload the page to generate a new one.)