1,828 views
1 1 vote
Is the statement true or false?

With a MLFQ scheduler, high priority jobs have longer time slices than low priority jobs.

2 Answers

1 1 vote
No,this statement is false because in MFQS the job who has less cpu burst time have higher priority .this schemes leaves I/O bound job and interactive process in the higher priority queues.
1 1 vote
No its wrong in multi level feedback queue the process with different cpu burst time are placed in separate queues,, I/o bound process is given higher priority and hence present in higher queues and when they complete io execution they make transition to lower level queues  and cpu boung process are gievn lower priority and placed in lower level queues
Position:
Show:

Related questions

3 3 votes
0 0 answers
1.1k
1.1k views
rdxrohit asked Dec 31, 2022
1,082 views
Consider the following set of processes, and schedule them using the Multi-levelf eedback queue CPU scheduling algorithm as used in UNIX SVR3.P's CB AT Base P...
5 5 votes
2 2 answers
235
235 views
GO Classes asked Aug 14
235 views
A virtual-memory system has:$48$-bit virtual addresses $32$ KB pages $32$ TB physical memory Two-level page tables Both levels stored in physical memory Every second-leve...
4 4 votes
1 1 answer
116
116 views
GO Classes asked Aug 10
116 views
Consider the $\text{x86-64}$ architecture.Assume:Pages are $4$ KB Each page-table entry is $8$ bytes Each page-table page contains $512$ entries The page-table structure ...
3 3 votes
2 2 answers
152
152 views
GO Classes asked Aug 10
152 views
Consider a system with:Two-level page tables$42$-bit virtual addresses$40$-bit physical addresses $8$-byte page-table entries $64$ KB pages $64$ KB page tables at each le...