A visit to mutual exclusion in seven dates - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Theoretical Computer Science Year : 2022

A visit to mutual exclusion in seven dates


Mutual exclusion (mutex) is one of the most fundamental synchronization problems encountered in shared memory systems. It appears in all computer science first-degree curricula. This article presents nine mutex algorithms, each with its noteworthy features, spread over seven dates covering 1965-2020. Most of these algorithms are very well known and paved the way for new research directions. This article aims to present fundamental issues and basic principles that underlie the design of shared memory mutex algorithms in different contexts. So, differently from exhaustive surveys on shared memory mutex algorithms, it strives to give the reader a flavor of the many design facets of this still challenging problem.
Not file

Dates and versions

hal-03920720 , version 1 (03-01-2023)



Michel Raynal, Gadi Taubenfeld. A visit to mutual exclusion in seven dates. Theoretical Computer Science, 2022, 919, pp.47-65. ⟨10.1016/j.tcs.2022.03.030⟩. ⟨hal-03920720⟩
11 View
0 Download



Gmail Facebook Twitter LinkedIn More