Skip to content
#

longest-remaining-time-first

Star

Here is 1 public repository matching this topic...

LRTF-Scheduling

iamjatinchauhan / LRTF-Scheduling

Star 1

Longest Remaining Time First is a scheduling Algorithm used by operating system to schedule the incoming processes so that they can be executed in a systematic way. This algorithm schedules those processes first which have the longest processing time remaining for completion.

operating-system gantt-chart scheduling-algorithms cpu-scheduling-algorithms lrtf-scheduling longest-remaining-time-first
  • Updated Jul 21, 2019
  • Jupyter Notebook

Improve this page

Add a description, image, and links to the longest-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 longest-remaining-time-first topic, visit your repo's landing page and select "manage topics."

Learn more