Lamport: a new solution of Dijkstra's concurrent programming problem

What changed

Gave the bakery ticket algorithm and a correctness argument tolerant of overlapping reads and writes returning arbitrary values.

Scientific scope

The record is Lamport's sole-author 1974 Communications of the ACM paper. It solves the stated shared-memory mutual-exclusion problem under its process and progress assumptions; simplified atomic-read variants, later refinements and distributed lock services remain separate.

Evidence

The linked sources identify this contribution and its scope. WRS has not independently reconstructed the scientific claims. The record is Lamport's sole-author 1974 Communications of the ACM paper. It solves the stated shared-memory mutual-exclusion problem under its process and progress assumptions; simplified atomic-read variants, later refinements and distributed lock services remain separate.

Contributors

• Leslie Lamport · SCIENCE: Named source author of the scoped work; individual effort shares are not measured.

• Microsoft Research page for Lamport bakery paper
• Leslie Lamport author-hosted bakery paper

Provisional WRS assessment, edition 2026-10-16.1. Independent expert calibration is pending. This grade does not certify correctness or assign ownership.

Full scientific record · Browse contribution grades · Request a correction