yash8005 / additionally-modified-round-robin-algorithm Goto Github PK

Multiprogramming is a process or method of executing multiple processes simultaneously in the memory. Its primary aim is to minimize the average waiting time, average turnaround time and maximize the CPU utilization. There are various CPU scheduling algorithms are used to performed multiprogramming like First Come First Serve (FCFS), Shortest Job First (SJF), Priority Scheduling (PS) and Round Robin (RR). This project deals with the simulation of CPU scheduling algorithms with C. The following algorithms are simulated: • First Come First Serve (FCFS) • Shortest Job First • SRTF Algorithm • Round Robin • Our innovative algorithm The metrics such as waiting time and turnaround time taken for the processes to complete, number of rounds, etc are calculated. The target of this project is to also propose a new CPU scheduling algorithm which will perform superior than current round robin algorithm and in most cases better than other algorithms as well in terms of minimizing average waiting time, average turnaround time and number of context switches.