Register

deadlock
closed

• closed by
291 views
1 votes
1 votes
closed with the note: duplicate

Consider a system having ‘N ’ resources of the same type. ‘N’ resources are shared between 3 processes P1 , P2 and P3 which have individual peak demand of 4, 6 and 8. The minimum value of ‘N’ to ensure that deadlock will never occur, if it is given the maximum requirement for combination of P1 and P3 is 9 are__________.

• closed by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
Souvik33 asked Dec 19, 2022
376 views
Deadlock prevention techniques | Wait-Die | Wound-Wait
MSQ Which among the following is/are TRUE regarding the deadlock prevention techniques: Wound-wait is premptive Wait-die is non-premptive Starvation is possible in wound-wait Starvation does not occur in wait-die
MSQ Which among the following is/are TRUE regarding the deadlock prevention techniques:Wound-wait is premptiveWait-die is non-premptiveStarvation is possible in wound-wai...
User Avatar
0 votes
0 votes
0 answers
2
Manojkumar Susarla asked Jan 15, 2019
352 views
Does rigorous 2pl causes deadlock.
User Avatar
0 votes
0 votes
0 answers
3
Abhisek Tiwari 4 asked Jan 4, 2019
223 views
Deadlock
“If there is deadlock in a schedule then it will never be Serializable “??if yes why?
“If there is deadlock in a schedule then it will never be Serializable “??if yes why?
User Avatar
1 votes
1 votes
0 answers
4
Ajit J asked Dec 3, 2018
1,768 views
Wait die deadlock prevention strategy
Can the wait die prevention strategy suffer from starvation?
Can the wait die prevention strategy suffer from starvation?
User Avatar
Link Copied!