edited by
1,307 views

2 Answers

Best answer
5 votes
5 votes
1. Progress Satisfied => Deadlock free  : Valid

2. Starvation free => Deadlock free  :   Valid

3.Starvation freedom => Bounded wait : Invalid

Bounded-Waiting does not say if a process can actually enter into CS with finite time . It only says there is a bound. So , in case of BW satisfied , still there is Starvation possible. ( all process may lock up in entry section , a process p1 can go to CS many times without giving p2 a chance still there BW satisfy but p2 is starving )

That's why it is Invalid.

Starvation + Progress >> Bounded Wait :  Valid
edited by
–1 votes
–1 votes
I is valid (progress satisfied , every progress gets required resources to it is deadlock free automatically)

II is invalid ( it is not in all cases ,may be there is dependency of resources)

III is invalid (starvation is long time wait , may be not surely bounded . It may be unbounded also)

Related questions

1 votes
1 votes
2 answers
1
Vaishnavi Gadhe asked Jul 2, 2022
694 views
A particular computation of counting semaphore is 7 Then 20p operation and x. V operation were completed on this semaphore If the final value of X will be 5 then what wi...