Question: Pls help 2. Multi-level Scheduling. A multi-level feedback queue is adopted to schedule the following processes for execution. Processes first enter the high priority queue

Pls help

Pls help 2. Multi-level Scheduling. A multi-level feedback queue is adopted to

2. Multi-level Scheduling. A multi-level feedback queue is adopted to schedule the following processes for execution. Processes first enter the high priority queue based on RR with quantum 2. A process that cannot complete its execution after a service time of 4 will be demoted to the medium priority queue based on RR with quantum 3. A process that cannot complete its execution after a service time of 6 in this queue will be demoted to the low priority queue based on FCFS. (a) Assume that Fixed Priority scheduling is adopted. Draw a Gantt chart for the process execution schedule. Compute the process waiting and turnaround time. (b) Assume that Time Slicing scheduling is adopted with a ratio of 5:3:2 in allocated time slices, in the format of 10 time units, 6 time units and 4 time units respectively on the three queues. Draw a Gantt chart for the process execution schedule. Compute the process waiting and turnaround time. Process P1 P2 P3 P4 P5 Burst Time 15 7 11 5 12 Arrival Time 0 1 2 4 6 Priority 4 3 1 2 5 2. Multi-level Scheduling. A multi-level feedback queue is adopted to schedule the following processes for execution. Processes first enter the high priority queue based on RR with quantum 2. A process that cannot complete its execution after a service time of 4 will be demoted to the medium priority queue based on RR with quantum 3. A process that cannot complete its execution after a service time of 6 in this queue will be demoted to the low priority queue based on FCFS. (a) Assume that Fixed Priority scheduling is adopted. Draw a Gantt chart for the process execution schedule. Compute the process waiting and turnaround time. (b) Assume that Time Slicing scheduling is adopted with a ratio of 5:3:2 in allocated time slices, in the format of 10 time units, 6 time units and 4 time units respectively on the three queues. Draw a Gantt chart for the process execution schedule. Compute the process waiting and turnaround time. Process P1 P2 P3 P4 P5 Burst Time 15 7 11 5 12 Arrival Time 0 1 2 4 6 Priority 4 3 1 2 5

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!