The following algorithms are mainly used to allocate the job (process) to the processor:
FIFO, SJF, Round Robin, Based on priority.
1. First In First Out (FIFO) Scheduling –
This algorithm is based on queuing technique. Technically, the process that enters the queue first is executed first by the CPU, followed by the next and so on. The processes are executed in the order of the queue.
2. Shortest Job First (SJF) Scheduling –
This algorithm works based on the size of the job being executed by the CPU.
3. Round Robin Scheduling –
Round Robin (RR) Scheduling algorithm is designed especially -for time sharing systems, jobs are assigned and processor time in a circular method.
4. Based on priority –
The given job (process) is assigned on a priority. The job which has higher priority is more important than ether jobs.
