Highly-fair bakery algorithm using symmetric tokens
This note proposes a new version of the bakery algorithm that: (i) assures fair tie-breaking when two or more processes choose same token number; and (ii) bounds the token numbers within the range vertical bar-n, n vertical bar. The algorithm is simple and uses one additional shared bit. (C) 2010 Elsevier B.V. All rights reserved.
fairness bakery algorithm concurrency distributed algorithm mutual exclusion bounded timestamps