CPU Scheduling Algorithms Quiz

The purpose of CPU Scheduling is to make the system more efficient, faster, and fairer.

In computing, a process is the instance of a computer program that is being executed by one or many threads. It contains the program code and its activity.

We need to schedule processes in order to allow one process to use the CPU while another process is delayed, thus making full use of the CPU and improving system efficiency.

The main function of CPU scheduling is to ensure that whenever the CPU remains idle, the OS has at least selected one of the processes available in the ready-to-use line.

An effective CPU scheduling algorithm is necessary to improve resource utilization and minimize the chances of system failure or deadlock.

The different types of CPU scheduling algorithms mentioned in the text are First Come First Serve (FCFS), Shortest Job First (SJF), Longest Job First (LJF), Priority Scheduling, Round Robin, and Shortest Remaining Time First.

The characteristic of the Priority Scheduling algorithm is that it works based on the priority of a process, where the most important process is done first. In case of conflicts, the FCFS algorithm is used.

The advantage of SRTF is that it minimizes the waiting time for processes, leading to better overall system performance.

The disadvantage of LRTF is that it may result in starvation for processes with shorter execution times, as longer processes are prioritized.

The advantage of HRRN is that it provides a good balance between response time and turnaround time for processes.

The disadvantage of MLFQ is that it requires careful configuration of the number and priority of queues, which can be complex to manage.

Average Wait Time: (0+4+6+13) / 4 = 5.75

Average Wait Time: (0 + 4 + 12 + 5)/4 = 21 / 4 = 5.25

Average Wait Time: (0 + 10 + 12 + 2)/4 = 24 / 4 = 6

Average Wait Time: (9+2+12+11) / 4 = 8.5