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

Secret Sharing Image Between End Users by using Cryptography Technique 

In this Secret Sharing Image(SSI) we are divide the complete image into n shares distributed to n participants. Only authorized persons access the secret image without any cryptography knowledge and the end use...

A Comprehensive Review of Image Smoothing Techniques  

Smoothing is often used to reduce noise within an image or to produce a less pixelated image. Image smoothing is a key technology of image enhancement, which can remove noise in images. So, it is a necessary functi...

Intelligent System for detecting, Modeling, Classification of human behavior using image processing, machine vision and OpenCV 

Surveillance Cameras has proven to be a key factor in enhancing the public security in many countries around the world . In spite of advancements in image processing and machine vision techniques very less is app...

Evaluating QOSMOS Using Markov Decision Process Model  

Service discovery has been recognized as an important aspect in the development of service centric systems, i.e., software systems which deploy web services. To develop such systems, it is necessary to identify ser...

The Efficient load balancing in the parallel computer

Recently Cpu workload hardware Technology and multiprocessor Service are developing rapidly. Mathematically computation must be completed within a certain time period .Through the mathematical Analysis our Study Iden...

Download PDF file
  • EP ID EP151708
  • DOI -
  • Views 103
  • 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