Kavindu Dulanjana Perera

The process of assigning specific tasks to resources in order to perform a specific task is known as scheduling. The main purpose of CPU scheduling is to assign tasks to be executed whenever the processor remains idle, by selecting available processes from the memory. There are several types of scheduling algorithms such as, First-Come, First-Served (FCFS) Scheduling. Shortest-Job-Next (SJN) Scheduling. Priority Scheduling. Shortest Remaining Time. Round Robin(RR) Scheduling. Multiple-Level Queues Scheduling.  Mainly CPU scheduling can be classified into two types as, Pre-emptive – here the tasks are scheduled according to the priority level of the tasks. The tasks with the highest priority are executed first while the lover ones are executed later when the higher priority task finishes its execution. Non-pre-emptive – here the task that keeps running in the CPU will release the CPU either by switching context or terminating, because here the CPU has been allocated for specific process