Synchronization

Question

I think bounded waiting is satisfied ??

 

Comments

yes bounded waiting is of course satisfied

because i and j cannot be true at the same time

---

Here Dead lock possible ===> no need to talk about Bounded waiting

 @srestha, mam

because i and j cannot be true at the same time

why? 

moreover, it's look like as " interested variable " model synchronization method

---

here given i=0 and 1

what is j value initially?

---

here given i=0 and 1

wrong...  see the complete sentence... flag[i] = false for i=0 and 1 initially. ===> flag[] = {false, false}

Note that it is for 2-processes only, i.e., P₀ and P₁

But coming into while loop, i represents current process and j represents remaining process

if you are working on P0 ===> i=0 and j=1

if you are working on P1 ===> i=1 and j=0

 

---

process can go CS , only when flag[j] is false

where are u getting

P0 ===> i=0 and j=1

is i and j really dependable?? 

---

where are u getting

in the question, at last they mention

Assume that  i refers current process P_i and j refers other process P_j.

---

is i and j really dependable?? 

the code is copied for each process, therefore each and every process have it's own copy of code

we should have to refer the variable as 

P₀.i and P₀.j

P₁.i and P₁.j 

---

Yes in this question bounded waiting is satisfied because in one time only one process can enter in critical section and other can get chance after one can leave. Moreover there is deadlock but Deadlock means no progress and progress not related to Bounded Wait. So Deadlock not related to BW.