International Journal of Emerging Trends & Technology in Computer Science
A Motivation for Recent Innovation & Research
ISSN 2278-6856
www.ijettcs.org

Call for Paper, Published Articles, Indexing Infromation Comparative Study of Various CPU Scheduling Algorithm , Authors : Sumit Kumar Nager, Nasib Singh Gill, International Journal of Emerging Trends & Technology in Computer Science (IJETTCS), www.ijettcs.org
Volume & Issue no: Volume 6, Issue 2, March - April 2017

Title:
Comparative Study of Various CPU Scheduling Algorithm
Author Name:
Sumit Kumar Nager, Nasib Singh Gill
Abstract:
Abstract Processor scheduling is a mechanism emigrate procedures to diverse states from and to numerous process queues. The number of processes executing together has expanded exponentially from the improvement of multiprogramming and multiprocessor environment. Thus it is mostly desired to schedule the process to attain the best optimal state for the system. Various scheduling algorithms are there to accomplish this task. This paper presents the comparative analysis of various scheduling algorithms such as First Come First Serve, Shortest Job First, Round Robin, Priority, Longest Job First, Multilevel queue, multilevel feedback queue and priority scheduling with their preemptive as well as non-preemptive modes. All these algorithms are presented with their examples and grant charts. These algorithms are judged on the premise of common ready time, average turnaround time, previous understanding that device has to have earlier than scheduling the system and complexity worried in growing those algorithms. Keywords: Scheduler, LTS, MTS, STS, CPU Scheduling, FCFS, SJF, LJF, Preemptive, Non-Preemptive.
Cite this article:
Sumit Kumar Nager, Nasib Singh Gill , " Comparative Study of Various CPU Scheduling Algorithm " , International Journal of Emerging Trends & Technology in Computer Science (IJETTCS), Volume 6, Issue 2, March - April 2017 , pp. 040-045 , ISSN 2278-6856.
Full Text [PDF]                          Home