A fast mutual exclusion algorithm
Author:
Open Access
- 5 January 1987
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Computer Systems
- Vol. 5 (1) , 1-11
Abstract
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.Keywords
This publication has 8 references indexed in Scilit:
- Proving Liveness Properties of Concurrent ProgramsACM Transactions on Programming Languages and Systems, 1982
- Experience Using Multiprocessor Systems—A Status ReportACM Computing Surveys, 1980
- An axiomatic proof technique for parallel programs IActa Informatica, 1976
- Further comments on Dijkstra's concurrent programming control problemCommunications of the ACM, 1972
- Additional comments on a problem in concurrent programming controlCommunications of the ACM, 1967
- Assigning meanings to programs1967
- Additional comments on a problem in concurrent programming controlCommunications of the ACM, 1966
- Solution of a problem in concurrent programming controlCommunications of the ACM, 1965