Solution of a problem in concurrent programming control

@article{Dijkstra1965SolutionOA,
  title={Solution of a problem in concurrent programming control},
  author={E. Dijkstra},
  journal={Commun. ACM},
  year={1965},
  volume={8},
  pages={569}
}
  • E. Dijkstra
  • Published 1965
  • Computer Science
  • Commun. ACM
    • 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. 
    View on ACM
    facultyweb.cs.wwu.edu
    743 Citations
    Highly Influencial Citations
    56
    Background Citations
    237
    Methods Citations
    79
    Results Citations
    2

    Topics from this paper.

    Explore Further: Topics Discussed in This Paper

      743 Citations
      Citation Type

      Citation Type

      Adaptive and efficient mutual exclusion
      • 48
      • Highly Influenced
      Contextual Merged Processes
      • 11
      • Highly Influenced
      • PDF
      Portable high-performance programs
      • 24
      • Highly Influenced
      • PDF
      The SPIN Model Checker - primer and reference manual
      • 1,828
      • Highly Influenced
      • PDF
      The arbiter: an active system component for implementing synchronizing primitives
      • H. Goeman
      • Mathematics, Computer Science
      • Fundam. Informaticae
      • 1981
      • 4
      • Highly Influenced
      Understanding Control Flow
      • P. Buhr
      • Computer Science
      • Springer International Publishing
      • 2016
      • 5
      • Highly Influenced
      A fine-grained solution to the mutual exclusion problem
      • 14
      • Highly Influenced
      • PDF
      An operating systems vade mecum
      • 29
      • Highly Influenced
      Avoiding Register Overflow in the Bakery Algorithm
      Concurrent programming and composite Newton methods