Phạm Văn Hiếu - 18020502

Chapter 2 – Exercises
1. APPLY THE CPU SCHEDULING ALGORITHMS: FCFS, NON-PREEMPTIVE STF, SRTF
(PREEMPTIVE STF), ROUND-ROBIN (WITH TIME QUANTUM=12) FOR FOLLOWING
QUEUES.

1.1 GIVEN THE LIST OF THE PROCESSES IN THE FOLLOWING QUEUE IN THE FORM OF DURATION P1 (45),
P2(23), P3(10), P4(3), P5(17)
- FCFS:
Suppose that the processes arrive in the order: P1, P2, P3, P4, P5
The Gantt chart for the schedule is:

P1 P2 P3 P4 P5
0 45 68 78 81 98

- Non-preemptive STF and preemptive STF with the same arrival time have the same Gantt chart:
 Process Arrival Time Duration
P1 0 45
P2 0 23
P3 0 10
P4 0 3
P5 0 17
Gantt chart:

P
P3 P5 P2 P1
4
0 3 13 30 53 98
- Round Robin:
Suppose that the processes arrive in the order: P1, P2, P3, P4, P5
Gantt chart:

P1 P2 P3 P4 P5 P1 P2 P5 P1 P1
0 12 24 34 37 49 61 72 77 89 98

1.2 GIVEN THE LIST OF THE PROCESSES IN THE FOLLOWING QUEUE IN THE FORM OF DURATION P1 (4), P2(45), P3(5), P4(33),
P5(71)
- FCFS:

Suppose that the processes arrive in the order: P1, P2, P3, P4, P5
The Gantt chart for the schedule is:

P
P2 P3 P4 P5
1
0 4 49 54 87 158
- Non-preemptive STF and preemptive STF with the same arrival time have the same Gantt chart:

2
 Process Arrival Time Duration
P1 0 4
P2 0 45
P3 0 5
P4 0 33
P5 0 71
Gantt chart:

P P P4 P2
P5
1 3
0 4 9 42 87 158

- Round Robin:
Suppose that the processes arrive in the order: P1, P2, P3, P4, P5
Gantt chart:

P1 P2 P3 P4 P5 P2 P4 P5 P2 P4 P5 P2 P5 P5 P5
0 4 16 21 33 45 57 69 81 93 102 114 123 135 147 158

1.3 GIVEN THE LIST OF THE PROCESSES IN THE FOLLOWING QUEUE IN THE FORM OF DURATION P1 (49), P2(45), P3(15),
P4(73)
- FCFS:
Suppose that the processes arrive in the order: P1, P2, P3, P4
The Gantt chart for the schedule is:

P1 P2 P3 P4
0 49 94 109 182
- Non-preemptive STF and preemptive STF with the same arrival time have the same Gantt chart:

3
 Process Arrival Time Duration
P1 0 49
P2 0 45
P3 0 15
P4 0 73

Gantt chart:

P3 P2 P1 P4
0 15 60 109 182
- Round Robin:
Suppose that the processes arrive in the order: P1, P2, P3, P4, P5
Gantt chart:
P P
P1 P2 P3 P4 P1 P2 P4 P1 P2 P4 P1 P2 P4 P4 P4 P4
3 1
0 12 24 36 48 60 72 75 87 99 111 123 135 144 156 157 169 181 182

(Trong các bài đề bài không đề cập đến thời gian xuất hiện thì hiểu là thời gian xuất hiện cùng là 0)

4
2. APPLY THE CPU SCHEDULING ALGORITHMS: FCFS, NON-PREEMPTIVE STF, SRTF
(PREEMPTIVE STF), ROUND-ROBIN (WITH TIME QUANTUM=15) FOR FOLLOWING
QUEUES.

2.1 GIVEN THE LIST OF THE PROCESSES IN THE FOLLOWING QUEUE IN THE FORM OF (ARRIVAL TIME,
DURATION) P1 (0, 45), P2(3, 23), P3(8, 10), P4(12, 3), P5(40, 17)

Process Arrival Time Duration

P1 0 45
P2 3 23
P3 8 10
P4 12 3
P5 40 17
- FCFS Gantt chart:

P1 P2 P3 P4 P5
0 45 68 78 81 98

- Non-preemptive STF Gantt chart:

