Further comments on Dijkstra's concurrent programming control problem

Authors:
Murray A. Eisenberg;Michael R. McGuire
Affiliations:
The MITRE Corp., Bedford, MA;The MITRE Corp., Bedford, MA
Venue:
Communications of the ACM
Year:
1972

Citing 3
Cited 22

Additional comments on a problem in concurrent programming control

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

A fast mutual exclusion algorithm

ACM Transactions on Computer Systems (TOCS)
A simple solution to Lamport's concurrent programming problem with linear wait

ICS '88 Proceedings of the 2nd international conference on Supercomputing
Distributed FIFO allocation of identical resources using small shared space

ACM Transactions on Programming Languages and Systems (TOPLAS)
A first-come-first-served mutual-exclusion algorithm with small communication variables

ACM Transactions on Programming Languages and Systems (TOPLAS)
Implementation of classical mutual exclusion algorithms in Ada

ACM SIGAda Ada Letters
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)
A New Solution to Lamport's Concurrent Programming Problem Using Small Shared Variables

ACM Transactions on Programming Languages and Systems (TOPLAS)
Basic Techniques for the Efficient Coordination of Very Large Numbers of Cooperating Sequential Processors

ACM Transactions on Programming Languages and Systems (TOPLAS)
An optimal algorithm for mutual exclusion in computer networks

Communications of the ACM
A new solution of Dijkstra's concurrent programming problem

Communications of the ACM
A proposal for certain process management and intercommunication primitives

ACM SIGOPS Operating Systems Review
A survey of permission-based distributed mutual exclusion algorithms

Computer Standards & Interfaces
Economical solutions for the critical section problem in a distributed system (Extended Abstract)

STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
A new solution to the critical section problem

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
A structure for interprocess communication in a data communications handler

ACM '76 Proceedings of the 1976 annual conference
Asynchronous interactions on shared data

ACM SIGOPS Operating Systems Review
Mutual exclusion with linear waiting using binary shared variables

ACM SIGACT News
Asynchronous group mutual exclusion

Distributed Computing
Integrating heterogeneous information services using JNDI

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
A distributed synchronization mechanism for interacting processes

Computer Languages

Quantified Score

Hi-index	48.25

Visualization

Abstract

E.W. Dijkstra [1] presented an algorithm whereby N mainly independent computers, with a common data store as their sole means of communication, could contend for exclusive control of any given resource (storage, I/O, etc.). To use the resource, a computer had to gain access to the “critical section” of the algorithm, within which one and only one computer at a time could be executing.