onsider the below algorithm: for (i=1;i < n;i++){ for (j=1;j < m;j++){ Alloc[i][j]=( 2i *( j+1 ) % 7) } } This part of the problem involves in deriving the Allocation matrix for a set of threads for implementing Ba
Consider the below
for (i=1;i < n;i++){
for (j=1;j < m;j++){
Alloc[i][j]=( 2i *( j+1 ) % 7)
} }
This part of the problem involves in deriving the Allocation matrix for a set of threads for implementing Banker's algorithm. Consider the system has five threadts (T0~T4) and five resourses (A~E) [Remember all threads are in CAPITAL letter]. Currents allocation matrix follows the following rule: T0 has allocated resources equal to the value of row A[2] of Alloc[i][j] array, T1 has equal to row A[3], T2 has equal to row A[6], T3 has equal to row A[10] and T4 has equal to row A[12].
[Hints. answer only the values one after another starting with resourse A, then resource B without any space or anything in between. for example - if you insert 12345, that will mean the thread is allocated 1 instance of resource A, 2 instance of resource B and so on. ]
The Maximum Requirment matrix is given below:
T0: 2 6 3 7 6
T1: 6 5 5 3 3
T2: 4 2 8 5 3
T3: 6 6 4 3 2
T4: 7 3 6 2 5
The Available matrix is given below:
2 1 2 1 1
What is the need sequence for thread T0?
Step by step
Solved in 2 steps with 1 images
