Some myths about famous mutual exclusion algorithms

  title={Some myths about famous mutual exclusion algorithms},
  author={K. Alagarsamy},
  journal={SIGACT News},
  • K. Alagarsamy
  • Published 2003
  • Computer Science
  • SIGACT News
  • Dekker's algorithm[9] is the historically first software solution to mutual exclusion problem for 2-process case. The first software solution for n-process case was subsequently proposed by Dijkstra[8]. These two algorithms have become de facto examples of mutual exclusion algorithms, for their historical importance. Since the publication of Dijkstra's algorithm, there have been many solutions proposed in the literature [24, 1, 2]. In that, Peterson's algorithm [21] is one among the very… CONTINUE READING
    11 Citations

    Figures, Tables, and Topics from this paper

    Streamlining progress-based derivations of concurrent programs
    • 12
    • PDF
    Simulation of Self-Stabilizing Distributed Algorithms to Determine Fault Tolerance Measures
    • 2
    • PDF
    AltaRica Examples Proof of Peterson ’ s algorithm for mutual exclusion ∗
    • Highly Influenced
    • PDF
    Towards a Toolkit for Flexible and Efficient Verification under Fairness
    • 3
    • PDF
    Model checking with fairness assumptions using PAT
    • 28
    • PDF


    Shared-memory mutual exclusion: major research trends since 1986
    • 106
    • Highly Influential
    • PDF
    Infeld, The Evolution of Physics - The Growth of Ideas from Early Concepts to Relativity and Quanta
    • 1971
    Cooperating Sequential Processes (Techniche Hogeschool
    • Eindhoven, 1965). Reprinted in: F. Genuys (ed.), Programming Languages, Academic Press
    • 1968
    Operating Systems: Adavanced Concepts, The Benjamin/Cummings Publishing Company, Inc
    • Principles of Operating Systems,
    • 1988