Comparative Performance Analysis of Job Scheduling Algorithms in a Real-World Scientific Application

Author(s):  
Fernando Emilio Puntel ◽  
Andrea Schwertner Charão ◽  
Adriano Petry
Author(s):  
Thangakumar Jeyaprakash ◽  
Sambath M

Scheduling algorithms plays a significant role in optimizing the CPU in operating system. Each scheduling algorithms [8] schedules the processes in the ready queue with its own algorithm design and its properties. In this paper, the performance analysis of First come First serve scheduling, non-pre-emptive scheduling, Pre-emptive scheduling, Shortest Job scheduling First (SJF) and Round Robin algorithm has been discussed with an example and the results has been analysed with the performance parameters such as minimum waiting time, minimum turnaround time and Response time. This will help the young researchers to analyse algorithms to develop a new optimized algorithm for CPU optimization.


2016 ◽  
Vol 3 (1) ◽  
pp. 30 ◽  
Author(s):  
NASEERA SHAIK ◽  
JYOTHEESWAI P ◽  
◽  

2015 ◽  
Vol 11 (21) ◽  
Author(s):  
Abu Hanifa Md. Noman ◽  
Sajeda Pervin ◽  
Nazneen Jahan Chowdhury ◽  
Md. Amzad Hossain ◽  
Hasanul Banna

Sign in / Sign up

Export Citation Format

Share Document