L-2.11: Multilevel Feedback Queue Scheduling | Operating System

[@sanidhamohit7816]

Great personality... I m fan of your teaching sir..

[@HarjotSaini-ro9ry]

FR sir nu Bund v de ayi

[@sharondsouza8054]

I really love how you teach!!! Amazing work!!! Keep going

[@beautifultech7461]

Sir really u r doing good work for student.....I feel also that ur videos is more convenient than other...so pls be continue sir...

[@Good._.vibe_zz]

Speechless....hats off to you sir ❤

[@kartikpurohit7457]

Sir aapke saare videos bohot ache se samaj aaye or exam m bhi bohot help karenge aapne har ek topic ko clearly explain kiye iske liye thanku so much

[@daudraza604]

Your all videos are very informative and fully prepared.Easy teaching method. Thankyou Soo Much sir..

[@sauravkumarsonu829]

In morning there is my exam and I am watching here to complete the schedule algorithm in night before exam😁🙏

[@thepriestofvaranasi]

@Grant Clyde so please fcuk off from here bot.

[@thepriestofvaranasi]

Zyaire Melvin, you too btich, fcuk Outta here.

[@rupindersingh1312]

Same here

[@sudhanshuranjankar4763]

Ye toh kuch bhi nahi, 3 bje mera exam hai mai 11 bje start kia

[@maiterahero6968]

Same 🙃🙃

[@shubhamrajput9363]

सर आपको बिना कुछ दिए इतना पड़ने को मिल रहा है धन्यवाद

[@dipalikumari7777]

Sir mai aapke videos dekhne k pehle hi like kar deti hu kyuki aapke Sare video bht ache hote hai

[@yunusmohamed2221]

i have an OS exams tomorrow, and so far i have learnt alot more than i had, going through the 9 pdfs sent by the lecturer, thank you so much sir

[@trndsttr7585]

FAST grindset.

[@rahul_23]

believe me bro you are much much better than our OS professor.

[@utsavtaliyan7395]

I think the processes move from higher to lower priority after their time quantum execution From the gfg article 1) When a process starts executing the operating system can insert it into any of the above three queues depending upon its priority. For example, if it is some background process, then the operating system would not like it to be given to higher priority queues such as queue 1 and 2. It will directly assign it to a lower priority queue i.e. queue 3. Let’s say our current process for consideration is of significant priority so it will be given queue 1. 2) In queue 1 process executes for 4 units and if it completes in these 4 units or it gives CPU for I/O operation in these 4 units then the priority of this process does not change and if it again comes in the ready queue then it again starts its execution in Queue 1. If a process in queue1 does not complete in 4 units then its priority gets reduced and it shifted to queue 2. 3) Above points 2 and 3 are also true for queue 2 processes but the time quantum is 8 units. In a general case if a process does not complete in a time quantum then it is shifted to the lower priority queue. In the last queue, processes are scheduled in an FCFS manner. A process in a lower priority queue can only execute only when higher priority queues are empty. A process running in the lower priority queue is interrupted by a process arriving in the higher priority queue.

[@AhsanFaraz-p1w]

Exactly

[@CellerCity]

But the problem of starvation isn't fully solved, based on your argument(Or the GFG's article). Let's say we have a kernel process that has been shifted down to the Least priority queue, as time has passed. And a virus keeps running a program in higher priority that runs for 3.99 s and goes for 0.1 s of IO, THUS occupying the queue1 COMPLETELY! And our poor little kernel process in the last queue is left for STARVATION. Maybe the actual OS's use some advanced algorithms based on this skeleton. I think we if we allow the last priority queue to promote processes to the highest/higher priority queue, then this STARVATION could be reduced.

[@utsavtaliyan7395]

@@CellerCity I will have to study again to get the full context, but I think from what I can understand, you explained a new potential case with a good example.

[@ishanpand3y]

Thank you so much sir for making these things too easy to understand...

[@anuradha7700]

Ap jaise teacher agar har jageh ho ... To koii student fail nn hogaa 😍👌👍

[@rahulyamakanamardi393]

i have watched the complete series of 59 videos , awaesome explanation, nice work., really superb.

[@anjuyadav6602]

Sir aap bahut acha smjhate ho, tq sr

[@haiderabidi5277]

You are a very good teacher...

[@Akash-do2vb]

Thank you sir very much ❤, You completed my whole sem 1 topic in 1 hr 🎉, keep uploading content , may God fulfill all your dreams 😄

[@shivansh.speaks]

thank you sir , now i have understood clearly about cpu scheduling algorithms.

[@ManpreetKaur-bo1pb]

thnku sir aap bahut acha smjhate ho har ek baat clr ho jati hai

