Suppose that the following processes arrive for execution at the times indicated. Each process…
Suppose that the following processes arrive for execution at the times indicated. Each process will run for the amount of time listed. In answering the questions, use non-preemptive scheduling, and base all decisions on the information you have at the time the decision must be made.
Process Arrival Time Burst Time
———– —————– ——————–
P1 0.0 7
P2 0.5 5
P3 3.0 3
What is the average turnaround time for these processes with the FCFS scheduling algorithm (Also find each process turnaround time)? (5 points)
What is the average turnaround time for these processes with the SJF scheduling algorithm (Also find each process turnaround time)? (5 points)
The SJF algorithm is supposed to improve performance, but notice that we chose to run process P1 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 3 units 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. (5 points)
Any citation style (APA, MLA, Chicago/Turabian, Harvard)
Delivering a high-quality product at a reasonable price is not enough anymore.
That’s why we have developed 5 beneficial guarantees that will make your experience with our service enjoyable, easy, and safe.
You have to be 100% sure of the quality of your product to give a money-back guarantee. This describes us perfectly. Make sure that this guarantee is totally transparent.