Mutual exclusion with linear waiting using binary shared variables

Authors:
James E. Burns
Affiliations:
Georgia Institute of Technology, Atlanta, Georgia
Venue:
ACM SIGACT News
Year:
1978

Citing 3
Cited 11

Further comments on Dijkstra's concurrent programming control problem

Communications of the ACM
Additional comments on a problem in concurrent programming control

Communications of the ACM
Solution of a problem in concurrent programming control

Communications of the ACM

The mutual exclusion problem: partII—statement and solutions

Journal of the ACM (JACM)
Asynchronous group mutual exclusion (extended abstract)

PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Data Requirements for Implementation of N-Process Mutual Exclusion Using a Single Shared Variable

Journal of the ACM (JACM)
Decentralized Simulation of Resource Managers

Journal of the ACM (JACM)
Parallel programs: proofs, principles, and practice

Communications of the ACM
Simple Mutual Exclusion Algorithms Based on Bounded Tickets on the Asynchronous Shared Memory Model

COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Time-space trade-offs for asynchronous parallel models (Reducibilities and Equivalences)

STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Shared-memory mutual exclusion: major research trends since 1986

Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Asynchronous group mutual exclusion

Distributed Computing
Reducers and other Cilk++ hyperobjects

Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Tight space bounds for l-exclusion

DISC'11 Proceedings of the 25th international conference on Distributed computing

Quantified Score

Hi-index	0.02

Visualization

Abstract

The problem of mutual exclusion among N asynchronous, parallel processes using only shared binary variables for communication is considered. Upper and lower bounds of N+1 and N shared binary variables, respectively, are shown for the problem of mutual exclusion with linear waiting. Lockout-free mutual exclusion is shown to require at least N shared binary variables when the primitive operations are suitably restricted. This latter bound is tight for N=2.