- Consider two processes, process A is CPU-bound with CPU bursttime one hour, and process B is I/O-bound repeating CPU burst time1 ms and disk I/O 9 ms. Please illustrate using Gnatt charts theround-robin scheduling with a time quantum respectively setting to100 ms and 1 ms, and SRTF scheduling. Please discuss which oneperforms the best (10 points)? Hint: consider disk utilization andnumber of context switch.
Expert Answer
An answer will be send to you shortly. . . . .