Get Certification in Complete Operating System: www.tutorialspoint.com/operating_system/index.asp Use coupon ""RUclips12"" to get “FLAT 12%’’ OFF at Checkout.
According to you, there can't be any process in case of MLFBQ scheduling which directly goes to the FCFS(high priority) queue? That isn't the case. MLFBQ is the same as MLQ just that processes from low-priority queues will rise to the higher-priority levels in the longer run, hence ensuring NO-STARVATION.
Regarding the Multilevel Feedback Queue Scheduling, it is not clear to me what happens to a process that starts in the RR q=8, what if the process encountered a page fault? Then it didn't finish running, so it goes to the beginning of the first queue? because it didnt finish running... so it cant go to the second queue Is that correct?
Sir,can you please help me with this problem,it's really urgent. Write a program for multilevel queue scheduling algorithm. There must be three queues generated. There must be specific range of priority associated with every queue. Now prompt the user to enter number of processes along with their priority and burst time. Each process must occupy the respective queue with specific priority range according to its priority. Apply Round robin algorithm with quantum time 4 on queue with highest priority range. Apply priority scheduling algorithm on the queue with medium range of priority and First come first serve algorithm on the queue with lowest range of priority. Each and every queue should get a quantum time of 10 seconds. Cpu will keep on shifting between queues after every 10 seconds i.e. to apply round robin algorithm OF 10 seconds on over all structure. Calculate Waiting time and turnaround time for every process. The input for number of processes should be given by the user.
Get Certification in Complete Operating System: www.tutorialspoint.com/operating_system/index.asp
Use coupon ""RUclips12"" to get “FLAT 12%’’ OFF at Checkout.
Thank u sir it help me a lot
According to you, there can't be any process in case of MLFBQ scheduling which directly goes to the FCFS(high priority) queue?
That isn't the case. MLFBQ is the same as MLQ just that processes from low-priority queues will rise to the higher-priority levels in the longer run, hence ensuring NO-STARVATION.
Wonderful! Thank you very much!
thanks sir🌷🌷
kindly share lecture of virtual round robin and round robin with i/o
Regarding the Multilevel Feedback Queue Scheduling, it is not clear to me what happens to a process that starts in the RR q=8, what if the process encountered a page fault?
Then it didn't finish running, so it goes to the beginning of the first queue? because it didnt finish running... so it cant go to the second queue
Is that correct?
great sir
Thnku sir
Sir please explain in thelugu
Sir,can you please help me with this problem,it's really urgent. Write a program for multilevel queue scheduling algorithm. There must be three queues generated. There must be specific range of priority associated with every queue. Now prompt the user to enter number of processes along with their priority and burst time. Each process must occupy the respective queue with specific priority range according to its priority. Apply Round robin algorithm with quantum time 4 on queue with highest priority range. Apply priority scheduling algorithm on the queue with medium range of priority and First come first serve algorithm on the queue with lowest range of priority. Each and every queue should get a quantum time of 10 seconds. Cpu will keep on shifting between queues after every 10 seconds i.e. to apply round robin algorithm OF 10 seconds on over all structure. Calculate Waiting time and turnaround time for every process. The input for number of processes should be given by the user.
Sir ye video Hindi samjhaye to jyada better samjh me ayega