[@garrysandhu4197]

Best explanation sir thanks.

[@hamzasiddiqui9102]

Thanks bhai ! Respect from Pakistan! 👌

[@upasonabiswas6783]

Thank you so much sir!! You are the best! :)

[@shahidariaz4038]

Great work sir very understanding method

[@monikachaudhary1488]

Awesome explanation sir g

[@rekildo]

Nicely Explained Bro. 👍

[@theennovators]

Nice work Sir! Keep it up please.

[@14_aditigupta74]

Thanq sir for explaining every topic in very easiest way...... thnx a lot sir ☺️🙌🏻🙌🏻✨✨

[@dodsa247]

thank you !!! you really help a lot in OS I am having good grades in OS only because of you

[@funwithbunny03]

Best channel for prepare whole subject a day before exam

[@deepthiraghu3640]

sir,aap kafii accha padhate hai!!

[@preetmaan7429]

Apke thnq bolne ki way bht cute h sir

[@AdithyaNayak1706]

thank you so much sir , your explainations are so good and understanding 🙏🙏 i am happy that i watched your videos at first 😍😇 no lectures can teach like you once again thank you sir 😊😊

[@jagpreetdhaliwal7351]

Thnku sir your lectures are very useful for me

[@muhamadtalhach]

JazakAllah--(May Allah reward you) for your efforts

[@shivangbhawsar362]

The highest priority queue should be at the top and the lowest one at the bottom, otherwise the problem of starvation won't be resolved.

[@mubasharshehzad861]

sir really very well..ur method is zbrdst

[@bhoomi1492]

Very Helpful !👍

[@souravsinha18]

Thank you very much How can the process in ready queue 1 be executed for 2 TQ if only high priority processes are entering in the cpu... please explain sir....

[@MuhammadWaqas-hz7ej]

Thanks Sir for such a great lecture...

[@shalinij1920]

Well explained video sir.Thank you so much sir

[@sreejasree7427]

Thank you 😊 sir

[@DileepKumar-oi2gb]

tomorrow my exam but i have no idea for scheduling algorithms but sir your playlist more better for scheduling algorithms thank you so much sir 🤗❤💘

[@simransingh6137]

Thank you sir for such esay explanation

[@shraddhagupta5756]

sir your videos are awesome.. great work sir :-)

[@apoorvdiwan8042]

Sir mzza agya tuadi teaching da . Tusi chandigarh te hu .

[@mixevercool5479]

Nice video ☺️☺️☺️

[@shubhamdhiman2117]

Thank you sir . I could easily understand this topic .

[@vsk9630]

Thank you sir for this lecture 👌👌👌

[@ShakilAhmed-cs7nj]

Thank you sir for teaching us... And one request Sir plz provide notes for theory mai dikkat hoti h

[@keystosuccess519]

sir keep uploading your videos in hindi your videos are very very..............................................................................................................................................................................helpful.

[@osamamughal2707]

Perfect Explanation

[@keshavchoubey5260]

thank you sir, carry on the good job

[@PoonamYadav-ed5wm]

Sir aap bhaut acha pdate ho thnku sir

[@harmanjeetsarwara8931]

Really helpful thanku sir

[@bhaveshkumar6842]

Great explanation as always! ❤

[@abhishekm6374]

Today is my xam and watching the video before entering the exam hall. 😌💥

[@shashikiran4059]

Nice video sir

[@mohammadsaadkhan5309]

Thanks, loved your video.

[@shaistabashir970]

Best teacher 👌👌

[@Shivanisharma-mi7gy]

Ooooooooooooooooph

[@004_sreelemonchandramohont9]

sir, take my love & respect

[@sajiiidali]

Excellent

[@aadiexplains6234]

Process Priority Arrival Time Service/Burst Time A 3 (Silver) 0 4 B 2 (Gold) 0 8 C 1 (Diamond) 1 1 D 2 (Gold) 6 11 E 1 (Diamond) 6 3 Sir Please draw a gantt chart of multi level feedback queue for above data where q=4

[@kartikeysrivastava6640]

Best... Thank you Sir

[@prashanthi8492]

Sir,how the lowest level priority jobs get executed In ready queues? Is it a Parellel processing? Or Not execution ,but waiting time?

[@a20rahuljawale68]

It's a process having low priority it'll run as any process

[@lovepandit7234]

Great🤗

[@vasubhatt6160]

ye process queue me kese execute ho ri hai?? CPU to mila hi nai abhi.

[@technopathkeshav7835]

Same doubt

[@Madrista21]

CPU ek h Bhai or queue multiple h

[@viveknegi1610]

Os kar raha hai ..

[@viveknegi1610]

