105
Software solutions
nWe consider first the case of 2 processes
uAlgorithm
1 and 2 are incorrect
uAlgorithm
3 is correct (Peterson’s algorithm)
nThen we generalize to n processes
uthe
bakery algorithm
nNotation
uWe
start with 2 processes: P0 and P1
uWhen
presenting process Pi, Pj always denotes the other process (i != j)