The cpu scheduling algorithm best suited for time sharing os is
Answers
Answered by
0
. Which scheduling policy is most suitable for a time-shared operating systems? Explanation: In order to schedule processes fairly, 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 then
PLZ MARK AS BRAINLEIST
Answered by
0
Which scheduling policy is most suitable for a time-shared operating systems? Explanation: In order to schedule processes fairly, 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 then.
Similar questions
Biology,
6 months ago
Geography,
6 months ago
Social Sciences,
6 months ago
Computer Science,
1 year ago
Computer Science,
1 year ago
Math,
1 year ago
Chemistry,
1 year ago