first-come-first-serve

simulating scheduling algorithms of operating system for processes e.g. Priority Scheduling, Multi Level Scheduling, ...

Modern improvements for MIT's xv6 OS

programs for Scheduling Algorithms like FCFS, Round Robin, SJF and Priority Scheduling of Operating System in C.

CPU scheduling algorithm program to calculate processes' process time

Solve and simulate using preemptive and non-preemptive algorithm based on the user’s input (Memory & Process Management).

This is a collection of main algorithms from the operating system concepts book.

CPU scheduling algorithm simulator which simulate following algorithms First Come First Served (FCFS) , Shortest Job First (SJF) , Shortest Remaining Time First(SRTF) ,Round Robin(RR)

This repository contains the Python Programs for various algorithms of Operating Systems

Here are some scheduling algorithms written in Python. Input is given using the file. First line of the file is the number of processes and then in each line arrival times are written in ascending order. After arrival time corresponding Burst times are written in each line separately.

Basic OS Programs - CPU Scheduling & Page Replacement

List of different Scheduling Algorithms

A multi-threaded implementation of an operating system kernel with options for 4 different scheduling algorithms.

CPU Scheduler Simulator Project

ERTS course Final Project

Implementation of scheduling algorithms (Round Robin, SJF, Priority, FCFS) and deadlock avoidance algorithm(Banker's Algorithm)

CPU Scheduling Algorithms in C++

OS lab practical Experiments

A CPU-scheduling simulation with memory and I/O management 📋

An implementation of various CPU scheduling algorithms in C++. The algorithms included are First Come First Serve (FCFS), Round Robin (RR), Shortest Process Next (SPN), Shortest Remaining Time (SRT), Highest Response Ratio Next (HRRN), Feedback (FB) and Aging.