Question

A flickering register has the property that if a read() call overlaps a write() call, then the value returned can be either the new value or the old. A read() that does not overlap a write() returns the last value written. (Note that a flickering register is not linearizable.) An unsafe register has the property that if a read() call overlaps a write() call, then the value returned can be arbitrary. A read() that does not overlap a write() returns the last value written. An wraparound register has the property that there is a value v such that adding 1 to v yields 0, not v + 1. If we replace the Bakery algorithm’s shared variables with either flickering, unsafe, or wraparound registers, then does it still satisfy (1) mutual exclusion, (2) first-come-first-served ordering? You should provide six answers (some may imply others). Justify each claim.

Answer 1

Algorithm analysis can bring various conditions

Fuereing Register」 Case 2 hen Wrabaround Keas

e baker r hocesses take a munaer and wat do of roe ublc Bake Cestm seuw 4- リ-414
[Kindly reverse, there is some thing wrong with the software in my laptop]

3 le →- Te Schedule eaterested-threada To Lock Publie void locr lolbel label Lo There ersh Label value of K --IS SMaller tha& label J velue ot i

5 then dhere will be an ansbiguity that of label is o or 1s seme other erved loll not be一一.wbrkwAQ 化 W/U we uied wrapannund beneficial- pon label-vanable as there an ubber bas to mumb cesgo oside Ohis can ensure mutu
.