A Novel CPU Scheduling Algorithm Based on Ant Lion Optimizer

In a multiprogramming environment, operating system plays a vital role to schedule the various user processes or tasks in different queues in efficient manner so that the system performance enhances in terms of increased throughput and reduced process waiting time. Processes carry varying time slices to be serviced by the processor. This variation of time slice authorizes the scheduler to schedule the processes so that it can provide an appropriate response time. Early response agreed by the processor after submitting a process in a queue ensures the less waiting time which suggests enhanced multiprogramming environment keeping more number of processes to get chance of early execution. This paper proposes a new CPU scheduling policy based on novel nature-inspired optimization technique, namely ant lion optimizer (ALO). This algorithm schedules the processes in such a way that the average waiting time is minimized. The proposed approach is compared with the widely used three CPU scheduling policies: first come first serve (FCFS), shortest computation time first (SCTF), and round robin (RR).