Some myths about famous mutual exclusion algorithms
@article{Alagarsamy2003SomeMA,
title={Some myths about famous mutual exclusion algorithms},
author={K. Alagarsamy},
journal={SIGACT News},
year={2003},
volume={34},
pages={94-103}
}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
Streamlining progress-based derivations of concurrent programs
- Computer Science
- Formal Aspects of Computing
- 2007
- 12
- PDF
Model checking with fairness assumptions using PAT
- Computer Science
- Frontiers of Computer Science
- 2013
- 28
- PDF
Multicore Software Development for Embedded Systems: This Chapter draws on Material from the Multicore Programming Practices Guide (MPP) from the Multicore Association
- Computer Science
- 2013
- 1
References
SHOWING 1-4 OF 4 REFERENCES
Shared-memory mutual exclusion: major research trends since 1986
- Computer Science
- Distributed Computing
- 2003
- 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