Skip to content
#

shortest-remaining-time-first

Here are 8 public repositories matching this topic...

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

  • Updated Jan 9, 2023
  • C

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

  • Updated Oct 26, 2023
  • C

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

  • Updated Jul 11, 2022
  • C

Improve this page

Add a description, image, and links to the shortest-remaining-time-first topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the shortest-remaining-time-first topic, visit your repo's landing page and select "manage topics."

Learn more