You Spin Me Round Robin

This lab implements a Round Robin scheduling policy that can parse a file containing processes in order and a quantum slice argument to determine how much time a process can run for a slice.

Building

make

Running

First make sure a text file is created, with the first line containing the number of processes to be run, and the following lines being the order of the processes, with each line in the format: PID, arrival time, burst time.

4
1, 0, 7
2, 2, 4
3, 4, 1
4, 5, 4

Then call the C file with two arguments, the first being the .txt file and the second being the length of the quantum slice:

./rr processes.txt 3

The program then computes and prints the average waiting and response time for the given set of processes using Round Robin.

Average waiting time: 7.00
Average response time: 2.75

Cleaning up

make clean