A uniprocessor computer system has only two processes, both of which alternate…
GATE · 2003 · CS
A uniprocessor computer system has only two processes, both of which alternate between 10 ms CPU bursts and 90 ms I/O bursts. Both processes were created at nearly the same time. The I/O operations of both processes can proceed in parallel. Which of the following scheduling strategies will result in the least CPU utilization over a long period of time for this system?
- A.
First come first served scheduling
- B.
Shortest remaining time first scheduling
- C.
Static priority scheduling with different priorities for the two processes
- D.
Round robin scheduling with a time quantum of 5 ms
Attempted by 382 students.
Sign up free to check your answer
Sign up freeLoading lesson…