Department of Computer Science, Jayoti Vidyapeeth Women’s University, Jaipur, India

Abstract

Over the years, with speedy growth of digital devices and techniques the scheduling has attain focus of intensive research, since it directly influences the performance of a system. In general, scheduling is an art of formative that which process has implement and access resources when there are multiple run-able processes are available in a system. The researcher has projected the CPU Scheduling algorithm to reduce the TAT (Turnaround time), AWAT (Average Waiting Time), NCS (Number of context switching) to maximize the throughput and minimize the response time to get the proper optimization. The presented work of this paper depicts an overview of accessible scheduling algorithms with their exclusive issues for explaining such technique in simple way and motivates new researchers to design more efficient scheduling algorithm.
Key Words: Scheduler, Scheduling, Scheduling Algorithms, Context switching, Turnaround Time, Average Waiting Time, Quantum Time, Scheduling Scheme.