Mumbai University > Electronics Engineering > Sem 6 > Embedded System and RTOS

a. First come first served (FCFS)/ FIFO scheduling:

As the name indicates this algorithm allocates CPU time to tasks based on the order in which they enter the ready queue. The first enter process is serviced first. The major drawback of FCFS is that it favors monopoly of a process. A process which does not contain any I/O operation executes till its completion. I/O bound processes have to wait until the completion of CPU bound processes.

b. Last-come first served (LCFS)/LIFO scheduling:

Processes are allocated CPU based on the order in which they enter the CPU. The last entered process is serviced first. LCFS is also not optimal as it also possesses the same drawback as that of FCFS algorithm.

c. Shortest Job First (SJF) Scheduling:

The ready queue is sorted by the CPU every time a process relinquishes (i.e. it terminates or enters wait state for an I/O resource) to pick a process which has least estimated run time. The major drawback is that processes with higher execution time may not get a chance to execute if more and more processes with least execution time enter the ready queue. This is known as starvation.

d. Priority based scheduling:

The priority is assigned to each task based on criteria’s like the shortest job first or the priority can be indicated at time of creation of the task using a number ranging from 0. Priority based non-preemptive scheduling also suffers from starvation which can be tackled using priority based preemptive scheduling.