#18 Bakery's algorithm | Solving Critical Section Problem | Bakery Algorithm in Process

Bakery's algorithm example,
Bakery's algorithm pdf,
Lamport bakery's algorithm,
bakery algorithm example,
bakery algorithm in os,
bakery algorithm in os pdf,
bakery algorithm in c,
bakery algorithm code,
#algorithm #bakery #problem

[@roycrxtw]

A thumbs up for your clear English.

[@academia3303]

Thx

[@MuhammadWajahatHussain-f6z]

It really was short and clear to grab the concept. Hats off for you man.

[@academia3303]

Good

[@pratikkumarbulani8903]

The braces in the code are incorrectly placed. The actual code is:
lock(i): // Here process i is trying to acquire the lock
choosing[i] = true
token[i] = 1 + MAX(token[0], token[1], ..., token[n-1]) // Here n = number of parallel processes trying to execute the critical section
choosing[i] = false
for(p = 0; p < n; p++):
while(choosing[p]);
while(token[p] != 0 && (token[p], p) < (token[i], i));
done
unlock(i): // Here process i is trying to release the lock
token[i] = 0;
done

[@academia3303]

@@pratikkumarbulani8903 thanks

[@OghamTheBold]

Should it be - while ( choosing[j] ); 👈
It is confusing without the locks - I think the locks are the key

[@AKPK-u5d]

Can you send me the link of PPT which is used in these videos