If the scheduler is running MLFQ with 3 queues – high, middl…

If the scheduler is running MLFQ with 3 queues – high, middle, and low – and the timeslice for each queue is 1 second with no boosting, what will the queues look like after 6 timesteps have completed with the above workload?  Each queue uses the same tie breaker policy as indicated above.

Recall the initial rules for MLFQ are: If Priority(A) > Pri…

Recall the initial rules for MLFQ are: If Priority(A) > Priority(B) then A runs If Priority(A) == Priority(B) then A&B run in RR Jobs start at top priority If a job uses its whole time slice then it is demoted These initial rules had several problems and needed to be changed.  What is one problem with these initial rules and the modification that was made to correct for this problem?

A workload of 5  jobs is being scheduled on a single-cpu sys…

A workload of 5  jobs is being scheduled on a single-cpu system with a timeslice of 1 second.  The jobs do not perform any IO, just compute.  The jobs’ arrival times and lengths are shown in the table below.  If the scheduler has a choice the job that arrives earlier is selected.  If there still is a choice the job that comes first alphabetically is selected.