SRTF(Shortest Remaining Time First) || CPU Scheduling Algorithm (Hindi) in OS || MCS-041
SRTF(Shortest Remaining Time First) or SRTN(Shortest Remaining Time Next) is the preemptive version of SJF Algorithm.
Advantage:
1- Short processes are handled very quickly.
2- The system also requires very little overhead since it only makes a decision when a process completes or a new process is added.
3- When a new process is added the algorithm only needs to compare the currently executing process with the new process, ignoring all other processes currently waiting to execute.
Disadvantage:
1- Like shortest job first, it has the potential for process starvation.
2- Long processes may be held off indefinitely if short processes are continually added.
-------------------------------------------------------------------------------------------------------
Contact Details:
Contact Details:
Email: srn.program.1111@gmail.com
facebook: https://www.facebook.com/ExamAasaanHai
Twitter: https://twitter.com/SRN9999
WhatsApp: 8820406278
Видео SRTF(Shortest Remaining Time First) || CPU Scheduling Algorithm (Hindi) in OS || MCS-041 канала Exam Aasaan Hai !!!
Advantage:
1- Short processes are handled very quickly.
2- The system also requires very little overhead since it only makes a decision when a process completes or a new process is added.
3- When a new process is added the algorithm only needs to compare the currently executing process with the new process, ignoring all other processes currently waiting to execute.
Disadvantage:
1- Like shortest job first, it has the potential for process starvation.
2- Long processes may be held off indefinitely if short processes are continually added.
-------------------------------------------------------------------------------------------------------
Contact Details:
Contact Details:
Email: srn.program.1111@gmail.com
facebook: https://www.facebook.com/ExamAasaanHai
Twitter: https://twitter.com/SRN9999
WhatsApp: 8820406278
Видео SRTF(Shortest Remaining Time First) || CPU Scheduling Algorithm (Hindi) in OS || MCS-041 канала Exam Aasaan Hai !!!
Показать
Комментарии отсутствуют
Информация о видео
Другие видео канала
L-2.5: Shortest Remaining Time First (SJF With Preemption) Scheduling Algorithm with Example | OSRound Robin Algorithm in Hindi with Solved Example | Operating System Lectures in HindiSRTF: Example-2 || CPU Scheduling Algorithm (Hindi) in OS || MCS-041Smallest Remaining Time First (SRTF) | Operating System | GATE CS/IT #RavindrababuRaulaShortest Remaining Time First(SRTF) Scheduling Algorithm with Example | Operating SystemShortest Remaining Time First (SRTF) Scheduling Algorithm | SJF With Preemption | ExampleShortest Remaining Time First Scheduling Algorithm || SRTF || Preemptive || Operating Systems || OSRound Robin | CPU Scheduling Algorithm [Hindi]FCFS(First come First serve) | CPU Scheduling Algorithm [Hindi]SRTF (Shortest Remaining Time First) in Operating System in Hindi Lec-17L-2.4: Shortest Job First(SJF) Scheduling Algorithm with Example | Operating SystemDeadlock In Operating System | Necessary Condition for Deadlock | Explain in HindiOPERATING SYSTEM - SJF Preemptive ( Shortest Job First )L-2.7: Round Robin(RR) CPU Scheduling Algorithm with ExampleFCFS CPU Scheduling algorithm6.6- Fragmentation- Internal And External Fragmentation In Memory Management In Operating SystemFIFO,LRU AND OPTIMAL PAGE REPLACEMENT ALGORITHMS | OPERATING SYSTEMSCPU Scheduling Algorithm- Round RobinShortest Remaining Time First(SRTF) With IO Burst | Process Scheduling