Operating Systems: Non-preemptive scheduling algorithms

  • FCFS executes processes in order of their arrival times into the ready queue. The first process to arrive gets scheduled to cpu and executed first.
  • In SJF, the process with the shortest burst time(time it takes a processes to run in CPU) gets executed first. This algorithm penalizes processes with long executing times since they are given a lower priority during scheduling.
  • Priority scheduling follows a ranking system where each process is assigned a priority value. Higher priority processes get executed first. As a result, lower priority processes are penalized and likely to “starve” i.e. they may fail to execute if higher priority processes keep arriving into the ready queue.

--

--

--

Aspiring Data Scientist | Computer Science and Statistics Student at Colby College | Tech Enthusiast | Love Writing

Love podcasts or audiobooks? Learn on the go with our new app.

Recommended from Medium

AWS Solutions Architect Guide [Part 1]

You don’t need to know “Dependency Injection”

F5 BIG-IP or BIG-IQ: Can’t run config tool on CLI

An Overview on Using Asana as Your Web Project Management Tool For Free

Co-Author Recommendation System using Graph Embeddings[ Neo4j]

Introducing the Tracing Agent: Simplifying GraalVM Native Image Configuration

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store
Collins

Collins

Aspiring Data Scientist | Computer Science and Statistics Student at Colby College | Tech Enthusiast | Love Writing

More from Medium

Twinkle Twinkle Little Star — a small project in Embedded Systems

How To Build an Evil Compiler

Review for “A View of the Parallel Computing Landscape”

Detangling graphs: Topological Sort