A fast mutual exclusion algorithm
Leslie Lamport · ACM Transactions on Computer Systems · 1987
A new solution to the mutual exclusion problem is presented that, in the absence of contention, requires only seven memory accesses. It assumes atomic reads and atomic writes to shared registers.
Cited by 491 works. doi:10.1145/7351.7352 Open-access PDF
Authors
References
- Proving the Correctness of Multiprocess Programs
- Solution of a problem in concurrent programming control
- Solution of a problem in concurrent programming control
- An axiomatic proof technique for parallel programs I
- Proving Liveness Properties of Concurrent Programs
- Additional comments on a problem in concurrent programming control
- Additional comments on a problem in concurrent programming control
- Further comments on Dijkstra's concurrent programming control problem
- Experience Using Multiprocessor Systems—A Status Report