Journal of Global Research in Computer Science (JGRCS)
One of the most important components of the computer resource is the CPU. CPU scheduling involves a careful examination of pending processes to determine the most efficient way to service the requests. CPU scheduling is the basis of multi-programmed operating systems. Most CPU scheduling algorithms concentrate on maximizing CPU utilization and throughput and minimizing turnaround time, waiting time, response time and number of context switching for a set of requests. Some of the popular CPU scheduling algorithms are First-Come-First-Served (FCFS), Shortest Job First (SJF), Priority Scheduling and Round Robin (RR). FCFS is the simplest form of CPU scheduling algorithm. This algorithm is simple to implement, but it generally does not provide the fastest service.