GitHub topics: longest-remaining-time-first
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.
Language: Jupyter Notebook - Size: 806 KB - Last synced at: over 1 year ago - Pushed at: almost 6 years ago - Stars: 1 - Forks: 5
