(6+2+2 points) The following processes are being scheduled using a preemptive, priority-based, round- robin scheduling algorithm. Processes Arrival time Service time Priority P₁ 0 3 8 P2 0 4 3 P3 4 4 4 P4 8 4 4 P5 P6 5 5 5 5 15 18 Each process is assigned a numerical priority, with a higher number indicating a higher relative priority. The scheduler will execute the highest priority process. For processes with the same priority, a round- robin scheduler will be used with a time quantum of 3 time units. If a process is preempted by a higher-priority process, the preempted process is placed at the end of the queue. (a) Show the scheduling order of the processes using a Gantt chart. (b) What is the turnaround time for each process? (c) What is the waiting time for each process?

Pre-emptive vs noND-pre-emptive scheduling should be distinguished.

Critical Sections - Select all of the following statements that are true A critical section is a segment of code in which a process has write-access to data or resources that are shared with at least one other process. Every process waiting to enter a critical section must be allowed to enter it at some point. No eternal waiting must be possible. In a system consisting of n processes, a critical section protected by a mutex variable can be accessed by more than one process at a time. A process not executing in a critical section must not prevent other processes from entering the critical section. Critical sections must never contain data shared by multiple processes. O DELL W

Assignment Scheduling Given the following processes. Process Burst Time P1 17 P2 5 P3 12 Using Round Robin (RR) scheduling with time quantum q=4, What is the average turnaround time?

Assume that there are the following processes in the deadline scheduler queue: Process Arrival Runtime Period Deadline 1 0 2 12 10 2 2 4 20 16 3 4 3 15 14 Complete the following schedule so each of the processes adheres to the deadline policy by replacing a dot with a process number (as necessary): TIME: 01234567890123456789012345678901234567890123456789 PROCESS: 112222333.......................................

Here are the top five (5) factors that should be considered while formulating a process scheduling policy.

Describe the concept of "preemptive scheduling."

Bounded waiting requires that \A bound must exist on the number of times that other processes are allowed to enter their critical sections a) true  b) false

Create the Gannt Chart for preemptive and non-preemptive Priority Scheduling b. Computer for the average turn around time and average waiting time for preemptive ang non preemptive scheduling. c. What process is being executed at time 10 in preemptive scheduling. d. What process is being executed at time 10 in non - preemptive scheduling. e. What process is being executed at time 4 in preemptive scheduling. f. What process is being executed at time 4 in non - preemptive scheduling. g. What process is being executed at time 5 in preemptive scheduling. h. What process is being executed at time 5 in non - preemptive scheduling. Process    Arrival Time-    Burst Time    PriorityP1 -               0               5                     3P2               4                   2                     2P3 -             6                  3                     1P4 -            8                   4                     5P5 -           7                    7                      7P6 -         3…

Assignment Scheduling Given the following processes. Process Burst Time P1 17 P2 P3 12 Using Round Robin (RR) scheduling with time quantum q=4, Draw the Gantt chart for the RR scheduling. ABC