Bounding Lamport’s Bakery Algorithm

Abstract

Lamport’s Bakery algorithm is among the rest known mutual exclusion algorithms. A drawback of Lamport’s algorithm is that it requires unfounded registers for communication among processes. By making a small modification to Lamport’s algorithm, we remove the need for unfounded registers. The main appeal of our algorithm lies in the fact that it overcomes a drawback of a famous algorithm while preserving its elegance.