Operating Systems-2




2. Consider a set of n tasks with known runtimes r1, r2, … rn to be run on a uniprocessor machine.
Which of the following processor scheduling algorithms will result in the maximum throughput?
  1. Round-Robin
  2. Shortest-Job-First
  3. Highest-Response-Ratio-Next
  4. First-Come-First-Served

at

No comments:

Post a Comment

Subscribe to: Post Comments (Atom)