Question: Process ID
The following three processes arrive simultaneously and are to be scheduled on a single CPU for the specified burst length, measured in abstract time units. Assume that no process does any I/O. that the overhead of a context switch is a one-time unit, and that the idle process will always be run when there are no other processes scheduled.
Process ID CPU Burst Length P1 10 P2 20 P3 30
1. Calculate the total turnaround time of the three processes when scheduled using Round Robin
(RR) assuming a time quantum of two-time units.
2. Calculate the total turnaround time of the three processes when scheduled using Shortest Job First (SJF).
3. Unfortunately, the CPU burst length of a process is not actually known when it arrives. Assume that it takes the SJF scheduler 10-time units to estimate the CPU burst length of a process before its execution. Recalculate the total turnaround time using SJF.
4. Compare your results for RR (b)(i) against those for SJF when the burst lengths are known (b)(ii) and unknown (b)(iii). When does the total turnaround time for SJF exceed that for RR?
Which parameter has the most effect on the relative performance of these two schedulers, and why?
Step by Step Solution
There are 3 Steps involved in it
Ans 1 In Round Robin Scheduling Process ID Arrival Time CPU Burst Length Completion Time Turnaround Time P1 0 10 26 260 26 P2 0 20 48 480 48 P3 0 30 60 600 60 Total 134 Quantum 2 time unit Turnaround ... View full answer
Get step-by-step solutions from verified subject matter experts
