10.3. Homework - Analysis of Schedulers¶
Consider the following table showing arrival times and service times for a set of static processes. Draw a chart illustrating their execution and compute the average turnaround time and average response time using the following scheduling algorithms. (See Scheduler Metrics)
Round Robin Scheduler with time quantum = 10
Process
Arrival Time
Service Time
A
0
21
B
5
9
C
23
30
D
26
10
E
30
15
Now consider a Multi-level Priority Queue Scheduler with 3 queues. The scheduler uses time quantum of 5 15 20 for the three queues. The following table shows processes that will block for I/O a few times before completing. The table shows the arrival times, service times and following blocked times for a set of processes. Draw a chart illustrating their execution and compute the average turnaround time, average response time and average waiting time. (See Scheduler Metrics)
Process
Arrival Time
Service Time
Blocked Time
A
0
12
10
8
69
70
B
5
9
4
3
8
53
48
69
C
23
30
25
20
70
65
D
26
10
15
11
77
89
E
30
12
18
3
3
4
6
55
60
65
56
47
