MODULE 5 - VIDEO 2 - MLQ and MLFQ CPU scheduling

  Рет қаралды 34,806

Tami Sorgente

Tami Sorgente

Күн бұрын

Пікірлер: 20
@codingmaterials3787
@codingmaterials3787 5 жыл бұрын
Hello Tami, Your explanation was great, but at 4:10 after 17ms the process p1 should come for execution as it was in front of the Q2 also it didn't finish it's time quantum last time, it just ran for 2ms even though the time quantum was 3ms. So now the execution sequence will be, p1--p2--p2--p1--p4--p4--p1--p5--p5--p3--p1--p3--p1.
@rohitbale15
@rohitbale15 5 жыл бұрын
Yep that's the correct sequence. You got the perfect answer buddy. Tami made the mistake.
@bekchanovj
@bekchanovj 3 жыл бұрын
p3 came first(at time 3, whereas p1 came at 12), that's why she put p3 at 17. And it didn't finish its time quantum because of the higher priority queue(for example p3 got preempted after just 1 second at time 18, although its quantum is 3 )
@davidwright66
@davidwright66 8 жыл бұрын
Hi Tami, Your video is great. It has given me a good understanding of using a multilevel queue. Thanks!!!
@baduynguyen1711
@baduynguyen1711 Ай бұрын
I need the answer of MLFQ excercise, please
@elliegahan7155
@elliegahan7155 7 жыл бұрын
Where can i get the solution for multi level feedback queue?? you only gave the answer to multi level queue
@deborabruna7141
@deborabruna7141 6 жыл бұрын
It will be, P1->P2->P3->P1->P4->P3->P2->P5->P4->P5->P1->P2->P4?
@harshamuthugannesudhakara3819
@harshamuthugannesudhakara3819 7 жыл бұрын
where can i get solution for MLFQ??
@TamiSorgente
@TamiSorgente 7 жыл бұрын
MLQ solution is located here: www.cse.fau.edu/~tami/MLQ.PNG
@aytekors741
@aytekors741 6 жыл бұрын
kzbin.info/www/bejne/fIrGlGx6bdGffJI
@aytekors741
@aytekors741 6 жыл бұрын
Thank you for explanations! :)
@preo2nd
@preo2nd 7 жыл бұрын
i don't get how you only have p1 in your ready queue when at time 10 you have p3 arriving as well
@hassuunna
@hassuunna 7 жыл бұрын
yup, you're partially right We have both P1 and P3 but hence they are the same priority you use first come first serve means you're comparing arrival time which is 3, and 4 Respectively so P1 will take the lead and run
@peter_jhondelacruz1744
@peter_jhondelacruz1744 6 жыл бұрын
what if they have same priority and same arrival time
@hassuunna
@hassuunna 6 жыл бұрын
Peter_jHon Dela cruz I asked my constructor about that and she said for processor that's nearly impossible to happen but anyone of them will work but better as a student to get them in the order of the table in problem
@hendraalexander3633
@hendraalexander3633 7 жыл бұрын
thank u tami sorgente :) very usefull for me
@aytekors741
@aytekors741 6 жыл бұрын
I used to find the solution for MLFQ on your channel but I can not find it now. Can you write the link also to the explanation part. Thanks
@aysebilgegunduz
@aysebilgegunduz 6 жыл бұрын
Answer: kzbin.info/www/bejne/fIrGlGx6bdGffJI
@TeresaSarasa
@TeresaSarasa 4 жыл бұрын
Great video! thank you
@arturo7392
@arturo7392 6 жыл бұрын
what a terrible explanation...
MODULE 5 - MLQ CPU scheduling practice
14:05
Tami Sorgente
Рет қаралды 21 М.
CPU scheduling Practice - FCFS, SJF, MLFQ
23:52
Tami Sorgente
Рет қаралды 41 М.
БОЙКАЛАР| bayGUYS | 27 шығарылым
28:49
bayGUYS
Рет қаралды 1,1 МЛН
КОНЦЕРТЫ:  2 сезон | 1 выпуск | Камызяки
46:36
ТНТ Смотри еще!
Рет қаралды 3,7 МЛН
MODULE 4 - VIDEO 1 - processes and scheduling
8:15
Tami Sorgente
Рет қаралды 22 М.
The Dome Paradox: A Loophole in Newton's Laws
22:59
Up and Atom
Рет қаралды 1 МЛН
MODULE 4 - VIDEO 2 - CPU scheduling FCFS and SJF
9:05
Tami Sorgente
Рет қаралды 16 М.
MODULE 1 - VIDEO 1 - Introduction to operating systems concept
8:22
Tami Sorgente
Рет қаралды 163 М.
What is mathematical thinking actually like?
9:44
Benjamin Keep, PhD, JD
Рет қаралды 18 М.
MODULE 14 - VIDEO 2 - disk scheduling algorithms
9:08
Tami Sorgente
Рет қаралды 23 М.
MODULE 2 - VIDEO 1 - operating system design
7:49
Tami Sorgente
Рет қаралды 35 М.
MODULE 3 - VIDEO 1 - process concept
8:09
Tami Sorgente
Рет қаралды 29 М.
MODULE 3 - VIDEO 2 - operations on processes
9:18
Tami Sorgente
Рет қаралды 28 М.