Round Robin Program In C.

Analyzing the Round Robin Scheduling This exercise can be solved on any UNIX or Windows system. Your instructor will let you know which programming language(s) you can use to solve the exercise In this exercise, you will study the effect of several parameters used with RR scheduling (see Section 7.5). To solve the exercise, you will need to write a discrete simulation to experiment with the performance of this strategy under different timeslice lengths and dif ferent dispatcher overhead times. Do this by writing a simulation program to imitate the behavior of a single-CPU system that has a preemptive RR scheduler, and then collecting performance data regarding the operation of the simulation. Create an input file to represent process arrival and service times, where each line rep- resents a process arriving into your simulated system. The first number is the arrival time (in integer seconds), and the second number is the amount of time the process requires to complete (in floating-point seconds). For example, the first several lines of the file might look like