@@vasubhatt6160 yar pata nahi kab likha tha....

[@vasubhatt6160]

@@viveknegi1610 koi nai brother , I'll remove my reply. No hate.. :)

[@aartimehra7709]

ur videos are very helpful for me , so i request you pls.. make videos more all topics of operating system based on syllabus if b.tech computer science

[@RajKumar-gr3il]

How the process is getting executed in lowest priority queue ? the problem was starvation time that it wasn't getting its turn to get executed. But if it is getting exexuted for time quantum 2 then how is it starving??

[@Got_Wings]

M ur regular student sir👏😁❤️❤️❤️❤️ thanks sir u r osummmmm

[@sonykumari4499]

Thank u so much sir😊🤗

[@SanketSharmasanket7317]

awesome

[@waqaskazmi3286]

Great

[@misstopper1]

Thank You Sir

[@igneous8k]

GOD! Sir Ji

[@omyrazeem2571]

Makes every topic too easy to understand.

[@bjeetsethi5088]

u r so good Varun

[@vinayaksharma-ys3ip]

Thank You Sir so much!!

[@abhaychaturvedi4706]

U r saviour

[@aadhartoshniwal2772]

How is this algorithm not having starvation. As we have to insert the processes in the top queue and no process in the lower queues will get executed until the top queue is empty. If the process having burst time 2 keeps coming they will get terminated and the processes in the lower level queues will never get executed. Hence starvation. Can you explain sir?

[@ashishkumarsingh6618]

Watch this video again, i think you may catch it.

[@EBKCS_MOKSHASHARMA]

execution time is the time during which a program is running and running means providing cpu to that particular program , then how execution is performing in ready queue so that by completing the time quantum , execution time is decreasing ?

[@lakshyakumar8337]

You are saying process came in lower priority queue will run till the time quantum decided and so on but how it removed the problem of starvation, Cpu will always execute the higher priority first and if higher priority processes keeps on coming then Cpu will not move to lower priority queue thus that process will not run even for time quantum decided. So how this removed the problem of starvation according to you?

[@fahadmaqsood5636]

THanks SIR respect from pakistan

[@PankajKumar-cw6rs]

Amazing sir...

[@asheeshyadav5519]

Great bhai

[@PradeepKumarIIITD]

very well explained...

[@codingwithsam4992]

I guess priority ordering is incorrect or reverse. Read this part from book. queue 0 is top most queue queue 1 is below queue 2 below A process entering the ready queue is put in queue 0. A process in queue 0 is given a time quantum of 8 milliseconds. If it does not filcish within this time, it is moved to the tail of queue 1. If queue 0 is empty, the process at the head of queue 1 is given a quantum of 16 milliseconds. If it does not complete, it is preempted and is put into queue 2. Processes in queue 2 are run on an FCFS basis but are run only when queues 0 and 1 are empty. This scheduling algorithm gives highest priority to any process with a CPU burst of 8 milliseconds or less. Such a process will quickly get the CPU, finish its CPU burst, and go off to its next I/0 burst. Processes that need more than 8 but less than 24 milliseconds are also served quickly, although with lower priority than shorter processes. Long processes automatically sink to queue 2 and are served in FCFS order with any CPU cycles left over from queues 0 and 1.

[@abubakarrahim8950]

thankew brother it was very helpful :)

[@GateSmashers]

Thank you so much for your love and support. Bless you.

[@GAU-C--RATNAKANTAHANSE]

Thank you sir......

[@prathyushhebbar1583]

good explanation

[@ashiibansal1725]

Supb session

[@ashmitasaha4681]

Thank u so much Sir.....Sir plz upload file system and I/O management part

[@sajansekhu8785]

thnkk u so much sir ji..

[@shabirbaloch-sp9fx]

Tommarrow is my exam.😅

[@Sairmasih]

Good Maza karo🎉😂

[@gena8414]

I think you have drawn the diagram upside down. Multilevel Feedback-Queue Scheduling Algorithm - KZbin this video has the correct diagram.

[@priyankaghanghas2237]

But galvin says this method is also used to determine when to demote a higher priority process to a lower priority queue and u are saying that it works with low priority processes only.

[@feelingsshare1882]

Dear Sister it doesn't works with lower priority processes it works for lower priority processes to getting CPU by ageing technique

[@abhaychaturvedi4706]

Sir , in college , there is numerical question based on this topic , plz make a video on numerical part , also on stride scheduling

[@111rhishishranjan2]

Yes yes please make the video

[@namitsharma3449]

Thanks sir g

[@satishkhode26]

Sir, In today's processor, do we use the multi-level feedback queue technique? If not, which technique/algorithm do we use?

[@UjjawalAggarwal]

really good