Suppose that the following processes arrive for execution at the times indicated. Each process will run the listed amoun

[answerhappygod]

Suppose That The Following Processes Arrive For Execution At The Times Indicated Each Process Will Run The Listed Amoun 1 (145.08 KiB) Viewed 78 times

Suppose that the following processes arrive for execution at the times indicated. Each process will run the listed amount of time. In answering questions, use non- preemptive scheduling and base all decisions on the information you have at the time the decision must be made. Process P1 P2 P: Arrival Time 0.0 0.4 1.0 Burst Time 8 4 1 the FCFS a. What is the average turnaround time for these processes with scheduling algorithm? b. What is the average turnaround time for these processes with scheduling algorithm? the SJF c. The SJF algorithm is supposed to improve performance, but notice that we chose to run process P. at time 0 because we did not know that two shorter processes would arrive soon. Compute what the average turnaround time will be if the CPU is left idle for the first 1 unit of time and then SJF scheduling is used. Remember that processes P1 and P2 are waiting during this idle time, so their waiting time may increase. This algorithm could be known as future-knowledge scheduling. Also keep in mind that the turnaround time is the finishing time minus the arrival time. Note: For parts a, b, c it is required that you show the Gantt charts before computing the average turnaround times. Also show your computation.