Detailed Analysis and Simulation of Various Process Scheduling Algorithms

Abstract

ABSTRACT

CPU scheduling is a dominant theory in multiprocessing, multitasking operating systems, time-sharing, and designs of a real-time operating system. The CPU scheduler system deals with the problem of which processes are to be assigned to the CPU in the ready queue. The working system will make the PC more profitable by exchanging the CPU for measures.In this paper, we will be looking over various parameters which results for process scheduling algorithm performance like waiting time, turn-around time, fairness, priority, response time, throughput for the algorithms such as first come first serve scheduling algorithm (FCFS), shortest job first scheduling algorithm (SJF),non-preemptive, shortest job first scheduling algorithm (SJF) preemptive, round robin scheduling algorithm (RR) and priority scheduling algorithm.

Keywords: CPU scheduling, scheduling algorithms, multitasking, multiprocessing