2.10 - SRTN (Shortest Remaining Time Next) Scheduling Algorithm

  Рет қаралды 22,293

Darshan University

Darshan University

Күн бұрын

This video explains Shortest Remaining Time Next (SRTF) Scheduling Algorithm with example, Process Scheduling Algorithm, Advantages and Disadvantages of Shortest Remaining Time Next (SRTF) and how to draw Grantt Chart and How to find out average turnaround time and average waiting time.
Learn Shortest Remaining Time Next (SRTN) Scheduling Algorithm with animation and examples.
Shortest remaining time, also known as shortest remaining time first (SRTF), is a scheduling method that is a preemptive version of shortest job next scheduling. In this scheduling algorithm, the process with the smallest amount of time remaining until completion is selected to execute. Since the currently executing process is the one with the shortest amount of time remaining by definition, and since that time should only reduce as execution progresses, processes will always run until they complete or a new process is added that requires a smaller amount of time.
Operating System PPTs with animation is available here: www.darshan.ac....
This video is recorded by Prof. Firoz Sherasiya (firoz.sherasiya@darshan.ac.in, +91-9879879861) at Computer Engineering Department of Darshan Institute of Engineering & Technology, Rajkot as per GTU Syllabus.
GTU - Computer Engineering (CE) - Semester 4 - 2140702 - Operating System- Process Management- Shortest Remaining Time First (SRTF) Scheduling Algorithm
Darshan Institute of Engineering & Technology, Rajkot is a leading institute offering undergraduate, graduate and postgraduate programs in engineering. The Institute is affiliated to the Gujarat Technological University (GTU) and approved by the AICTE, New Delhi.
Visit us: www.darshan.ac.in
Write us: info@darshan.ac.in
Facebook: / darshaninstitute.official
Twitter: / darshan_inst
Instagram: / darshan_inst

Пікірлер: 15
@daxmistry4648
@daxmistry4648 3 жыл бұрын
Thank you buddyy...
@pd6805
@pd6805 6 жыл бұрын
Is SRTF and SRTN the same?
@hristoplamenov1942
@hristoplamenov1942 6 жыл бұрын
Very good question!
@firozsherasiya2741
@firozsherasiya2741 6 жыл бұрын
yes
@Himricks
@Himricks 5 жыл бұрын
What if arrival time of 2 process are same
@yagnikpatel4404
@yagnikpatel4404 4 жыл бұрын
Take the first load process first
@Alextauren1
@Alextauren1 6 жыл бұрын
Thanks buddy, very helpful video :)
@chrisjenifer668
@chrisjenifer668 2 жыл бұрын
Shortest remaining time next(SRTN) is non-preemptive, then how do you say it's preemptive sir?
@webdevelopmentsolution2052
@webdevelopmentsolution2052 2 жыл бұрын
preemptive version of SJF and SRTN is preemptive.
@patelnisarg5627
@patelnisarg5627 3 жыл бұрын
Plz change the faculty
@patelnisarg5627
@patelnisarg5627 3 жыл бұрын
😭
@tathya551
@tathya551 5 жыл бұрын
Sir may I go to washroom ?
@slip-shape994
@slip-shape994 3 жыл бұрын
kaatke phenk de ganga main
2.11 - RR (Round Robin) Scheduling Algorithm
10:51
Darshan University
Рет қаралды 8 М.
Shortest Job First (SJF) | #Betriebssysteme
4:57
Florian Dalwigk
Рет қаралды 9 М.
Support each other🤝
00:31
ISSEI / いっせい
Рет қаралды 81 МЛН
BAYGUYSTAN | 1 СЕРИЯ | bayGUYS
36:55
bayGUYS
Рет қаралды 1,9 МЛН
Stanford Seminar - Stanford Robotics Center Introduction
1:04:00
Stanford Online
Рет қаралды 1,1 М.
Lec12:SRTN(Shortest Remaining Time Next)Preemptive of SJF
17:05
Engineering Wing
Рет қаралды 10 М.
Preemptive Shortest Job First (SRTF) - CPU Scheduling
16:57
Mifta Sintaha
Рет қаралды 263 М.
Round Robin Scheduling Deutsch | #Betriebssysteme
4:32
Florian Dalwigk
Рет қаралды 36 М.
SRTF (Shortest Remaining Time First)
8:50
johncctang
Рет қаралды 157 М.
Support each other🤝
00:31
ISSEI / いっせい
Рет қаралды 81 МЛН