• CPU Scheduling implementation reference repo

  GitHub - yousefkotp/CPU-Scheduling-Algorithms: An implementation of various CPU scheduling algorithms in C++. The algorithms included are First Come First Serve (FCFS), Round Robin (RR), Shortest Process Next (SPN), Shortest Remaining Time (SRT), Highest Response Ratio Next (HRRN), Feedback (FB) and Aging.

• CPU Scheduling Monitor

  OS Virtual Lab

First Come First Serve (FCFS)

• First Come First Served (FCFS) is a scheduling algorithm in which the process that arrives first is executed first.
• It is a non-preemptive algorithm
• Have potential starvation problem
• It can lead to poor performance if there are processes with long burst times. Since shorter processes will be executed first, and thus will spend less time waiting in the queue.
• It is commonly used in batch systems where the order of the processes is important.

SPN (A.K.A SJF)

• Shortest process next, a.k.a shortest job next or shortest job first
• Is a non preemptive, greedy algorithm
• Have potential starvation problem
• This algorithm can be beneficial in situations where the objective is to minimize the average waiting time for processes, since shorter processes will be executed first, and thus will spend less time waiting in the queue.

SRT

• Shortest remaining time
• Is a preemptive variant of SJN

Round Robin with varying time quantum (RR)

• It uses a time-sharing approach to divide CPU time among processes.
• The quantum (time slice) is not fixed and can be adjusted depending on the requirements of the processes.