CPU scheduling is a process which allows one process to use the CPU while the execution of another process is on hold(in waiting state) due to unavailability of any resource like I/O etc, thereby making full use of CPU. The aim of CPU scheduling is to make the system efficient, fast and fair.

The basic concepts of CPU scheduling are:

1. **Burst Time**: Burst Time is the time required by a process to get executed on the CPU. It is also known as the time required by a process to complete its execution.

2. **Arrival Time**: Arrival Time is the time at which the process arrives in the ready queue.

3. **Priority**: Each process is assigned a priority. Process with highest priority is to be executed first and so on. Processes with same priority are executed on first come first serve basis.

4. **Waiting Time**: Waiting Time is the amount of time a process has been waiting in the ready queue to get the CPU.

5. **Turnaround Time**: Turnaround Time is the total time taken by the process to complete its execution. This includes the waiting time and the time taken on the CPU to execute the process.

The criteria used for evaluating scheduling algorithms are:

1. **CPU Utilization**: To keep the CPU as busy as possible.

2. **Throughput**: Number of processes that complete their execution per time unit.

3. **Turnaround Time**: Total time between the submission of a process and its completion.

4. **Waiting Time**: Total time a process has been waiting in the ready queue.

5. **Response Time**: Amount of time it takes from when a request was submitted until the first response is produced.

Different CPU scheduling algorithms have different properties and the choice of a particular algorithm may favor one class of jobs over another. In choosing which algorithm to use in a particular situation, we must consider the properties of the various algorithms.

Question

CPU scheduling is a process which allows one process to use the CPU while the execution of another process is on hold(in waiting state) due to unavailability of any resource like I/O etc, thereby making full use of CPU. The aim of CPU scheduling is to make the system efficient, fast and fair.

The basic concepts of CPU scheduling are:

1. **Burst Time**: Burst Time is the time required by a process to get executed on the CPU. It is also known as the time required by a process to complete its execution.

2. **Arrival Time**: Arrival Time is the time at which the process arrives in the ready queue.

3. **Priority**: Each process is assigned a priority. Process with highest priority is to be executed first and so on. Processes with same priority are executed on first come first serve basis.

4. **Waiting Time**: Waiting Time is the amount of time a process has been waiting in the ready queue to get the CPU.

5. **Turnaround Time**: Turnaround Time is the total time taken by the process to complete its execution. This includes the waiting time and the time taken on the CPU to execute the process.

The criteria used for evaluating scheduling algorithms are:

1. **CPU Utilization**: To keep the CPU as busy as possible.

2. **Throughput**: Number of processes that complete their execution per time unit.

3. **Turnaround Time**: Total time between the submission of a process and its completion.

4. **Waiting Time**: Total time a process has been waiting in the ready queue.

5. **Response Time**: Amount of time it takes from when a request was submitted until the first response is produced.

Different CPU scheduling algorithms have different properties and the choice of a particular algorithm may favor one class of jobs over another. In choosing which algorithm to use in a particular situation, we must consider the properties of the various algorithms.

Knowee AI · Accepted Answer