Evaluation of Scheduling Algorithms on Linux OS

Abstract

Computers are taking up great part in technology evolution. They perform many tasks quickly and reliably when compared to humans, opening new avenues. One important aspect of computers is multitasking that enables a system to execute multiple tasks at a time. Scheduler is an object of the kernel that divides CPU time among various processes, based on any specific policy including, but not limited to, response time, throughput, and interactivity. Scheduler works differently for single core and multi-core processor environment. There are different scheduling algorithms for multicore processor based on required performance criteria. In this work we have proposed and observed the simulation of different scheduling algorithms at user level for single core and multicore and compared the different metrics like average waiting time, turnaround time, CPU utilization and number of context switches in graphical manner and observed that the performance improvement in multicore environment compared to single core processor.