Register

GO Classes DPP | OS | RESOURCE ALLOCATION

229 views
3 3 votes

In a system with $5$ processes and $12$ identical resources, each process requires a maximum of $3$ resources to complete its execution.

What is the minimum number of resources required to ensure the system is NEVER in a deadlock?

2 Answers

0 0 votes

To find the minimum resources $R$ to avoid deadlock, we use the formula:

$$
R \geq \sum_{i=1}^n\left(\text { Max_Need }_i-1\right)+1
$$

  • Number of processes $(n)=5$
     
  • $Max$_$Need$ for each $= 3$
     
  • $R \geq(3-1) \times 5+1$
     
  • $R \geq 2 \times 5+1=11$
Voting & Accepting an answer helps improve the community
Answer:
← Previous · GO Classes DPP | OS ...Next → · GO Classes DPP | OS ...
← Previous in category · GO Classes DPP | OS ...Next in category → · GO Classes DPP | OS ...
Position:
Show:

Related questions

5 5 votes
1 1 answer
292
292 views
GO Classes asked Feb 21
292 views
GO Classes DPP | OS | DISK
Consider a disk with a sector size of $512$ bytes, $2000$ tracks per surface, $50$ sectors per track, and $5$ double-sided platters. A file of size $1 \mathrm{MB}(1 \math...
5 5 votes
2 2 answers
243
243 views
GO Classes asked Feb 21
243 views
GO Classes DPP | OS | PAGE REPLACEMENT
A system uses the LRU (Least Recently Used) page replacement algorithm with $3$ empty frames. The page reference string is: $1,2,1,3,7,4,1,2,1$.How many page faults will ...
7 7 votes
3 3 answers
285
285 views
GO Classes asked Feb 21
285 views
GO Classes DPP | OS | PROCESS SCHEDULING
Consider three processes $P_1, P_2$, and $P_3$ arriving at time $t=0$ with burst times $10,5 ,$ and $8$ respectively. The scheduler uses Preemptive Shortest Remaining Tim...
3 3 votes
1 1 answer
213
213 views
GO Classes asked Feb 21
213 views
GO Classes DPP | OS | SEMAPHORES
A counting semaphore $S$ is initialized to $10 $. The following operations are performed in order:$8 P(S)$ operations, followed by $3 V(S)$ operations, followed by $1 P(S...