P1 P4 P3 P5 P2
0 45 48 58 75 98

- SRTF Gantt chart:

P P P P
P2 P3 P2 P5 P1
1 3 4 1
0 3 8 12 15 21 39 40 57 98

- Round-Robin Gantt chart:

5
 P1 P2 P3 P4 P5 P1 P2 P5 P1
0 15 30 40 43 58 73 81 83 98

2.2 GIVEN THE LIST OF THE PROCESSES IN THE FOLLOWING QUEUE IN THE FORM OF (ARRIVAL TIME, DURATION) P1
(0, 4), P2(5, 45), P3(8, 5), P4(10, 33), P5(15, 71)
Process Arrival Time Duration
P1 0 4
P2 5 45
P3 8 5
P4 10 33
P5 15 71
- FCFS Gantt chart:
P
P2 P3 P4 P5
1
0 4 5 50 55 88 159

- Non-preemptive STF Gantt chart:

P1 P2 P3 P4 P5
0 4 5 50 55 88 159

- STFS Gantt chart:

P P2 P3 P4 P2 P5
1
0 4 5 8 13 46 88 159

- Round-Robin Gantt chart:

P P2 P P
P4 P5 P2 P4 P5 P2 P5 P5 P5
1 3 4
0 4 5 20 25 40 55 70 85 100 115 118 133 148 159

6
 2.3 GIVEN THE LIST OF THE PROCESSES IN THE FOLLOWING QUEUE IN THE FORM OF (ARRIVAL TIME, DURATION) P1
(0, 49), P2(17, 45), P3(20, 15), P4(31, 73)

Process Arrival Time Duration

P1 0 49
P2 17 45
P3 20 15
P4 31 73
- FCFS Gantt chart:

P1 P2 P3 P4
0 49 94 109 182

- Non-preemptive STF Gantt chart:

P1 P3 P2 P4
0 49 64 109 182
- SRTF Gantt chart:
P1 P3 P1 P2 P5
0 20 35 64 109 182
- Round-Robin Gantt chart:

P
P1 P1 P2 P3 P1 P4 P2 P4 P2 P4 P4 P4
1
0 15 30 45 60 75 90 105 109 124 139 154 169 182

7
3 EVALUATE THE ABOVE ALGORITHMS WITH THE METRICS: THROUGHPUT,
TURNAROUND TIME, RESPONSE TIME, WAITING TIME AS WELL AS THEIR AVERAGE
VALUES
Throughput = Number of processess completed per unit time

Turnaround = Exit time - Arrival time

Respond time = Started time - Arrival Time

Waiting time = Turnaround - Respond time

FCFS
METRICS 1.1 1.2 1.3 2.1 2.2 2.3
THROUGHPUT 19.6 31.6 45.5 19.6 31.6 45.5
TURNAROUND TIME 74 70.4 108.5 61.4 63.6 91.5
RESPONSE TIME 54.4 38.8 63 41.8 32 46
WAITING TIME 54.4 38.8 63 41.8 32 46
NON-PREEMPTIVE STF
METRICS 1.1 1.2 1.3 2.1 2.2 2.3
THROUGHPUT 19.6 31.6 45.5 19.6 31.6 45.5
TURNAROUND TIME 39.4 60 91.5 52.2 63.6 84
RESPONSE TIME 19.8 28.4 46 32.6 32 38.5
WAITING TIME 19.8 28.4 46 32.6 32 38.5

SRTF (PREEMPTIVE STF)

METRICS 1.1 1.2 1.3 2.1 2.2 2.3
THROUGHPUT 19.6 31.6 45.5 19.6 31.6 45.5

8
 TURNAROUND TIME 39.4 60 91.5 33.4 54.4 80.5
RESPONSE TIME 19.8 28.4 46 0 15.2 31.25
WAITING TIME 19.8 28.4 46 13.8 22.8 35

ROUND-ROBIN
METRICS 1.1 1.2 1.3 2.1 2.2 2.3
THROUGHPUT 19.6 31.6 45.5 19.6 31.6 45.5
TURNAROUND TIME 63.6 81.6 139.5 56 76.6 105.5
RESPONSE TIME 21.4 14.8 18 17.6 10.4 20.5
WAITING TIME 44 50 94 36.4 45 60