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… Expand
Model Checking Mutual Exclusion Algorithms Using Uppaal
TLDR
An approach to modelling and exhaustive verification of mutual exclusion algorithms which is based on Timed Automata in the context of the popular Uppaal toolbox is proposed, making it possible to study the properties of a mutual exclusion algorithm also in the presence of the time dimension. Expand
Streamlining progress-based derivations of concurrent programs
TLDR
This work explores derivation techniques of concurrent programs using progress-based reasoning and presents a derivation of Dekker’s mutual exclusion algorithm, leading to the discovery of some new and simpler variants of this famous algorithm. Expand
Simulation of Self-Stabilizing Distributed Algorithms to Determine Fault Tolerance Measures
Fault tolerance measures such as reliability and availability are employed to select the most suitable fault tolerant system to be deployed under a given environment. Although such measures have beenExpand
Towards a Toolkit for Flexible and Efficient Verification under Fairness
Recent development on distributed systems has shown that a v ariety of fairness constraints (some of which are only recently defi ned) play vital roles in designing self-stabilizing populationExpand
Model checking with fairness assumptions using PAT
TLDR
This work supports model checking of distributed systems in the toolkit PAT (process analysis toolkit), with a variety of fairness constraints, and shows through empirical evaluation that PAT has advantage in model checking with fairness. Expand
Specifying and Verifying Event-Based Fairness Enhanced Systems
TLDR
It is shown that state-of-the-art verification algorithms can be extended to verify models under fairness assumptions, with little computational overhead, and a toolset named Pat has been developed to verify fairness enhanced event-based systems. Expand
Multicore Software Development for Embedded Systems: This Chapter draws on Material from the Multicore Programming Practices Guide (MPP) from the Multicore Association
TLDR
This chapter is a summary of key sections of the recently released Multicore Programming Practices (MPP), written specifically for engineers and engineering managers of companies considering or implementing a development project involving multicore processors and favoring use of existing multicore technology. Expand
Nueva propuesta para la administración de recursos y procesos en sistemas distribuidos
En los sistemas de procesamiento distribuido es necesario que los procesos que actúan en grupos deban tomar decisiones basados en acuerdos respecto del acceso a recursos; las decisiones pueden estarExpand
AltaRica Examples Proof of Peterson ’ s algorithm for mutual exclusion ∗
4 Checking the model 6 4.1 Validation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 4.2 Mutual exclusion . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 4.3 Liveness . . . .Expand
...
1
2
...

References

SHOWING 1-10 OF 35 REFERENCES
Another Solution of the Mutual Exclusion Problem
TLDR
Another solution of the mutual exclusion problem for multiple concurrent processes is presented and it is shown that in a system with n processes, a given process may be delayed while up to 2” 1 other processes’ critical sections are executed. Expand
Algorithms for mutual exclusion
TLDR
All of the algorithms in this book have been rewritten in a single language and restructured so that they are easy to understand and compare, and the principles guiding their design are stressed. Expand
Go to statement considered harmful
TLDR
In form and content, Dijkstra's letter is similar to his 1965 paper, and the last few paragraphs underscore once again why the subject of structured programming stayed out of the mainstream of the data processing industry for so long. Expand
Letters to the editor: go to statement considered harmful
TLDR
My considerations are that, although the programmer's activity ends when he has constructed a correct program, the process taking place under control of his program is the true subject matter of his activity, and that his intellectual powers are rather geared to master static relations and his powers to visualize processes evolving in time are relatively poorly developed. Expand
Shared-memory mutual exclusion
TLDR
This paper surveys major research trends since 1986 in work on shared-memory mutual exclusion with a focus on algorithms for mutual exclusion. Expand
Hierarchical ordering of sequential processes
TLDR
A “director-secretary” relationship will be introduced to reflect a possible discipline in the use of sequencing primitives and an analysis of the requirements of the correctness proofs will give an insight into the logical issues at hand. Expand
Concurrent programming - principles and practice
TLDR
Language Overviews, Programming Notation, Formal Semantics and Program Proofs, Synchronization Techniques, and Implementation: Synchronous Message Passing. Expand
Foundations of Multithreaded, Parallel, and Distributed Programming
TLDR
The Concurrent Computing Landscape, The Essence of Concurrent Programming, and Applications and Programming Styles: A Synopsis of Axiomatic Semantics are presented. Expand
Shared-memory mutual exclusion: major research trends since 1986
TLDR
This paper surveys major research trends since 1986 in work on shared-memory mutual exclusion with a focus on algorithms for mutual exclusion. Expand
Operating Systems
  • M. Malik
  • Medicine
  • Lecture Notes in Computer Science
  • 1974
TLDR
Write a multithreaded program that generates the Fibonacci sequence using Pthreads library and place the sequence in data that is shared by the threads (an array is probably the most convenient data structure). Expand
...
1
2
3
4
...