Open AccessDesign of Optimal Scheduler for Process Scheduling
Author(s) -
M. Sambath,
D. John Aravindhar,
P. Harshavardhan Reddy,
Lokesh Kumar Ravipati,
S Gowtham,
K Jagadeesh,
Vemula Raviteja
Publication year - 2020
Publication title -
international journal of engineering and advanced technology
Language(s) - English
Resource type - Journals
ISSN - 2249-8958
DOI - 10.35940/ijeat.c6416.029320
Subject(s) - computer science , computer multitasking , cpu shielding , scheduling (production processes) , turnaround time , central processing unit , fixed priority pre emptive scheduling , earliest deadline first scheduling , fair share scheduling , rate monotonic scheduling , parallel computing , distributed computing , dynamic priority scheduling , process (computing) , two level scheduling , real time computing , operating system , engineering , schedule , operations management
CPU Scheduling takes plays an important role in multiprogramming systems. There are several programs present in memory. It is the responsibility of operating systems to select the process and assign it to CPU. There are various algorithms available for CPU Scheduling. The algorithm’s performance depends on various factors like arrival time, priority etc. This paper helps to select the best algorithm by comparing various algorithms under the same condition and analyzed them based on various factors like waiting time, turnaround time, CPU utilization, Throughput.