The bakery algorithm has the remarkable property that it does not require atomic (all-or-nothing) writes to shared memory: if one process reads a register while another is writing to it, the reader can get any arbitrary value and the algorithm still works correctly.

factualpending

Speaker

Leslie Lamport

Evidence Quote

If somebody read if one process read while the registers was being written that process reading process could get absolutely any value and the algorithm still worked.

Source

Turing Award Winner: Thinking Clearly, Paxos vs Raft, Working With Dijkstra | Leslie LamportRyan Peterman
Created: 8/12/2026, 6:17:50 PM

My Notes

Loading notes...