A new solution of Dijkstra's concurrent programming problem

@inproceedings{Lamport1974ANS,
  title={A new solution of Dijkstra's concurrent programming problem},
  author={Leslie Lamport},
  booktitle={CACM},
  year={1974}
}
  • L. Lamport
  • Published in CACM 1 August 1974
  • Computer Science
A simple solution to the mutual exclusion problem is presented which allows the system to continue to operate despite the failure of any individual component. 
View on ACM
cs.tcd.ie
466 Citations
Highly Influential Citations
38
Background Citations
121
Methods Citations
122
Results Citations
1

466 Citations

Message passing mutex
TLDR
This work presents a new solution of the mutual exclusion problem, which is modelled as a Petri net, and extends Petri nets by the concepts of progress and non-progress transitions and fair arcs.
A Simple and Efficient Solution for Room Synchronization Problem in Distributed Computing
TLDR
The room synchronization problem aims at achieving exclusive access to shared data while facilitating suitable concurrency in room synchronization applications that require concurrent data sharing.
An Interleave Principle for Demonstrating concurrent Programs
Although they want to know whether their concurrent programs are working properly, programmers may not need a rigorous proof of correctness.
Lamport's algorithm reconsidered
TLDR
A modification to Lamport's algorithm that eliminates busy waiting is presented and the algorithm is modified further to recognize and honor priorities.
A More Efficient Generalization of Petersons's Mutual Exclusion Algorithm
A Distributed Synchronization Mechanism for Interacting Processes
A New Approach to Proving the Correctness of Multiprocess Programs
A new, nonassertional approach to proving multiprocess program correctness is described by proving the correctness of a new algorithm to solve the mutual exclusion problem. The algorithm is an…
The synchronization of independent processes
TLDR
An algorithm is given which implements a powerful synchronizing primitive under very weak assumptions about the nature of interprocess communication, and a careful informal proof of its correctness is given.
Petri Net Model for Ricart and Agrawala’s Mutual Exclusion Algorithm
TLDR
A Ricart and Agrawala mutual exclusion algorithm is investigated and simulation model of the system based on Petri Nets is described, and results are presented and evaluated.
Concurrent reading and writing
The problem of sharing data among asynchronous processes is considered. It is assumed that only one process at a time can modify the data, but concurrent reading and writing is permitted. Two gener...
...
...

References

SHOWING 1-10 OF 21 REFERENCES
Solution of a problem in concurrent programming control
A number of mainly independent sequential-cyclic processes with restricted means of communication with each other can be made in such a way that at any moment one and only one of them is engaged in…
Further comments on Dijkstra's concurrent programming control problem
TLDR
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.) was presented.
Additional comments on a problem in concurrent programming control
TLDR
Professor Dijkstra's ingenious construction and Hyman's "simplification" for the case of two computers hardly works at all, and it is hoped that this letter can save people some of the problems they would encounter if they were to use either of those methods.
The structure of the “THE”-multiprogramming system
TLDR
A multiprogramming system is described in which all activities are divided over a number of sequential processes, in each of which one or more independent abstractions have been implemented.
An Algorithm for Determining the Chromatic Number of a Graph
A heuristic algorithm for the determination of the chromatic number of a finite graph is presented. This algorithm is based on Zykov’s theorem for chromatic polynomials, and extensive empirical tests…
Generalized Graph Colorations
The coloration of graphs having vertices preassigned to specific colors is discussed. Also considered is the case of graphs which have vertices that are not to be assigned to specified colors, with…
Matrix reduction using the Hungarian method for the generation of school timetables
TLDR
This paper is based on the "Hungar ian Method" for the Assignment problem, and proposes the method of the " t ight set search," whose theoretical basis is a theorem by P. Hall [5] on the existence of sets of distinct representatives.
Some Results Concerning the Reduction of Binary Matrices
The problem of ma t r ix reduct ion is defined and considered for the special case where one e lement is changed in a mat r ix which was formerly reduced. Three a lgor i thms are der ived including…
An upper bound for the chromatic number of a graph and its application to timetabling problems
The Ontario school scheduling program
...
...