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