Solve Round Robin problems using C-programming with Gantt Chart
Round robin scheduling (RRS) is a job-scheduling algorithm that is considered to be very fair, as it uses time slices that are assigned to each process in the queue or line. Each process is then allowed to use the CPU for a given amount of time, and if it does not finish within the allotted time, it is preempted and then moved at the back of the line so that the next process in line is able to use the CPU for the same amount of time.
You enter the no. of processes , it's burst time and the quantum number then the application will draw a Gantt Chart and give you :
- Arrival Time
- Turn-arround Time
- Waiting Time
- The order of processes you entered