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

  • Xoxa N
  • Zotaj M
  • Tafa I
 et al. 
  • 9

    Readers

    Mendeley users who have this article in their library.
  • N/A

    Citations

    Citations of this article.

Abstract

-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.

Author-supplied keywords

  • -CPU-Scheduling
  • FCFS
  • SJF
  • Scheduler

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

There are no full text links

Authors

  • Nevila Xoxa

  • Marjo Zotaj

  • Igli Tafa

  • Julian Fejzaj

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free