Processor Scheduling

Consider the following set of processes.

Process Name	Arrival Time	Processing Time
A	0	3
B	1	5
C	3	2
D	9	5
E	12	5

Five processes (A through E) arrive to system with one processor at arrival times shown in the above table. The figure also gives the CPU time that each process requires. Show the execution sequence for the processes. Compute finish time, turnaround time, and normalized turnaround time of each process for the following scheduling algorithms:

1. First Come First Served (FCFS)
2. Round Robin with quantum=1 and quantum=4.
3. Shortest Process Next (SPN)
4. Shortest Remaining Time (SRT)
5. Highest Response Ration Next (HRRN)