Listed below are the different scheduling algorithms:
- First come, first serve: The process which requests the CPU first gets the CPU allocation first.
- Shortest job first: Here, the process with the shortest execution time should be selected for execution next.
- Priority scheduling: Here, the scheduler selects the tasks to work as per the priority.
- Multiple level queues: Processes are assigned to a queue based on a specific property like the process priority, size of the memory, etc.
- Shortest remaining time: Here, the process will be allocated to the task, which is closest to its completion.
- Round Robin: Each process that comes, in turn, gets an equal share of time.