Comparative Analysis of Various Scheduling Algorithms

Abstract

Scheduling is the technique used for controlling the order of the job which is to be performed by a CPU of a computer. The motive of scheduling is to engage the CPU at its maximum capacity and no process shall wait for longer time and to finish the entire task in minimum possible time. In this paper, we discuss various types of Scheduling algorithms and Compare their performance on terms of throughput and waiting time. First of them is First Come First Served (FCFS) which is a non-preemptive and the simplest scheduling. FCFS is good for long job. Second is Shortest Job First (SJF) scheduling which selects that job first which has least processing time i.e. the processing demanding the less CPU time is executed first. Next is Round Robin (RR) scheduling, it removes the drawbacks of FCFS by preempting running jobs periodically. But if the length of time quantum is too short then more time will waste in context switching. Last one is Priority Based scheduling where each process is assigned a priority (preference) to create the order of execution.

Authors and Affiliations

Lalit Kishor , Dinesh Goyal

Keywords

Related Articles

Hybrid Computational Intelligence for Optimization Based On PSO and DE 

Particle Swarm Optimization (PSO) is a stochastic global optimization method which is originated from the reproduction of the social performance of birds within a flock. Differential Evolution (DE)is a method that...

Using Genetic Algorithm for Symmetric key Generation in Image Encryption  

Cryptography is essential for protecting information as the importance of security is increasing day by day with the advent of online transaction processing and e commerce. In now a day the security of digital imag...

A survey on AODV routing protocol for AD-HOC Network

Now a day, Ad-hoc network has become an indivisible part for communication for mobile devices. There are different types of topology for implementation of Ad-hoc network. AODV is one of them which are a reactive protocol...

STUDY ON IMAGE BROADCAST USING WATERMARK AND SECURITY TECHNIQUES  

Image broadcast is existing in this paper by experimental outcomes. In this method, an unauthorized person is easily determine through piracy of an image. Watermark is appended into image at the time of sending an image....

Doctor friendly software for HRV Analysis  

This paper discusses about the development of HRV analysis software using VB and MATLAB easy to be used and understand by the doctors. The developed software provides user friendly GUI which provides the doctors...

Download PDF file
  • EP ID EP151708
  • DOI -
  • Views 74
  • Downloads 0

How To Cite

Lalit Kishor, Dinesh Goyal (2013). Comparative Analysis of Various Scheduling Algorithms. International Journal of Advanced Research in Computer Engineering & Technology(IJARCET), 2(4), 1488-1491. https://europub.co.uk/articles/-A-151708