GATEBOOK MOCK - 1 Operating System

Question

Which of the following is true?

A. starvation implies no bounded waiting
B. No Bounded waiting implies starvation
C. If a solution does not have starvation problem, it always satisfies bounded waiting
D. They are independent of each other

 

My logic:

We know that if there is Bounded Waiting then every process will have to wait for a limited time(or a limited number of other processes) before getting to the CS. So, this means that process won't starve. So,

Bounded Waiting implies No starvation.

Bounded Waiting -> ~ Starvation

Contrapositive of p -> q is ~q -> ~p which has the same truth value.

Contrapositive of above statement will be:

Starvation -> ~ Bounded Waiting

That is option (A).

Answer given is (D). Can someone tell me where is the flaw in my logic?

Comments

Answer is D)

Bounded waiting can be satisfied in case of Deadlock.

https://cs.stackexchange.com/questions/63730/how-to-satisfy-bounded-waiting-in-case-of-deadlock

if a system suffers from deadlock, it also suffers from starvation.

So having starvation does not say anything about BW.

---

Thanks, Shivam.

So, we can only say:

deadlock -> starvation

and, it's contrapositive

~starvation -> ~ deadlock

??

---

Yes Bro

Answer 1

http://www.csl.mtu.edu/cs3331.ck/common/05-Sync-Basics.pdf

last pages of slides are enough