Question

A single processor system has three resource types X, Y and Z, which are shared by three processes. There are 5 units of each resource type. Consider the following scenario, where the column alloc denotes the number of units of each resource type allocated to each process, and the column request denotes the number of units of each resource type requested by a process in order to complete execution. Which of these processes will finish LAST?

alloc request P0 121 103 P1 201 012 P2 221 120

Answer 1

alloc request XYZ XYZ P0 121 103 P1 201 012 P2 221 120

So the available matrix is (0, 1, 2) and the requirement of process $P_1$ is (0, 1,2) and the requirement of process $P_1$ is (0,1,2) so $P_1$ can use the available resources after releasing the resources the matrix becomes:

alloc request XYZ XYZ P0 121 103 P1 000 000 P2 221 120

In this time available matrix is (2 1 3) and required matrix of $P_0$ is (1 0 3) so $P_0$ uses the resources of the releasing the reource. T the available matrix is (3,3,4) so $P_2$ will use the resources , $P_2$ will finish last.