Question: CPU SCHEDULING: Please show and explain how you got all the answers. Consider three processes P1, P2, and P3 with the following CPU burst times:
Consider three processes P1, P2, and P3 with the following CPU burst times: Burst times for P1: 14, 12, 17 Burst times for P2: 2, 2, 2, 3, 2, 2, 2,3 Burst times for P3: 6, 3, 8, 2, 1, 3, 4, 9,7 All three arrive at time 0, in order P1, P2, P3. Each CPU burst is followed by an I/O operation taking 6 time units, except for the last burst after which the process terminates. Using the provided tables, simulate the execution of these processes using the following scheduling algorithms. Assume that overhead time for process switching and scheduling functions are negligible (assumed to be 0) a) FCFS b) SJF c) SRTF d) RR with a quantum of 5 time units e) RR with a quantum of 5 units with priority: P2-P3>P1 Table for the above algorithms: Algorithm Name: Time CPU Ready Queue Blocked (Waiting) Queue Terminated Note: You may need to add more rows for the whole scheduling
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
