Solution of a problem in concurrent programming control

  title={Solution of a problem in concurrent programming control},
  author={Edsger W. Dijkstra},
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 the "critical section" of its cycle. 
Concurrent Algorithms
  • L. Lamport
  • Computer Science
    Edsger Wybe Dijkstra
  • 2022
I have extensively modified Dijkstra’s notation and the way he described the algorithms, reflecting what has been learned in the decades since he did that work (and perhaps my biases).
Tutorial: Designing Distributed Software in mCRL2
This tutorial shows how to create behavioural models of parallel software, how to specify requirements using modal formulas, and how to verify these and discusses the design of an evolution of well-known mutual exclusion protocols and how model checking helps guide their design.
Understanding Control Flow
  • P. Buhr
  • Computer Science
    Springer International Publishing
  • 2016
class, 380 abstraction, 28 accept-blocked, 281, 337 accepting daisy-chain,289 multiple,289 acceptor stack, 270 acceptor/signalled stack, 275, 281, 282, 339 Achermann, Wilhelm, 22 acquire, 190, 193
Contextual Merged Processes
This work integrates two compact data structures for representing state spaces of Petri nets: merged processes and contextual prefixes, and demonstrates on a number of benchmarks that CMPs are more compact than either of the original data structures.
The SPIN Model Checker - primer and reference manual
This is the most comprehensive reference guide to SPIN, written by the principal designer of the tool, and gives detailed advice on methods for tackling the most complex software verification problems.
Adaptive and efficient mutual exclusion
This paper shows how to make the space complexity of this algorithm depend solely on n, while preserving the other performance measures of the algorithm.
Portable high-performance programs
The work-first principle inspired Cilk''s novel ``two-clone'' compilation strategy and its Dijkstra-like mutual-exclusion protocol for implementing the ready deque in the work-stealing scheduler, and good asymptotic bounds on the execution time of Cilk programs that use location-consistent shared memory are proved.
The arbiter: an active system component for implementing synchronizing primitives
  • H. Goeman
  • Computer Science
    Fundam. Informaticae
  • 1981
An active system component, the arbiter, is proposed as a system struc-turing concept for the implementation of synchronizing primitives. The concept is illustrated by showing a new and very simple
Memory Reclamation for Recoverable Mutual Exclusion
This work presents the first “general” recoverable algorithm for memory reclamation in the context of recoverable mutual exclusion, which can be plugged into any RME algorithm very easily and preserves all correctness property and most desirable properties of the algorithm.
A self‐stabilizing distributed algorithm for the local (1,|Ni|)‐critical section problem
The necessary and sufficient conditions to solve the local (1,|Ni|)‐critical section (CS) problem without any deadlock detection are shown and an efficient self‐stabilizing algorithm is proposed under an additional assumption that the graph does not have a special matching, which is called unpreventable colorable maximal matching.