A)Given the following jobs that are to be processed on a single processor: Table 1 : Process Scheduling Process Arrival Time in ms Service Time in ms P1 0 5 P2 2 2 P3 4 9 P4 6 4 Illustrate a Gantt...

A)Given the following jobs that are to be processed on a single processor:

Table 1: Process Scheduling

1. Illustrate a Gantt chart to show the schedules for Shortest Remaining Time (SRT) and Shortest Process Next (SPN) policies.


2. Estimate the finish time, turnaround time, and normalized turnaround time for both algorithms.

 B)Consider the following set of processes:

Table 2: Process Scheduling

Perform analysis for the set of processes in Table 2 to describe Round-robin (q= 1) scheduling policies performance. In your analysis, you are required to:

i) Illustrate the execution pattern for one cycle.

ii) Estimate the finish time, turnaround time, and normalized turnaround time.

a) Discuss the performance of SRT, and Round Robin scheduling policy in terms of:

I)Throughput

ii. Response time

iii. Overhead

iv. Starvation