An Analysis for Task Optimization based on CPU Scheduling with Pipelining Techniques

one of the most important components of the computer resource is the CPU. In multiprogramming systems i.e. the systems where several processes reside in memory, organization of processes is very important so that CPU always has one to execute. CPU scheduling is the base of multiprogramming operating systems. CPU executes one process at a time and switches between processes to improve CPU utilization. CPU scheduling strategies help in selecting the next process to be executed by the CPU. CPU scheduling is the basis of multi programmed operating systems. Most CPU scheduling algorithms concentrate on maximizing CPU utilization, 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). This paper describes the CPU scheduling algorithm with pipelining techniques. These techniques can be applied to any CPU scheduling algorithms to improve its performance. The analysis shows that the proposed system is better than the existing scheduling algorithms.