Round Robin suitable scheduling policy for time - shared operating systems - Operating System

Q.  What is the most suitable scheduling policy for a time - shared operating systems?
- Published on 26 Aug 15

a. Shortest Job First
b. Elevator
c. First Come First Served
d. Round Robin

ANSWER: Round Robin


  • Nirja Shah   -Posted on 23 Nov 15
    - To order a schedule processes fairly, a round-robin scheduler is generally employed for 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 then.

    - This process 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.)