Agha-Muqarib / CPU-Scheduling-Algorithms

This repository contains the basic CPU Scheduling Algorithms from which an Operating System decides the sequencing or scheduling of process to be executed. All the algorithms inside are preemptive in nature, i.e. contact switching is possible. The algorithms include, First Come First Serve (FCFS), Shortest Job First (SJF), Round Robin and Priority Scheduling.

Geek Repo:Geek Repo

Github PK Tool:Github PK Tool

CPU-Scheduling-Algorithms

This repository contains the basic CPU Scheduling Algorithms from which an Operating System decides the sequencing or scheduling of process to be executed. All the algorithms inside are preemptive in nature, i.e. contact switching is possible. The algorithms include:

  • First Come First Serve (FCFS)
  • Shortest Job First (SJF)
  • Round Robin (RR)
  • Priority Scheduling Algorithm.

About

This repository contains the basic CPU Scheduling Algorithms from which an Operating System decides the sequencing or scheduling of process to be executed. All the algorithms inside are preemptive in nature, i.e. contact switching is possible. The algorithms include, First Come First Serve (FCFS), Shortest Job First (SJF), Round Robin and Priority Scheduling.


Languages

Language:Jupyter Notebook 56.1%Language:Python 43.9%