Consider a FCFS and Round Robin (assumed timeslice = 2) process scheduler. Assum

Question

Consider a FCFS and Round Robin (assumed timeslice = 2) process scheduler. Assume that there are three processes in the scheduling queue and that all three of them are ready to run. Scheduling starts at time t = 0. The CPU and I/O burst patterns of the three processes are shown as follows:

CPU I/O CPU I/O CPU

P1 4 2 4 2 4 P1 is done

P2 5 2 5 P2 is done

P3 2 2 2 2 2 P3 is done

Each process exits the system once its CPU and I/O bursts, as just shown, are complete.

a. Show the CPU and I/O timelines that result with FCFS and Round Robin scheduling from t = 0 until all three processes exit the system.

b. For each scheduling, what is the waiting time for each process? c. For each scheduling, what is the average throughput of the system?

c. For each scheduling, what is the average throughput of the system?

I have solved both a and b, sub c is my concern. How does one determine the average throughput based on the provided and extrapolated information?

Explanation / Answer

c)

Average throughput: Average number of jobs completed per time unit.

Consider the given data,

Total number of processes=3 (P1, P2, and P3)

Total time =30

Average throughput of the system=Total number of processes/Total time

                                                           =3/30

                                                          =1/10 processes per unit time

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.