Sqrt OS is a simulation of an OS scheduler and memory manager using different scheduling algorithms including Highest Priority First (non-preemptive), Shortest Remaining Time Next, and Round Robin
-
Updated
Jan 17, 2021 - C
Sqrt OS is a simulation of an OS scheduler and memory manager using different scheduling algorithms including Highest Priority First (non-preemptive), Shortest Remaining Time Next, and Round Robin
📢A CPU scheduler determines an order for the execution of its scheduled processes. Operating System Scheduler decides which process will run according to a certain data structure that keeps track of the processes in the system and their status.
Repository that simulates SRTN, HPF, and RR scheduling algorithms.
An Operating System scheduler schedule processes using three algorithms Non-preemptive, Round Robin (RR), Highest Priority First (HPF) and Shortest Remaining time Next (SRTN), and handle memory allocation using buddy memory allocation system
A CPU scheduler determines an order for the execution of its scheduled processes. using three algorithms Non-preemptive Highest Priority First (HPF) Shortest Remaining time Next (SRTN) & Round Robin (RR) and include memory allocation capabilities using the buddy memory allocation system
Implementing basic CPU scheduling algorithms from text file input.
CSOPESY T1 AY 2023-2024 // Implementation of FCFS, SJF, SRTF, Round Robin CPU Scheduling Algorithms
Fedorix OS is a simulation of an OS scheduler and memory manager using different scheduling algorithms including Highest Priority First (non-preemptive), Shortest Remaining Time Next, and Round Robin.
Add a description, image, and links to the shortest-remaining-time-first topic page so that developers can more easily learn about it.
To associate your repository with the shortest-remaining-time-first topic, visit your repo's landing page and select "manage topics."