Home
Call For Papers
Submission
Author
Registration
Publications
About
Contact Us

  Simulation of First Come First Served (FCFS) and Shortest Job First (SJF) Algorithms  
  Authors : Nevila Xoxa; Marjo Zotaj; Igli Tafa; Julian Fejzaj
  Cite as:

 

Development of scheduling algorithms is directly related with the development of operating system which brings difficulties in implementation. Any modification on the scheduling algorithm will appear as modification on the operating system kernel code. Processor is an important source of cpu scheduling process, so it becomes very important on accomplishing of the operating system design goals. A delicate problem of the well-functioning of SO is the case when in CPU comes two or more processes which wants to be executed. Scheduling includes a range of mechanisms and policies that SO has to follows in order that all processes take the service. In this Paper we will discuss about two main batches algorithms, such as FCFS and SJF, and i will show a manner how to improve these algorithms in the future work.

 

Published In : IJCSN Journal Volume 3, Issue 6

Date of Publication : December 2014

Pages : 444 - 449

Figures : 08

Tables : 02

Publication Link : Simulation of First Come First Served (FCFS) and Shortest Job First (SJF) Algorithms

 

 

 

Nevila Xoxa : University of Tirana, Faculty of Natural Science

Marjo Zotaj : Polytechnic University of Tirana, Faculty of Information and Technology

Igli Tafa : Polytechnic University of Tirana, Faculty of Information and Technology

Julian Fejzaj : University of Tirana, Faculty of Natural Science

 

 

 

 

 

 

 

CPU-Scheduling

Scheduler

FCFS

SJF

After execution of simulation codes of FCFS and SJF I come to the conclusion that SJF algorithm is more competitive than FCFS If we talk about performance because It has minimal average waiting that is very important.SJF main flaw is : a very long process to be not executed at the time required, thing that does not happen to FCFS algorithm.

 

 

 

 

 

 

 

 

 

[1] Modern Operating Systems : Andrey Tanenbaum. [2] A Comparison between FCFS and Mixed Scheduling Alka Pant. [3] A Comparative Study of CPU Scheduling Algorithms : Dr. R.B. Garg. [4] W4118 Operating Systems : Junfeng Yang. [5] Theory, Algorithms, and Systems : Michael L. Pinedo. [6] Introduction to Algorithms : Thomas H. Cormen. [7] Handbook of Scheduling: Algorithms, Models, and Performance Analysis Joseph Y-T. Leung. [8] Complex Scheduling (GOR-Publications) :Peter Brucker. [9] On Job Scheduling for HPC-Clustersand the dynP Scheduler :Achim Streit. [10] Scheduling Algorithmes: Peter Pruckes. [11] Theory of Scheduling: R.Conay. [12] Softuare Systems , os overview-cpu scheduling: Insup Lee. [13] Operating Systems , Scheduling : Jerry Breecher [14] Comparative Study of Scheduling Algorithms in Operating System : Ankur Bhardwaj