Lamport's bakery algorithm

Known as: Baker's algorithm, Bakery algorithm, Lamport Bakery algorithm 
Lamport's bakery algorithm is a computer algorithm devised by computer scientist Leslie Lamport, which is intended to improve the safety in the usage… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1979-2017
024619792017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Lamport’s Bakery Algorithm (Commun ACM 17:453–455, 1974) implements mutual exclusion for a fixed number of threads with the first… (More)
  • figure 1
Is this relevant?
2013
2013
Proof assistants like PVS can be used fruitfully for the design and verification of concurrent algorithms. The technique is… (More)
Is this relevant?
2005
2005
We present a specification of Lamport’s Bakery algorithm written in AsmL specification language. By exploration of the state… (More)
  • figure 1
  • figure 4
  • figure 5
Is this relevant?
2004
2004
A mutual exclusion algorithm is presented that has four desired properties: (1) it satisfies FIFO fairness, (2) it satisfies… (More)
Is this relevant?
2001
2001
We present a model checking algorithm for safety properties that is applicable to parameterized systems and hence provides a… (More)
  • table 1
  • table 3
  • figure 1
  • figure 2
Is this relevant?
1993
1993
In a meeting at Schloss Dagstuhl in June 1993, Uri Abraham and Menachem Magidor have challenged the thesis that an evolving… (More)
Is this relevant?
1990
1990
The Lamport's mutual exclusion exclusion algorithm, also known as the bakery algorithm, is very simple and easy to implement… (More)
Is this relevant?
Highly Cited
1981
Highly Cited
1981
An algorithm is proposed that creates mutual exclusion in a computer network whose nodes communicate only by messages and do not… (More)
  • figure 1
Is this relevant?
Highly Cited
1979
Highly Cited
1979
A new, nonassertional approach to proving multiprocess program correctness is described by proving the correctness of a new… (More)
Is this relevant?