operating system

Question

Does this solution guarantee

             A) mutual exclusion,

             B) progress,

             C) bounded waiting,

             D) starvation-freedom,

             E) deadlock-freedom 

Comments

@Prashant

Whenever a process P1 has a desire to enter the CS, then the number of processes that will be allowed to enter the CS after which the request of P1 to enter the CS will be entertained, let be $B$.

It Means Say, $B$ is the total number of processes that will be allowed to enter the CS and after that only P1 will enter.

Here, we have $B=0$, i.e no process can enter the CS hence BW is satisfied. BW and Deadlock are independent of each other .

---

What if P₀ always get CS and not P₁.

---

Then, in that case if we have designed synch. mechanism like that ,then BW is not satisfied.

u r right .