longest-remaining-time-first
There are 1 repositories under longest-remaining-time-first topic.
iamjatinchauhan/LRTF-Scheduling
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.